On the correctness of a linear-time visibility polygon algorithm<sup>∗</sup> (Q4009735): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207169008803824
+Normal rank
@@ Property / OpenAlex ID @@
+W1968483053
@@ Property / OpenAlex ID: W1968483053 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for computing the visibility polygon from a point
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line'' Problem
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Q4072022
@@ Property / cites work: Q4072022 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangular meshes for regions of complicated shape
+Normal rank
@@ Property / cites work @@
+Corrections to Lee's visibility polygon algorithm
@@ Property / cites work: Corrections to Lee's visibility polygon algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility of a simple polygon
@@ Property / cites work: Visibility of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Polygons into Convex Sets
@@ Property / cites work: Decomposition of Polygons into Convex Sets / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
+Normal rank