CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102): Difference between revisions

@@ Property / cites work @@
+Searching for a Mobile Intruder in a Polygonal Region
+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 THE TWO-GUARD PROBLEM
@@ Property / cites work: AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Guard Walkability of Simple Polygons
@@ Property / cites work: Two-Guard Walkability of Simple Polygons / rank @@
+Normal rank
@@ Property / cites work @@
+SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
+Normal rank
@@ Property / cites work @@
+SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
@@ Property / cites work: SEARCHING A POLYGONAL REGION FROM THE BOUNDARY / rank @@
+Normal rank
@@ Property / cites work @@
+Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
+Normal rank
@@ Property / cites work @@
+Searching for mobile intruders in a polygonal region by a group of mobile searchers
+Normal rank
@@ Property / cites work @@
+AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
+Normal rank
@@ Property / cites work @@
+A linear algorithm for computing the visibility polygon from a point
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank