A linear-time algorithm for solving the strong hidden-line problem in a simple polygon

DOI10.1016/0167-8655(86)90043-7zbMath0636.68047OpenAlexW1991157139MaRDI QIDQ3776622

Godfried T. Toussaint

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

zbMATH Keywords

triangulationcomputer graphicsshortest pathscomputational geometrylinear-time algorithmstrong hidden-line problemweakly visible

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computing methodologies and applications (68U99)

Related Items (7)

Maintaining visibility of a polygon with a moving point of view ⋮ Characterizing and recognizing the visibility graph of a funnel-shaped polygon ⋮ Near optimal line segment queries in simple polygons ⋮ On polyhedra induced by point sets in space ⋮ Weak visibility queries of line segments in simple polygons and polygonal domains ⋮ Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary ⋮ Determining Weak Visibility of a Polygon from an Edge in Parallel

This page was built for publication: A linear-time algorithm for solving the strong hidden-line problem in a simple polygon