Linear data structures for fast ray-shooting amidst convex polyhedra
From MaRDI portal
Publication:834599
DOI10.1007/s00453-008-9220-0zbMath1189.68154MaRDI QIDQ834599
Haim Kaplan, Micha Sharir, Natan Rubin
Publication date: 27 August 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9220-0
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
68T45: Machine vision and scene understanding
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ray shooting, depth orders and hidden surface removal
- Visibility with a moving point of view
- On range searching with semialgebraic sets
- Ray shooting on triangles in 3-space
- Ray Shooting and Parametric Search
- Efficient Point Location in a Convex Spatial Cell-Complex
- The Union of Convex Polyhedra in Three Dimensions
- Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
- Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra