A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
From MaRDI portal
Publication:3776622
DOI10.1016/0167-8655(86)90043-7zbMath0636.68047MaRDI QIDQ3776622
Publication date: 1986
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8655(86)90043-7
triangulation; computer graphics; shortest paths; computational geometry; linear-time algorithm; strong hidden-line problem; weakly visible
68Q25: Analysis of algorithms and problem complexity
52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry
68U99: Computing methodologies and applications
Related Items
Determining Weak Visibility of a Polygon from an Edge in Parallel, Weak visibility queries of line segments in simple polygons and polygonal domains, Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary, Maintaining visibility of a polygon with a moving point of view, Near optimal line segment queries in simple polygons, Characterizing and recognizing the visibility graph of a funnel-shaped polygon, On polyhedra induced by point sets in space