Shortest Path Queries in Polygonal Domains (Q3511429): Difference between revisions

@@ Property / Wikidata QID @@
+Q62037467
@@ Property / Wikidata QID: Q62037467 / rank @@
+Normal rank
@@ 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-68880-8_20
+Normal rank
@@ Property / OpenAlex ID @@
+W1504893535
@@ Property / OpenAlex ID: W1504893535 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Euclidean Shortest Paths in the Plane
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
+Normal rank
@@ Property / cites work @@
+On geometric path query problems
@@ Property / cites work: On geometric path query problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252291
@@ Property / cites work: Q4252291 / rank @@
+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 @@
+Q5490398
@@ Property / cites work: Q5490398 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Search in Planar Subdivisions
@@ Property / cites work: Optimal Search in Planar Subdivisions / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3511429