Optimum sweeps of simple polygons with two guards (Q2445401): 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.1016/j.ipl.2013.11.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1559096963
@@ Property / OpenAlex ID: W1559096963 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779120
@@ Property / cites work: Q4779120 / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility and intersection problems in plane geometry
+Normal rank
@@ Property / cites work @@
+Q4952719
@@ Property / cites work: Q4952719 / 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 @@
+THE TWO GUARDS PROBLEM
@@ Property / cites work: THE TWO GUARDS PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+CLEARING A POLYGON WITH TWO 1-SEARCHERS
@@ Property / cites work: CLEARING A POLYGON WITH TWO 1-SEARCHERS / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for a Mobile Intruder in a Polygonal Region
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Sweeping simple polygons with the minimum number of chain guards
+Normal rank