Visiting a Polygon on the Optimal Way to a Query Point (Q3507339): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-69311-6_26
+Normal rank
@@ Property / OpenAlex ID @@
+W1569963336
@@ Property / OpenAlex ID: W1569963336 / rank @@
+Normal rank
@@ Property / cites work @@
+Touring a sequence of polygons
@@ Property / cites work: Touring a sequence of polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768270
@@ Property / cites work: Q2768270 / rank @@
+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 @@
+An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
+Normal rank
@@ Property / cites work @@
+Shortest paths in simple polygons with polygon-meet constraints
+Normal rank
@@ Property / cites work @@
+Visibility of a simple polygon
@@ Property / cites work: Visibility of a simple polygon / rank @@
+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