An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons (Q1603488): Difference between revisions

@@ Property / cites work @@
+The furthest-site geodesic Voronoi diagram
@@ Property / cites work: The furthest-site geodesic Voronoi diagram / rank @@
+Normal rank
@@ Property / cites work @@
+On rectilinear link distance
@@ Property / cites work: On rectilinear link distance / rank @@
+Normal rank
@@ Property / cites work @@
+Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
+Normal rank
@@ Property / Wikidata QID @@
+Q126377184
@@ Property / Wikidata QID: Q126377184 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(00)00229-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2033980796
@@ Property / OpenAlex ID: W2033980796 / rank @@
+Normal rank