Show simple item record

dc.contributor.authorCheng, Siuwing
dc.contributor.authorJin, Jiongxin
dc.contributor.authorVigneron, Antoine E.
dc.contributor.authorWang, Yajun
dc.date.accessioned2015-08-04T07:03:12Z
dc.date.available2015-08-04T07:03:12Z
dc.date.issued2012-09-12
dc.identifier.citationCHENG, S.-W., JIN, J., VIGNERON, A., & WANG, Y. (2012). APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS. International Journal of Computational Geometry & Applications, 22(01), 83–102. doi:10.1142/s0218195912600059
dc.identifier.issn02181959
dc.identifier.doi10.1142/S0218195912600059
dc.identifier.urihttp://hdl.handle.net/10754/564524
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.
dc.publisherWorld Scientific Pub Co Pte Lt
dc.subjecthomotopic path
dc.subjectShortest path
dc.subjectweighted region
dc.titleApproximate shortest homotopic paths in weighted regions
dc.typeArticle
dc.contributor.departmentVisual Computing Center (VCC)
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentComputer Science Program
dc.contributor.departmentGeometric Algorithms Group
dc.identifier.journalInternational Journal of Computational Geometry & Applications
dc.contributor.institutionDepartment of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong, Hong Kong
dc.contributor.institutionMicrosoft Research Asia, Beijing, China
kaust.personVigneron, Antoine E.
dc.date.published-online2012-09-12
dc.date.published-print2012-02


This item appears in the following Collection(s)

Show simple item record