k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (Q4682198): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Ray shooting in polygons using geodesic triangulations
+Normal rank
@@ Property / cites work @@
+Optimal shortest path queries in a simple polygon
@@ Property / cites work: Optimal shortest path queries in a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Computing minimum length paths of a given homotopy class
+Normal rank
@@ Property / cites work @@
+Euclidean shortest paths in the presence of rectilinear barriers
+Normal rank
@@ Property / cites work @@
+Maintenance of configurations in the plane
@@ Property / cites work: Maintenance of configurations in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Non-Crossing Rectilinear Paths in Plane Regions
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0218195999000315
+Normal rank
@@ Property / OpenAlex ID @@
+W2104671918
@@ Property / OpenAlex ID: W2104671918 / rank @@
+Normal rank