Efficient ray shooting and hidden surface removal

DOI10.1007/BF01377182zbMath0813.68160MaRDI QIDQ1330784

Mark H. Overmars, Jack Scott Snoeyink, Dan Halperin, Marc J. van Kreveld, Mark T. de Berg

Publication date: 10 August 1994

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

visibilityray-shooting problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

On range searching with semialgebraic sets ⋮ Ray shooting on triangles in 3-space ⋮ Vertical decompositions for triangles in 3-space ⋮ Processing an Offline Insertion-Query Sequence with Applications ⋮ Computing depth orders for fat objects and related problems ⋮ Generalized hidden surface removal ⋮ Space reduction and an extension for a hidden line elimination algorithm ⋮ On Ray Shooting for Triangles in 3-Space and Related Problems ⋮ Hidden surface removal for \(c\)-oriented polyhedra ⋮ Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra ⋮ Applications of a new space-partitioning technique ⋮ On ray shooting in convex polytopes ⋮ The power of parallel projection ⋮ Efficient hidden surface removal for objects with small union size ⋮ On the zone of a surface in a hyperplane arrangement ⋮ Ray shooting and stone throwing with near-linear storage ⋮ On vertical ray shooting in arrangements ⋮ An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains ⋮ Clamshell casting ⋮ Iterated snap rounding ⋮ An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction ⋮ THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL ⋮ An improved technique for output-sensitive hidden surface removal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Visibility and intersection problems in plane geometry
• Storing line segments in partition trees
• \(\epsilon\)-nets and simplex range queries
• Counting and cutting cycles of lines and rods in space
• Hidden surface removal for \(c\)-oriented polyhedra
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• New applications of random sampling in computational geometry
• Intersection Queries in Curved Objects
• A linear algorithm for determining the separation of convex polyhedra
• Optimal Search in Planar Subdivisions
• Computing and Verifying Depth Orders
• Space searching for intersecting objects

This page was built for publication: Efficient ray shooting and hidden surface removal