Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures (Q5458853): Difference between revisions

@@ Property / cites work @@
+An Optimal Algorithm for Euclidean Shortest Paths in the Plane
+Normal rank
@@ Property / cites work @@
+An Output-Sensitive Algorithm for Computing Visibility Graphs
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
+Normal rank
@@ Property / cites work @@
+Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
+Normal rank
@@ Property / cites work @@
+Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
+Normal rank
@@ Property / cites work @@
+\(L_ 1\) shortest paths among polygonal obstacles in the plane
+Normal rank
@@ Property / cites work @@
+TRIANGULATING DISJOINT JORDAN CHAINS
@@ Property / cites work: TRIANGULATING DISJOINT JORDAN CHAINS / rank @@
+Normal rank
@@ Property / cites work @@
+Rectilinear shortest paths in the presence of rectangular barriers
+Normal rank