Vertical Ray Shooting and Computing Depth Orders for Fat Objects

DOI10.1137/060672261MaRDI QIDQ3614158zbMATH OpenOpenAlexFDO

Authors Chris Gray, Mark de Berg

Publication date 16 March 2009

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/4e9bb785-5361-4e83-b89e-d2a20594a344

zbMATH Keywords

computational geometrydepth ordersfat objectsray shooting

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Linear data structures for fast ray-shooting amidst convex polyhedra
• Vertical ray shooting for fat objects
• Computing depth orders for fat objects and related problems
• Efficient ray shooting and hidden surface removal

Cited in

(8)

• Decompositions and boundary coverings of non-convex fat polyhedra
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Computing depth orders for fat objects and related problems
• Removing depth-order cycles among triangles: an algorithm generating triangular fragments
• Computing the visibility map of fat objects
• Unions of fat convex polytopes have short skeletons
• Computing depth orders and related problems
• Vertical ray shooting for fat objects

This page was built for publication: Vertical Ray Shooting and Computing Depth Orders for Fat Objects

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