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 e be any number strictly between 0and 1. Our data structure returns a (1+e)approximation of the shortest path cost from the fixed source to a querydestination in O(logρn/e) time. Afterwards, a(1+e)-approximate shortest path can be reported in time linear in itscomplexity. The data structure uses O(ρ2 n4/e2 log ρn/e) space and can be built in O((ρ2 n4)/(e2)(log ρn/e)2) time. Our time and space bounds do not depend onany geometric parameter of the subdivision such as the minimum angle.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
