On the correctness of a linear-time visibility polygon algorithm∗
From MaRDI portal
Publication:4009735
DOI10.1080/00207169008803824zbMath0825.68638MaRDI QIDQ4009735
Publication date: 27 September 1992
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169008803824
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Computing the visibility polygon of an island in a polygonal domain, Visibility and ray shooting queries in polygonal domains, Parametric search: three new applications, A linear time algorithm to remove winding of a simple polygon
Cites Work
- Unnamed Item
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Corrections to Lee's visibility polygon algorithm
- Visibility of a simple polygon
- Triangular meshes for regions of complicated shape
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- A linear algorithm for computing the visibility polygon from a point
- Decomposition of Polygons into Convex Sets
- An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line Problem