A robust and fast algorithm for computing exact and approximate shortest visiting routes
2004 (English)In: Computational Science and Its Applications - ICCSA 2004 International Conference, Proceedings, Encyclopedia of Global Archaeology/Springer Verlag, 2004, Vol. Part III, 168-177 p.Conference paper (Refereed)
Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is the shortest route (closed path) contained in the polygon that passes through a given point on the boundary and intersects at least one vertex in each of the colored subchains? We present an optimal algorithm that solves this problem in O(n) time. Previously it was known how to solve the problem optimally when each colored subchain contains one vertex only. Moreover, we show that a solution computed by the algorithm is at most a factor times longer than the overall shortest route that intersects the subchains (not just at vertices) if the minimal distance between vertices of different subchains is at least c times the maximal length of an edge of a subchain. Without such a bound its length can be arbitrarily longer. Furthermore, it is known that algorithms for computing such overall shortest routes suffer from numerical problems. Our algorithm is not subject to such problems.
Place, publisher, year, edition, pages
Encyclopedia of Global Archaeology/Springer Verlag, 2004. Vol. Part III, 168-177 p.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3045
Research subject Dependable Communication and Computation Systems
IdentifiersURN: urn:nbn:se:ltu:diva-32392DOI: 10.1007/b98053Local ID: 6e46f710-a0de-11db-8975-000ea68e967bISBN: 978-3-540-22057-2OAI: oai:DiVA.org:ltu-32392DiVA: diva2:1005626
Computational Science and Its Applications - ICCSA 2004 International Conference : 14/05/2004 - 17/05/2004
Validerad; 2004; 20070110 (ysko)2016-09-302016-09-30Bibliographically approved