Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons (Q2175794): Difference between revisions

@@ Property / cites work @@
+Minimizing the solid angle sum of orthogonal polyhedra
+Normal rank
@@ Property / cites work @@
+Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
+Normal rank
@@ Property / cites work @@
+Tight bounds for beacon-based coverage in simple rectilinear polygons
+Normal rank
@@ 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 @@
+Combinatorics of beacon-based routing in three dimensions
+Normal rank
@@ Property / cites work @@
+Unfolding polycube trees with constant refinement
@@ Property / cites work: Unfolding polycube trees with constant refinement / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5077653
@@ Property / cites work: Q5077653 / rank @@
+Normal rank
@@ Property / cites work @@
+Guarding Thin Orthogonal Polygons Is Hard
@@ Property / cites work: Guarding Thin Orthogonal Polygons Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank
@@ Property / cites work @@
+SEARCHING POLYHEDRA BY ROTATING HALF-PLANES
@@ Property / cites work: SEARCHING POLYHEDRA BY ROTATING HALF-PLANES / rank @@
+Normal rank
@@ Property / cites work @@
+Face-guarding polyhedra
@@ Property / cites work: Face-guarding polyhedra / rank @@
+Normal rank