Hidden-surface removal in polyhedral cross-sections
From MaRDI portal
Publication:1104083
DOI10.1007/BF01901191zbMATH Open0646.68054MaRDI QIDQ1104083FDOQ1104083
Authors: Peter Egyed
Publication date: 1988
Published in: The Visual Computer (Search for Journal in Brave)
Recommendations
computational geometryvisibilitydecomposition techniquesscenedynamization techniqueshidden-surface problempolyhedral cross-sectionspriority orderings
Cites Work
Cited In (15)
- Hidden surface removal for rectangles
- Hierarchical \(s\)-buffer method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ray shooting, depth orders and hidden surface removal
- Translating polygons with applications to hidden surface removal
- Visibility-ordering meshed polyhedra
- Generalized hidden surface removal
- Algorithms – ESA 2005
- On circularly-hidden surface removal.
- A systolic algorithm for hidden surface removal
- Visible surface calculation for complex unstructured polygonal scenes
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra
- The computation of visible-surface representations
- Employment of portals for creating aggregate scenes
This page was built for publication: Hidden-surface removal in polyhedral cross-sections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104083)