Efficient ray shooting and hidden surface removal

DOI10.1007/BF01377182zbMATH Open0813.68160MaRDI QIDQ1330784FDOQ1330784

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)

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

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)

Cites Work

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

Cited In (29)

• Iterated snap rounding
• An improved technique for output-sensitive hidden surface removal
• Vertical Ray Shooting and Computing Depth Orders for Fat Objects
• The power of parallel projection
• 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
• Title not available (Why is that?)
• Computability and complexity of ray tracing
• On vertical ray shooting in arrangements
• Vertical decompositions for triangles in 3-space
• Computing depth orders for fat objects and related problems
• On ray shooting for triangles in 3-space and related problems
• Applications of a new space-partitioning technique
• Ray shooting, depth orders and hidden surface removal
• On range searching with semialgebraic sets
• An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
• An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
• Generalized hidden surface removal
• THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
• Title not available (Why is that?)
• Efficient hidden surface removal for objects with small union size
• 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)