ACM Home Page
Please provide us with feedback. Feedback
Accelerated occlusion culling using shadow frusta
Full text PdfPdf (1.19 MB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the thirteenth annual symposium on Computational geometry table of contents
Nice, France
Pages: 1 - 10  
Year of Publication: 1997
ISBN:0-89791-878-9
Authors
T. Hudson  Department of Computer Science, University of North Carolina, Chapel Hill, NC
D. Manocha  Department of Computer Science, University of North Carolina, Chapel Hill, NC
J. Cohen  Department of Computer Science, University of North Carolina, Chapel Hill, NC
M. Lin  U.S. Army Research Office and Department of Computer Science, University of North Carolina, Chapel Hill, NC
K. Hoff  Department of Computer Science, University of North Carolina, Chapel Hill, NC
H. Zhang  Department of Computer Science, University of North Carolina, Chapel Hill, NC
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): 1,   Downloads (12 Months): 26,   Citation Count: 22
Additional Information:

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/262839.262847
What is a DOI?

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.

ARB90
 
BCG+96
G. Barequet, B. Chazelle, L. Guibas, J. Mitchell, and A. Tal. Boxtree: A hierarchical representation of surfaces in 3(t. In Proc. of Eurographics'96, t996.
 
BDEG94
M. Bern, D. Dobkin, D. Eppstein, and R. Grossman. Visibility with a moving point of view. Algorithmica, 11:360-78, 1994.
 
Cha89
B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci., pages 586-591, 1989.
Cla76
Cla88
CLMP95
Cro77
CT96
CT97
 
Dor94
S.E. Dorward. A survey of object-space hidden surface removal. Internat. J. Comput. Geom. Appl., 4:325-362, 1994.
 
FDHF90
FKN80
 
For96
 
GBW90
B. Garlick, D. Bourn, and J. Winger. Interactive viewing of large geometric databases using multiprocessor graphics workstations. Siggraph'90 course notes: Parallel Algorithms and Architectures for 3D Image Generation, 1990.
 
GCS91
 
GJK88
E.G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between objects in three-dimensional space. IEEE J. Robotics and Automation, vol RA-4:193--203, 1988.
GKM93
GLM96
 
Gre94
 
HHK89
 
HKM95
M. Held, J.T. KIosowski, and J.S.B. Mitchell. Evaluation of collision detection methods for virtual reality fly-throughs. In Canadian ConJerence on Computational Geometry, 1995.
KK86
 
LC91
M.C. Lin and John F. Canny. Efficient algorithms for incremental distance computation. In IEEE Conference on Robotics and Automation, pages 1008-1014, 1991.
LG95
McK87
MN95
MS85
Mul89
 
Nay92
Sei90
SSS74
TS91
 
YR96
Ft. Yagel and W. Ray. Visibility computations for efficient walkthrough of complex environments. PreJ- ence, 5(1):1-16, 1996.
 
ZMHH97

CITED BY  22

Collaborative Colleagues:
T. Hudson: colleagues
D. Manocha: colleagues
J. Cohen: colleagues
M. Lin: colleagues
K. Hoff: colleagues
H. Zhang: colleagues