Searching for "Shortest Path Queries in Polygonal Domains." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Approximate distance oracles for geometric spanners
by Joachim Gudmundsson, Christos Levcopoulos — 2002 — Submitted
… that approximate shortest path queries between vertices in a planar polygonal domain with “rounded” obstacles can…
Cited by 3 (2 self) – Add To MetaCart

Two-Point Euclidean Shortest Path Queries in the Plane (Extended Abstract)
by Yi-Chen Chiang, J.S.B. Mitchell — 1999
… of combinatorially distinct shortest path maps in a polygonal domain. Related Work. There has been an abundance…
Cited by 13 (2 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB