Finding the shortest boundary guard of a simple polygon (Q5941506): Difference between revisions

@@ Property / cites work @@
+Ray shooting in polygons using geodesic triangulations
+Normal rank
@@ Property / cites work @@
+Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
+Normal rank
@@ Property / cites work @@
+Q4698690
@@ Property / cites work: Q4698690 / 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 @@
+A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Finding the Kernel of a Polygon
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for detecting weak visibility of a polygon
+Normal rank
@@ Property / cites work @@
+EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(00)00235-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2132466471
@@ Property / OpenAlex ID: W2132466471 / rank @@
+Normal rank