Approximate shortest homotopic paths in weighted regions

Handle URI:
http://hdl.handle.net/10754/564524
Title:
Approximate shortest homotopic paths in weighted regions
Authors:
Cheng, Siuwing; Jin, Jiongxin; Vigneron, Antoine E. ( 0000-0003-3586-3431 ) ; Wang, Yajun
Abstract:
A path P between two points s and t in a polygonal subdivision T with obstacles and weighted regions defines a class of paths that can be deformed to P without passing over any obstacle. We present the first algorithm that, given P and a relative error tolerance ε (0, 1), computes a path from this class with cost at most 1 + ε times the optimum. The running time is O(h 3/ε 2kn 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. © 2012 World Scientific Publishing Company.
KAUST Department:
Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program; Geometric Algorithms Group
Publisher:
World Scientific Pub Co Pte Lt
Journal:
International Journal of Computational Geometry & Applications
Issue Date:
Feb-2012
DOI:
10.1142/S0218195912600059
Type:
Article
ISSN:
02181959
Appears in Collections:
Articles; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorCheng, Siuwingen
dc.contributor.authorJin, Jiongxinen
dc.contributor.authorVigneron, Antoine E.en
dc.contributor.authorWang, Yajunen
dc.date.accessioned2015-08-04T07:03:12Zen
dc.date.available2015-08-04T07:03:12Zen
dc.date.issued2012-02en
dc.identifier.issn02181959en
dc.identifier.doi10.1142/S0218195912600059en
dc.identifier.urihttp://hdl.handle.net/10754/564524en
dc.description.abstractA path P between two points s and t in a polygonal subdivision T with obstacles and weighted regions defines a class of paths that can be deformed to P without passing over any obstacle. We present the first algorithm that, given P and a relative error tolerance ε (0, 1), computes a path from this class with cost at most 1 + ε times the optimum. The running time is O(h 3/ε 2kn 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. © 2012 World Scientific Publishing Company.en
dc.publisherWorld Scientific Pub Co Pte Lten
dc.subjecthomotopic pathen
dc.subjectShortest pathen
dc.subjectweighted regionen
dc.titleApproximate shortest homotopic paths in weighted regionsen
dc.typeArticleen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.contributor.departmentGeometric Algorithms Groupen
dc.identifier.journalInternational Journal of Computational Geometry & Applicationsen
dc.contributor.institutionDepartment of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong, Hong Kongen
dc.contributor.institutionMicrosoft Research Asia, Beijing, Chinaen
kaust.authorVigneron, Antoine E.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.