A worst-case efficient algorithm for hidden-line elimination†

DOI10.1080/00207168508803482zbMath0655.68047OpenAlexW2026948925MaRDI QIDQ3802610

Thomas Ottmann, Peter Widmayer, Derick Wood

Publication date: 1985

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168508803482

zbMATH Keywords

computer graphicscomputational geometryworst case analysisdisplay algorithmshidden-line-elimination

Mathematics Subject Classification ID

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

Related Items (1)

Hidden-surface removal in polyhedral cross-sections

Cites Work

• Unnamed Item
• On the equivalence of some rectangle problems
• Algorithms for Reporting and Counting Geometric Intersections
• A fast algorithm for the Boolean masking problem
• Comments on “algorithms for reporting and counting geometric intersections”
• A Lower Bound on the Complexity of Orthogonal Range Queries
• Rectilinear line segment intersection, layered segment trees, and dynamization
• Plane-sweep algorithms for intersecting geometric figures
• Binary Search Trees of Bounded Balance

This page was built for publication: A worst-case efficient algorithm for hidden-line elimination^†