Q5136225 (Q5136225): Difference between revisions

@@ Property / cites work @@
+On Approximate Distance Labels and Routing Schemes with Affine Stretch
+Normal rank
@@ Property / cites work @@
+Visibility of disjoint polygons
@@ Property / cites work: Visibility of disjoint polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Improved routing strategies with succinct tables
@@ Property / cites work: Improved routing strategies with succinct tables / rank @@
+Normal rank
@@ Property / cites work @@
+TRIANGULATING DISJOINT JORDAN CHAINS
@@ Property / cites work: TRIANGULATING DISJOINT JORDAN CHAINS / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
+Normal rank
@@ Property / cites work @@
+Competitive Local Routing with Constraints
@@ Property / cites work: Competitive Local Routing with Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Compact routing schemes with improved stretch
@@ Property / cites work: Compact routing schemes with improved stretch / rank @@
+Normal rank
@@ Property / cites work @@
+Compact Routing with Minimum Stretch
@@ Property / cites work: Compact Routing with Minimum Stretch / rank @@
+Normal rank
@@ Property / cites work @@
+Compact routing schemes with low stretch factor
@@ Property / cites work: Compact routing schemes with low stretch factor / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535803
@@ Property / cites work: Q4535803 / rank @@
+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 for Euclidean Shortest Paths in the Plane
+Normal rank
@@ Property / cites work @@
+Corrections to Lee's visibility polygon algorithm
@@ Property / cites work: Corrections to Lee's visibility polygon algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Routing in unit disk graphs
@@ Property / cites work: Routing in unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
+Normal rank
@@ Property / cites work @@
+Visibility of a simple polygon
@@ Property / cites work: Visibility of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for shortest paths among obstacles in the plane
+Normal rank
@@ Property / cites work @@
+SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
@@ Property / cites work: SHORTEST PATHS AMONG OBSTACLES IN THE PLANE / rank @@
+Normal rank
@@ Property / cites work @@
+A trade-off between space and efficiency for routing tables
+Normal rank
@@ Property / cites work @@
+New Routing Techniques and their Applications
@@ Property / cites work: New Routing Techniques and their Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Close to linear space routing schemes
@@ Property / cites work: Close to linear space routing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Labelling and Implicit Routing in Networks
@@ Property / cites work: Labelling and Implicit Routing in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+On Shortest Paths in Polyhedral Spaces
@@ Property / cites work: On Shortest Paths in Polyhedral Spaces / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths in the plane with polygonal obstacles
+Normal rank
@@ Property / cites work @@
+Compact oracles for reachability and approximate distances in planar digraphs
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles
@@ Property / cites work: Approximate distance oracles / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
+Normal rank
@@ Property / cites work @@
+Compact and low delay routing labeling scheme for unit disk graphs
+Normal rank
@@ Property / cites work @@
+On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems
+Normal rank