ACM Home Page
Please provide us with feedback. Feedback
The geometry of beam tracing
Full text PdfPdf (679 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the first annual symposium on Computational geometry table of contents
Baltimore, Maryland, United States
Pages: 55 - 61  
Year of Publication: 1985
ISBN:0-89791-163-6
Authors
Norm Dadoun  University of British Columbia, Vancouver, British Columbia
David G. Kirkpatrick  itish Columbia
John P. Walsh  Artec Consultants Inc., New York City, New York
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 48,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/323233.323241
What is a DOI?

ABSTRACT

A solution to the hidden surface elimination problem called Beam Tracing is described. Beam tracing is related to ray tracing but uses spatial coherence within the scene, and area coherence within the image to batch computations. Beam tracing is an object space solution to the hidden surface problem. Beam tracing is formulated in terms of its principal subprocesses: intersection, sorting, and clipping. A Hierarchical Scene Representation is proposed. This incorporates the space decomposition idea of the BSP tree [Fuchs, Kedem and Naylor, 80] along with the convex polytope intersection detection technique of [Dobkin and Kirkpatrick, 83] to interleave and efficiently solve the intersection and sorting subproblems of beam tracing.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
[Dadoun, 82] Dadoun, N. "Hierarchical Approaches to The Hidden Surface Problem", M.Sc. Thesis, University of British Columbia, Vancouver, Canada, December, 1982.
 
5
[Dadoun, Kirkpatrick and Walsh, 82] Dadoun, N., Kirkpatrick, D. G., and Walsh, J. P. "Hierarchical Approaches to Hidden Surface Intersection Testing", Proceedings Graphics Interface 82, NCGA, Toronto, May, 1982.
 
6
[Dadoun, Kirkpatrick and Walsh, 85] Dadoun, N., Kirkpatrick, D. G., and Walsh, J.P. "Hierarchical Methods for Beam Tracing", In Preparation, 1985.
 
7
[Dobkin and Kirkpatrick, 83] Dobkin, D. P. and Kirkpatrick, D. G. "Fast Detection of Polyhedral Intersections", Theoretical Computer Science, 17, 1983, pp. 241-253.
8
9
 
10
[Glassner, 84] Glassner, Andrew S. "Space Subdivision for Fast Ray Tracing", CG&A, Vol. 4, No. 10, October, 1984, pp. 15-22.
11
 
12
[Kirkpatrick, 83] Kirkpatrick, D. G. "Optimal Search in Planar Subdivisions", SIAM Journal on Computing, 12(1), 1983, pp. 28-35.
13
 
14
[Roth, 82] Roth, S. D. "Ray Casting for Modelling Solids", CGIP, Vol. 18, February, 1982, pp. 109-144.
15
16
17
 
18
[Walsh, 79] Walsh, J. "The Simulation of Directional Sound Sources in Rooms by Means of a Digital Computer" M. Mus. Thesis, University of Western Ontario, London, Canada, Fall, 1979.
 
19
[Walsh and Dadoun, 81] Walsh, J. and Dadoun, N. "The Design and Development of Godot: A System for Room Acoustics Modelling", presented at 101st meeting of the Acoustical Society of America, Ottawa, May, 1981.
 
20
[Walsh and Dadoun, 82] Walsh, J. and Dadoun, N. "What Are We Waiting for? Development of Godot II", presented at 103rd meeting of the Acoustical Society of America, Chicago, April, 1982.
21
22
23


Collaborative Colleagues:
Norm Dadoun: colleagues
David G. Kirkpatrick: colleagues
John P. Walsh: colleagues