An optimal algorithm for reporting visible rectangles

DOI10.1016/S0020-0190(01)00228-9MaRDI QIDQ1847392zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A space-optimal hidden surface removal algorithm for iso-oriented rectangles
• Hidden surface removal for rectangles
• Hidden line elimination for isooriented rectangles
• On rectangular visibility
• Space-optimal hidden line elimination for rectangles

Cites work

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

Cited in

(5)

• Some Results for Elementary Operations
• A space-optimal hidden surface removal algorithm for iso-oriented rectangles
• An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
• On rectangular visibility
• Minimizing visible edges in polyhedra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847392)