Hidden-surface removal in polyhedral cross-sections

DOI10.1007/BF01901191MaRDI QIDQ1104083zbMATH OpenFDO

Authors Peter Egyed

Publication date 1988

Published in The Visual Computer (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01901191

zbMATH Keywords

computational geometrydecomposition techniquesdynamization techniqueshidden-surface problempolyhedral cross-sectionspriority orderingsscenevisibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Repetitive Hidden Surface Removal for Polyhedra
• A simple output-sensitive algorithm for hidden surface removal
• Repetitive hidden-surface-removal for polyhedral scenes
• Hidden surface removal for \(c\)-oriented polyhedra
• Visible surface calculation for complex unstructured polygonal scenes

Cites work

• A linear algorithm for eliminating hidden-lines from a polygonal cylinder
• A worst-case efficient algorithm for hidden-line elimination^†
• Finding the intersection of two convex polyhedra
• scientific article; zbMATH DE number 3825165 (Why is no real title available?)
• scientific article; zbMATH DE number 3780618 (Why is no real title available?)
• Triangulating a simple polygon

Cited in

(17)

• Visible surface calculation for complex unstructured polygonal scenes
• Dynamic output-sensitive hidden surface removal for c-oriented polyhedra
• Ray shooting, depth orders and hidden surface removal
• Hierarchical s-buffer method
• Generalized hidden surface removal
• On circularly-hidden surface removal.
• The computation of visible-surface representations
• Visibility-ordering meshed polyhedra
• scientific article; zbMATH DE number 645771 (Why is no real title available?)
• scientific article; zbMATH DE number 1182935 (Why is no real title available?)
• scientific article; zbMATH DE number 1911009 (Why is no real title available?)
• scientific article; zbMATH DE number 1445393 (Why is no real title available?)
• Translating polygons with applications to hidden surface removal
• Algorithms – ESA 2005
• Employment of portals for creating aggregate scenes
• A systolic algorithm for hidden surface removal
• Hidden surface removal for rectangles

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)