Efficient hidden surface removal for objects with small union size
From MaRDI portal
Publication:1208434
DOI10.1016/0925-7721(92)90024-MzbMath0774.68099MaRDI QIDQ1208434
Micha Sharir, Mark H. Overmars, Matthew J. Katz
Publication date: 16 May 1993
Published in: Computational Geometry (Search for Journal in Brave)
Related Items (23)
Models and motion planning ⋮ Computing depth orders and related problems ⋮ Range searching in low-density environments ⋮ 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 ⋮ Generalized hidden surface removal ⋮ Exact and approximation algorithms for computing optimal fat decompositions ⋮ Space reduction and an extension for a hidden line elimination algorithm ⋮ On fat partitioning, fat covering and the union size of polygons ⋮ Piercing pairwise intersecting convex shapes in the plane ⋮ REGION INTERVISIBILITY IN TERRAINS ⋮ On realistic terrains ⋮ Improved bounds on the union complexity of fat objects ⋮ Bounding the locus of the center of mass for a part with shape variation ⋮ Computing the visibility map of fat objects ⋮ Models and motion planning ⋮ An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains ⋮ Spheres, molecules, and hidden surface removal ⋮ Dynamic data structures for fat objects and their applications ⋮ An optimal algorithm for reporting visible rectangles ⋮ Reprint of: Bounding the locus of the center of mass for a part with shape variation ⋮ TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS ⋮ THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Merging visibility maps
- Efficient binary space partitions for hidden-surface removal and solid modeling
- Hidden surface removal for rectangles
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Counting and cutting cycles of lines and rods in space
- Efficient ray shooting and hidden surface removal
- Algorithms for Reporting and Counting Geometric Intersections
- Ray Shooting and Parametric Search
- Computation of the axial view of a set of isothetic parallelepipeds
- New algorithms for special cases of the hidden line elimination problem
- A simple output-sensitive algorithm for hidden surface removal
- Fat Triangles Determine Linearly Many Holes
This page was built for publication: Efficient hidden surface removal for objects with small union size
