Ray shooting, depth orders and hidden surface removal
From MaRDI portal
Publication:1309673
DOI10.1007/BFb0029813zbMath0787.68098OpenAlexW1570805656MaRDI QIDQ1309673
Publication date: 6 December 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0029813
polyhedroncomputer graphicscomputational geometryray shootingvisibility mapshidden surface removaldepth orders
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Linear data structures for fast ray-shooting amidst convex polyhedra ⋮ Computing depth orders and related problems ⋮ Vertical decompositions for triangles in 3-space ⋮ New results on binary space partitions in the plane ⋮ Computing depth orders for fat objects and related problems ⋮ Generalized hidden surface removal ⋮ On-line construction of the upper envelope of triangles and surface patches in three dimensions ⋮ On Ray Shooting for Triangles in 3-Space and Related Problems ⋮ Watchman tours for polygons with holes ⋮ Eliminating depth cycles among triangles in three dimensions ⋮ CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER ⋮ Spanning trees crossing few barriers ⋮ Removing depth-order cycles among triangles: an algorithm generating triangular fragments ⋮ Ray shooting and intersection searching amidst fat convex polyhedra in 3-space ⋮ Computing the visibility map of fat objects ⋮ Ray shooting and stone throwing with near-linear storage ⋮ Spheres, molecules, and hidden surface removal ⋮ Decompositions and boundary coverings of non-convex fat polyhedra
