Linear data structures for fast ray-shooting amidst convex polyhedra

DOI10.1007/S00453-008-9220-0MaRDI QIDQ834599zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
• scientific article; zbMATH DE number 176772
• Ray shooting in polygons using geodesic triangulations
• Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• A ray-based algorithm for multi-dimensional linear conversion

Cites work

• scientific article; zbMATH DE number 5506196 (Why is no real title available?)
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Efficient Point Location in a Convex Spatial Cell-Complex
• Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
• On range searching with semialgebraic sets
• Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
• Ray Shooting and Parametric Search
• Ray shooting on triangles in 3-space
• Ray shooting, depth orders and hidden surface removal
• The Union of Convex Polyhedra in Three Dimensions
• Visibility with a moving point of view

Cited in

(12)

• Confluent persistence revisited
• Vertical Ray Shooting and Computing Depth Orders for Fat Objects
• scientific article; zbMATH DE number 1217742 (Why is no real title available?)
• Lines avoiding balls in three dimensions revisited
• Ray Shooting Amidst Convex Polygons in 2D
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Shooting permanent rays among disjoint polygons in the plane
• Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
• Vertical ray shooting for fat objects
• Simplex Range Searching and Its Variants: A Review
• scientific article; zbMATH DE number 437551 (Why is no real title available?)
• Shooting permanent rays among disjoint polygons in the plane

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834599)