Visible surface calculation for complex unstructured polygonal scenes
The visible surface problem is to determine those subpolygons of a 3-D scene of arbitrary simple planar polygons which are visible from a given viewpoint. The algorithm which is presented here, and which is designed for complex scenes solves this problem by an implicit partitioning w.r.t. a raster of cells. The estimation of complexity leads to propositions on the favorable choice of the grid, and to the characterization of classes of scenes which are relevant for practical applications, and for which the algorithm shows a linear time and space behavior.
- Hidden-surface removal in polyhedral cross-sections
- scientific article; zbMATH DE number 1445393
- Efficient hidden surface removal for objects with small union size
- Repetitive hidden-surface-removal for polyhedral scenes
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
- Reconstructing visible regions from visible segments
- Hidden-surface removal in polyhedral cross-sections
- Carving: a novel method of visibility preprocessing for un-restricted three-dimensional environments
- Hierarchical s-buffer method
- A visibility-based surface reconstruction method on the GPU
- Image mosaicking for polyhedral scene and in particular singly visible surfaces
- Dynamic polygon visibility ordering for head-slaved viewing in virtual environments
- scientific article; zbMATH DE number 3866617 (Why is no real title available?)
- Fast selecting visible surfaces in high precision
- Finding lighted surface parts of polygonal surface in parallel light flux
- Computation of view factors for surfaces of complex shape including screening effects and using a boundary element approximation
- The computation of visible-surface representations
- Real-time interactive visibility computation for quadratic surfaces
- Determining visible points in a three-dimensional discrete space
- scientific article; zbMATH DE number 1911009 (Why is no real title available?)
- Employment of portals for creating aggregate scenes
This page was built for publication: Visible surface calculation for complex unstructured polygonal scenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059281)