dc.citation.conferencePlace |
KO |
- |
dc.citation.conferencePlace |
Gyeongju |
- |
dc.citation.endPage |
91 |
- |
dc.citation.startPage |
84 |
- |
dc.citation.title |
23rd Annual Symposium on Computational Geometry |
- |
dc.contributor.author |
Cheng, Siu-Wing |
- |
dc.contributor.author |
Na, Hyeon-Suk |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.contributor.author |
Wang, Yajun |
- |
dc.date.accessioned |
2023-12-20T05:06:05Z |
- |
dc.date.available |
2023-12-20T05:06:05Z |
- |
dc.date.created |
2016-07-04 |
- |
dc.date.issued |
2007-06-06 |
- |
dc.description.abstract |
We present a data structure for answering approximate shortest path queries ina planar subdivision from a fixed source. Let ρ ≥ 1 be a real number.Distances in each face of this subdivision are measured by a possiblyasymmetric convex distance function whose unit disk is contained in aconcentric unit Euclidean disk, and contains a concentric Euclidean disk withradius 1/ρ. Different convex distance functions may be used for differentfaces, and obstacles are allowed. Let ε be any number strictly between 0and 1. Our data structure returns a (1+ε)approximation of the shortest path cost from the fixed source to a querydestination in O(logρn/ε) time. Afterwards, a(1+ε)-approximate shortest path can be reported in time linear in itscomplexity. The data structure uses O(ρ2 n4/ε2 log ρn/ε) space and can be built in O((ρ2 n4)/(ε2)(log ρn/ε)2) time. Our time and space bounds do not depend onany geometric parameter of the subdivision such as the minimum angle. |
- |
dc.identifier.bibliographicCitation |
23rd Annual Symposium on Computational Geometry, pp.84 - 91 |
- |
dc.identifier.doi |
10.1145/1247069.1247082 |
- |
dc.identifier.scopusid |
2-s2.0-35348884208 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/34481 |
- |
dc.identifier.url |
http://dl.acm.org/citation.cfm?id=1247082&CFID=639749174&CFTOKEN=76434841 |
- |
dc.language |
영어 |
- |
dc.publisher |
23rd Annual Symposium on Computational Geometry |
- |
dc.title |
Querying approximate shortest paths in anisotropic regions |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2007-06-06 |
- |