A linear algorithm for eliminating hidden-lines from a polygonal cylinder

DOI10.1007/BF01890987zbMath0639.68040MaRDI QIDQ1099952

David Rappaport

Publication date: 1986

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

zbMATH Keywords

geometric algorithmscomputational geometryworst case complexityhidden-line elimination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Related Items (2)

Visibility between two edges of a simple polygon ⋮ Hidden-surface removal in polyhedral cross-sections

Cites Work

• Unnamed Item
• Unnamed Item
• A linear algorithm for finding the convex hull of a simple polygon
• A linear algorithm for computing the visibility polygon from a point
• A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra
• Finding the convex hull of a simple polygon

This page was built for publication: A linear algorithm for eliminating hidden-lines from a polygonal cylinder