Efficient ray shooting and hidden surface removal

DOI10.1007/BF01377182MaRDI QIDQ1330784zbMATH OpenFDO

Authors Mark H. Overmars, Mark de Berg, Dan Halperin, Jack Snoeyink, Marc Van Kreveld

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)

Recommendations

• Ray shooting, depth orders and hidden surface removal
• scientific article; zbMATH DE number 437551
• Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
• Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra

Cites work

• scientific article; zbMATH DE number 432800 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 176772 (Why is no real title available?)
• scientific article; zbMATH DE number 177534 (Why is no real title available?)
• scientific article; zbMATH DE number 177535 (Why is no real title available?)
• scientific article; zbMATH DE number 177563 (Why is no real title available?)
• A linear algorithm for determining the separation of convex polyhedra
• Computing and Verifying Depth Orders
• Counting and cutting cycles of lines and rods in space
• Hidden surface removal for \(c\)-oriented polyhedra
• Intersection Queries in Curved Objects
• New applications of random sampling in computational geometry
• Optimal Search in Planar Subdivisions
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• Space searching for intersecting objects
• Storing line segments in partition trees
• Visibility and intersection problems in plane geometry
• -nets and simplex range queries

Cited in

(29)

• An improved technique for output-sensitive hidden surface removal
• Iterated snap rounding
• The power of parallel projection
• Vertical Ray Shooting and Computing Depth Orders for Fat Objects
• Space reduction and an extension for a hidden line elimination algorithm
• On ray shooting in convex polytopes
• Ray shooting and stone throwing with near-linear storage
• On the zone of a surface in a hyperplane arrangement
• Computability and complexity of ray tracing
• scientific article; zbMATH DE number 2079725 (Why is no real title available?)
• On vertical ray shooting in arrangements
• Vertical decompositions for triangles in 3-space
• Computing depth orders for fat objects and related problems
• Applications of a new space-partitioning technique
• On ray shooting for triangles in 3-space and related problems
• Ray shooting, depth orders and hidden surface removal
• On range searching with semialgebraic sets
• An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
• An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
• Generalized hidden surface removal
• THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
• Efficient hidden surface removal for objects with small union size
• scientific article; zbMATH DE number 2112338 (Why is no real title available?)
• Clamshell casting
• Ray shooting on triangles in 3-space
• Processing an Offline Insertion-Query Sequence with Applications
• The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing
• Hidden surface removal for \(c\)-oriented polyhedra
• Dynamic output-sensitive hidden surface removal for c-oriented polyhedra

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

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