An optimal algorithm to compute the inverse beacon attraction region (Q5115823): Difference between revisions

@@ label / en / label / en @@
+An optimal algorithm to compute the inverse beacon attraction region
@@ Property / DOI @@
-.4230/LIPIcs.SoCG.2018.55
@@ Property / DOI: 10.4230/LIPIcs.SoCG.2018.55 / rank @@
-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 @@
+Routing with guaranteed delivery in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+Q2721968
@@ Property / cites work: Q2721968 / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility and intersection problems in plane geometry
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+An optimal algorithm to compute the inverse beacon attraction region
+Normal rank
@@ Property / cites work @@
+Routing in a polygonal terrain with the shortest beacon watchtower
+Normal rank
@@ Property / cites work @@
+Euclidean shortest paths in the presence of rectilinear barriers
+Normal rank
@@ Property / cites work @@
+Q5077653
@@ Property / cites work: Q5077653 / rank @@
+Normal rank
@@ Property / cites work @@
+A Lower Bound to Finding Convex Hulls
@@ Property / cites work: A Lower Bound to Finding Convex Hulls / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963753111
@@ Property / OpenAlex ID: W2963753111 / rank @@
+Normal rank
@@ Property / title @@
+An optimal algorithm to compute the inverse beacon attraction region (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.SOCG.2018.55
@@ Property / DOI: 10.4230/LIPICS.SOCG.2018.55 / rank @@
+Normal rank