An improved technique for output-sensitive hidden surface removal

DOI10.1007/BF01293267zbMath0804.68146OpenAlexW2082758805MaRDI QIDQ1322562

Mark H. Overmars, Micha Sharir

Publication date: 5 May 1994

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01293267

zbMATH Keywords

computer graphicsvisibilitycomputational geometryray shootinghidden surface removal

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Hidden surface removal for \(c\)-oriented polyhedra ⋮ Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra ⋮ Applications of a new space-partitioning technique ⋮ Dynamic partition trees ⋮ An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains ⋮ Dynamic partition trees ⋮ Merging visibility maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity and construction of many faces in arrangements of lines and of segments
• Dynamic partition trees
• Visibility and intersection problems in plane geometry
• Partitioning arrangements of lines. I: An efficient deterministic algorithm
• Hidden surface removal for rectangles
• Output-sensitive methods for rectilinear hidden surface removal
• Efficient ray shooting and hidden surface removal
• Computation of the axial view of a set of isothetic parallelepipeds
• New algorithms for special cases of the hidden line elimination problem
• A simple output-sensitive algorithm for hidden surface removal
• Space searching for intersecting objects

This page was built for publication: An improved technique for output-sensitive hidden surface removal