Finding all weakly-visible chords of a polygon in linear time (Q5056171): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-58218-5_11
+Normal rank
@@ Property / OpenAlex ID @@
+W1546414949
@@ Property / OpenAlex ID: W1546414949 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
+Normal rank
@@ Property / cites work @@
+LR-visibility in polygons
@@ Property / cites work: LR-visibility in polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+THE TWO GUARDS PROBLEM
@@ Property / cites work: THE TWO GUARDS PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Finding the Kernel of a Polygon
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for detecting weak visibility of a polygon
+Normal rank
@@ Property / cites work @@
+Two-Guard Walkability of Simple Polygons
@@ Property / cites work: Two-Guard Walkability of Simple Polygons / rank @@
+Normal rank