Hidden-surface removal in polyhedral cross-sections

DOI10.1007/BF01901191zbMath0646.68054MaRDI QIDQ1104083

Peter Egyed

Publication date: 1988

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

zbMATH Keywords

visibilitycomputational geometrydecomposition techniquesscenedynamization techniqueshidden-surface problempolyhedral cross-sectionspriority orderings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Translating polygons with applications to hidden surface removal

Cites Work

• A linear algorithm for eliminating hidden-lines from a polygonal cylinder
• Triangulating a simple polygon
• Finding the intersection of two convex polyhedra
• A worst-case efficient algorithm for hidden-line elimination^†
• Unnamed Item
• Unnamed Item