Skip to main content
Article thumbnail
Location of Repository

Approximate Shortest Path Algorithms for Sequences of Pairwise Disjoint Simple Polygons

By Xiuxia Pan, Fajie Li and Reinhard Klette


Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is to find a shortest path such that it starts at p, then visits these polygons in the given order, and ends at q. This paper describes four approximation algorithms for unconstrained versions of problems defined by touring an ordered set of polygons. It contributes to an approximate and partial answer to the previously open problem “What is the complexity of the touringpolygons problem for pairwise disjoint, simple and not necessarily convex polygons? ” by providing κ(ε)O(n) approximation algorithms for solving this problem, either for given start and end points p and q, or wit

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.