Handle URI:
http://hdl.handle.net/10754/597601
Title:
Approximate Shortest Homotopic Paths in Weighted Regions
Authors:
Cheng, Siu-Wing; Jin, Jiongxin; Vigneron, Antoine; Wang, Yajun
Abstract:
Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈(0,1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1 + ε of the optimum. The running time is O(h 3/ε2 kn polylog(k, n, 1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2010 Springer-Verlag.
Citation:
Cheng S-W, Jin J, Vigneron A, Wang Y (2010) Approximate Shortest Homotopic Paths in Weighted Regions. Lecture Notes in Computer Science: 109–120. Available: http://dx.doi.org/10.1007/978-3-642-17514-5_10.
Publisher:
Springer Science + Business Media
Journal:
Lecture Notes in Computer Science
Issue Date:
2010
DOI:
10.1007/978-3-642-17514-5_10
Type:
Book Chapter
ISSN:
0302-9743; 1611-3349
Sponsors:
Department of Computer Science and Engineering, HKUST, Hong Kong
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorCheng, Siu-Wingen
dc.contributor.authorJin, Jiongxinen
dc.contributor.authorVigneron, Antoineen
dc.contributor.authorWang, Yajunen
dc.date.accessioned2016-02-25T12:42:51Zen
dc.date.available2016-02-25T12:42:51Zen
dc.date.issued2010en
dc.identifier.citationCheng S-W, Jin J, Vigneron A, Wang Y (2010) Approximate Shortest Homotopic Paths in Weighted Regions. Lecture Notes in Computer Science: 109–120. Available: http://dx.doi.org/10.1007/978-3-642-17514-5_10.en
dc.identifier.issn0302-9743en
dc.identifier.issn1611-3349en
dc.identifier.doi10.1007/978-3-642-17514-5_10en
dc.identifier.urihttp://hdl.handle.net/10754/597601en
dc.description.abstractLet P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈(0,1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1 + ε of the optimum. The running time is O(h 3/ε2 kn polylog(k, n, 1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2010 Springer-Verlag.en
dc.description.sponsorshipDepartment of Computer Science and Engineering, HKUST, Hong Kongen
dc.publisherSpringer Science + Business Mediaen
dc.titleApproximate Shortest Homotopic Paths in Weighted Regionsen
dc.typeBook Chapteren
dc.identifier.journalLecture Notes in Computer Scienceen
dc.contributor.institutionHong Kong University of Science and Technology, Hong Kong, Chinaen
dc.contributor.institutionINRA Institut National de La Recherche Agronomique, Paris, Franceen
dc.contributor.institutionMicrosoft Research Asia, Beijing, Chinaen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.