File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

VigneronAntoine

Vigneron, Antoine
Geometric Algorithms Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

QUERYING APPROXIMATE SHORTEST PATHS IN ANISOTROPIC REGIONS

Author(s)
Cheng, Siu-WingNa, Hyeon-SukVigneron, AntoineWang, Yajun
Issued Date
2010
DOI
10.1137/080742166
URI
https://scholarworks.unist.ac.kr/handle/201301/19641
Fulltext
http://epubs.siam.org/doi/abs/10.1137/080742166
Citation
SIAM JOURNAL ON COMPUTING, v.39, no.5, pp.1888 - 1918
Abstract
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let rho >= 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/rho. Different convex distance functions may be used for different faces, and obstacles are allowed. Let e be any number strictly between 0 and 1. Our data structure returns a (1 + epsilon) approximation of the shortest path cost from the fixed source to a query destination in O(log rho n/epsilon) time. Afterwards, a (1 + epsilon)- approximate shortest path can be reported in O(log n) time plus the complexity of the path. The data structure uses O(rho(2)n(3)/epsilon(2) log rho n/epsilon) space and can be built in O(rho(2)n(3)/epsilon(2) (log rho n/epsilon)(2)) time. Our time and space bounds do not depend on any other parameter; in particular, they do not depend on any geometric parameter of the subdivision such as the minimum angle
Publisher
SIAM PUBLICATIONS
ISSN
0097-5397

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.