NDLI: Approximate Shortest Paths in Anisotropic Regions

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Na, Hyeon-Suk Vigneron, Antoine Wang, Yajun Cheng, Siu-Wing
Copyright Year	2008
Abstract	Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let $\rho\geq 1$ be a real number. Distances in each face of this subdivision are measured by a 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. These convex distance functions may be asymmetric. For any $\varepsilon\in(0,1)$ and for any two points $v_s$ and $v_d$, we give an algorithm that finds a path from $v_s$ to $v_d$ whose cost is at most $(1+\varepsilon)$ times the optimal. Our algorithm runs in $O(\frac{\rho^2\log \rho}{\varepsilon^2}n^3 \log(\frac{\rho n}\varepsilon))$ time. This bound does not depend on any other parameters; in particular it does not depend on the minimum angle in the subdivision. We give applications to two special cases that have been considered before: the weighted region problem and motion planning in the presence of uniform flows. For the weighted region problem with weights in $[1,\rho]\cup \{\infty\}$, the time bound of our algorithm improves to $O(\frac{\rho\log \rho}{\varepsilon}n^3 \log(\frac{\rho n}\varepsilon))$.
Starting Page	802
Ending Page	824
Page Count	23
File Format	PDF
ISSN	00975397
DOI	10.1137/06067777X
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	3
Volume Number	38
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2008-05-28
Access Restriction	Subscribed
Subject Keyword	convex distance function weighted region Computer graphics; computational geometry computational geometry approximation algorithm Approximation algorithms shortest path
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Querying Approximate Shortest Paths in Anisotropic Regions

Approximate Shortest Descending Paths

Abstract approximate shortest paths in anisotropic regions.

Approximate shortest paths in moderately anisotropic regions (2005)

Constructing Approximate Shortest Path Maps in Three Dimensions

Querying approximate shortest paths in anisotropic regions

Approximating shortest paths in anisotropic regions (2007)

Querying approximate shortest paths in anisotropic regions (2006).

Computing Shortest Paths amid Convex Pseudodisks

Approximate Shortest Paths in Anisotropic Regions

Similar Documents

Querying Approximate Shortest Paths in Anisotropic Regions

Approximate Shortest Descending Paths

Abstract approximate shortest paths in anisotropic regions.

Approximate shortest paths in moderately anisotropic regions (2005)

Constructing Approximate Shortest Path Maps in Three Dimensions

Querying approximate shortest paths in anisotropic regions

Approximating shortest paths in anisotropic regions (2007)

Querying approximate shortest paths in anisotropic regions (2006).

Computing Shortest Paths amid Convex Pseudodisks

Approximate Shortest Paths in Anisotropic Regions