Efficient hidden surface removal for objects with small union size
From MaRDI portal
Recommendations
Cites work
- A simple output-sensitive algorithm for hidden surface removal
- Algorithms for Reporting and Counting Geometric Intersections
- An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal
- Computation of the axial view of a set of isothetic parallelepipeds
- Counting and cutting cycles of lines and rods in space
- Efficient binary space partitions for hidden-surface removal and solid modeling
- Efficient ray shooting and hidden surface removal
- Fat Triangles Determine Linearly Many Holes
- Hidden surface removal for rectangles
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3451445 (Why is no real title available?)
- Merging visibility maps
- New algorithms for special cases of the hidden line elimination problem
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Ray Shooting and Parametric Search
Cited in
(34)- Visible surface calculation for complex unstructured polygonal scenes
- Estimating the efficiency of a uniform-grid two-dimensional hashing algorithm for hidden line and surface removal in computer graphics
- Space reduction and an extension for a hidden line elimination algorithm
- Spheres, molecules, and hidden surface removal
- 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
- On fat partitioning, fat covering and the union size of polygons
- Efficient algorithms for computing a complete visibility region in three-dimensional space
- Models and motion planning
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
- An optimal algorithm for reporting visible rectangles
- Computing depth orders for fat objects and related problems
- Generalized hidden surface removal
- Bounding the locus of the center of mass for a part with shape variation
- Computing the visibility map of fat objects
- Reprint of: Bounding the locus of the center of mass for a part with shape variation
- A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS
- Computing the Visibility Map of Fat Objects
- scientific article; zbMATH DE number 3958767 (Why is no real title available?)
- Determining visible points in a three-dimensional discrete space
- THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
- scientific article; zbMATH DE number 1445393 (Why is no real title available?)
- Models and motion planning
- Computing depth orders and related problems
- Repetitive hidden-surface-removal for polyhedral scenes
- A simplified technique for hidden-line elimination in terrains
- Dynamic data structures for fat objects and their applications
- TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
- REGION INTERVISIBILITY IN TERRAINS
- Exact and approximation algorithms for computing optimal fat decompositions
- Piercing pairwise intersecting convex shapes in the plane
- Merging visibility maps
- On realistic terrains
- Improved bounds on the union complexity of fat objects
This page was built for publication: Efficient hidden surface removal for objects with small union size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208434)
