Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
From MaRDI portal
Publication:4875447
DOI10.1137/S0097539793244368zbMath0843.68116OpenAlexW2089715871MaRDI QIDQ4875447
Micha Sharir, Pankaj K. Agarwal
Publication date: 5 June 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793244368
Analysis of algorithms and problem complexity (68Q25) (n)-dimensional polytopes (52B11) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items (11)
Visibility and its dynamics in a PDE based implicit framework ⋮ Linear data structures for fast ray-shooting amidst convex polyhedra ⋮ Multiview visibility estimation for image-based modeling ⋮ On Ray Shooting for Triangles in 3-Space and Related Problems ⋮ Properties of a level set algorithm for the visibility problems ⋮ Simplex Range Searching and Its Variants: A Review ⋮ Information-seeking control under visibility-based uncertainty ⋮ Ray shooting and stone throwing with near-linear storage ⋮ A partial differential equation obstacle problem for the level set approach to visibility ⋮ A SUCCINCT 3D VISIBILITY SKELETON ⋮ An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
This page was built for publication: Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
