Hidden line elimination for isooriented rectangles

DOI10.1016/0020-0190(90)90062-3zbMath0697.68045OpenAlexW1979288610MaRDI QIDQ911768

Stefan Näher, Kurt Mehlhorn, Christian Uhrig

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90062-3

zbMATH Keywords

computer graphicsdata structurescomputational geometryrandom access machinehidden line eliminationskyline problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Convex sets in (3) dimensions (including convex surfaces) (52A15)

Related Items (4)

Sweep methods for parallel computational geometry ⋮ Space-optimal hidden line elimination for rectangles ⋮ An optimal algorithm for reporting visible rectangles ⋮ A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles

Cites Work

• Unnamed Item
• Dynamic fractional cascading
• New algorithms for special cases of the hidden line elimination problem

This page was built for publication: Hidden line elimination for isooriented rectangles