Efficient ray shooting and hidden surface removal
- 1 July 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 12 (1) , 30-53
- https://doi.org/10.1007/bf01377182
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Counting and cutting cycles of lines and rods in spaceComputational Geometry, 1992
- Hidden surface removal for c-oriented polyhedraComputational Geometry, 1992
- An optimal convex hull algorithm and new results on cuttingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Ray shooting in polygons using geodesic triangulationsPublished by Springer Nature ,1991
- Quasi-optimal upper bounds for simplex range searching and new zone theoremsPublished by Association for Computing Machinery (ACM) ,1990
- Visibility and intersection problems in plane geometryDiscrete & Computational Geometry, 1989
- Ray shooting and other applications of spanning trees with low stabbing numberPublished by Association for Computing Machinery (ACM) ,1989
- Ray Tracing Algorithms — Theory and PracticePublished by Springer Nature ,1988
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987