A nearly optimal algorithm for covering the interior of an art gallery (Q632590): 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.patcog.2010.11.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2079810056
@@ Property / OpenAlex ID: W2079810056 / rank @@
+Normal rank
@@ Property / cites work @@
+LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
+Normal rank
@@ Property / cites work @@
+A nearly optimal sensor placement algorithm for boundary coverage
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for guard placement in polygons with holes
+Normal rank
@@ Property / cites work @@
+Covering Polygons Is Hard
@@ Property / cites work: Covering Polygons Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Guarding galleries and terrains
@@ Property / cites work: Guarding galleries and terrains / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability results for guarding polygons and terrains
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:632590