Sciweavers

Share
COMPGEOM
2007
ACM

Querying approximate shortest paths in anisotropic regions

8 years 8 months ago
Querying approximate shortest paths in anisotropic regions
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this subdivision are measured by a possibly asymmetric convex distance function whose unit disk is contained in a concentric unit Euclidean disk and contains a concentric Euclidean disk with radius 1/. Different convex distance functions may be used for different faces, and obstacles are allowed.
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya
Added 14 Aug 2010
Updated 14 Aug 2010
Type Conference
Year 2007
Where COMPGEOM
Authors Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang
Comments (0)
books