New algorithms for special cases of the hidden line elimination problem
From MaRDI portal
Publication:3805970
DOI10.1016/S0734-189X(87)80114-7zbMath0657.68117MaRDI QIDQ3805970
Thomas Ottmann, Ralf Hartmut Gueting
Publication date: 1987
Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)
Related Items (16)
Computing minimum length paths of a given homotopy class ⋮ Generalized hidden surface removal ⋮ Hidden line elimination for isooriented rectangles ⋮ Hidden surface removal for rectangles ⋮ Minimum-link paths revisited ⋮ Space-optimal hidden line elimination for rectangles ⋮ Hidden surface removal for \(c\)-oriented polyhedra ⋮ Output-sensitive generation of the perspective view of isothetic parallelepipeds ⋮ Efficient hidden surface removal for objects with small union size ⋮ Computing the visibility map of fat objects ⋮ Output-sensitive generation of the perspective view of isothetic parallelepipeds ⋮ The intersection searching problem for c-oriented polygons ⋮ An optimal algorithm for reporting visible rectangles ⋮ A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles ⋮ Merging visibility maps ⋮ An improved technique for output-sensitive hidden surface removal
This page was built for publication: New algorithms for special cases of the hidden line elimination problem
