There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 1918 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 1888 | - |
dc.citation.title | SIAM JOURNAL ON COMPUTING | - |
dc.citation.volume | 39 | - |
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-22T07:36:28Z | - |
dc.date.available | 2023-12-22T07:36:28Z | - |
dc.date.created | 2016-06-10 | - |
dc.date.issued | 2010 | - |
dc.description.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 | - |
dc.identifier.bibliographicCitation | SIAM JOURNAL ON COMPUTING, v.39, no.5, pp.1888 - 1918 | - |
dc.identifier.doi | 10.1137/080742166 | - |
dc.identifier.issn | 0097-5397 | - |
dc.identifier.scopusid | 2-s2.0-77049120567 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/19641 | - |
dc.identifier.url | http://epubs.siam.org/doi/abs/10.1137/080742166 | - |
dc.identifier.wosid | 000277584700008 | - |
dc.language | 영어 | - |
dc.publisher | SIAM PUBLICATIONS | - |
dc.title | QUERYING APPROXIMATE SHORTEST PATHS IN ANISOTROPIC REGIONS | - |
dc.type | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.