Tight bounds for beacon-based coverage in simple rectilinear polygons (Q2330037): Difference between revisions

@@ Property / cites work @@
+Beacon-Based Algorithms for Geometric Routing
@@ Property / cites work: Beacon-Based Algorithms for Geometric Routing / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial theorem in plane geometry
@@ Property / cites work: A combinatorial theorem in plane geometry / rank @@
+Normal rank
@@ Property / cites work @@
+An alternative proof of the rectilinear art gallery theorem
+Normal rank
@@ Property / cites work @@
+Generalized guarding and partitioning for rectilinear polygons
+Normal rank
@@ Property / cites work @@
+Traditional Galleries Require Fewer Watchmen
@@ Property / cites work: Traditional Galleries Require Fewer Watchmen / rank @@
+Normal rank
@@ Property / cites work @@
+A Short Proof of the Rectilinear Art Gallery Theorem
+Normal rank
@@ Property / cites work @@
+Art gallery theorems for guarded guards.
@@ Property / cites work: Art gallery theorems for guarded guards. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5077653
@@ Property / cites work: Q5077653 / rank @@
+Normal rank