Linear data structures for fast ray-shooting amidst convex polyhedra

DOI10.1007/s00453-008-9220-0zbMath1189.68154OpenAlexW2100823012MaRDI QIDQ834599

Haim Kaplan, Natan Rubin, Micha Sharir

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

zbMATH Keywords

computational geometryconvex polyhedralines in spaceray-shooting

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Machine vision and scene understanding (68T45)

Related Items (3)

Simplex Range Searching and Its Variants: A Review ⋮ Lines avoiding balls in three dimensions revisited ⋮ Unnamed Item

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

This page was built for publication: Linear data structures for fast ray-shooting amidst convex polyhedra