An optimal algorithm for reporting visible rectangles

DOI10.1016/S0020-0190(01)00228-9zbMath1051.68133OpenAlexW2004595913MaRDI QIDQ1847392

Nectarios Kitsios

Publication date: 24 June 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00228-9

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Minimizing visible edges in polyhedra ⋮ Some Results for Elementary Operations

Cites Work

• Space-optimal hidden line elimination for rectangles
• Dynamic partition trees
• Hidden line elimination for isooriented rectangles
• Hidden surface removal for rectangles
• A linear-time algorithm for a special case of disjoint set union
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Efficient hidden surface removal for objects with small union size
• Output-sensitive methods for rectilinear hidden surface removal
• New algorithms for special cases of the hidden line elimination problem
• A simple output-sensitive algorithm for hidden surface removal
• Fat Triangles Determine Linearly Many Holes
• THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL

This page was built for publication: An optimal algorithm for reporting visible rectangles