Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICCSA

2004

Springer

2004

Springer

Abstract. 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 2+c c times longer than the overall shortest route that intersects the subchains (not just at vertices) if the minimal distance between vertices of diļ¬erent 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 suļ¬...

Related Content

Added |
01 Jul 2010 |

Updated |
01 Jul 2010 |

Type |
Conference |

Year |
2004 |

Where |
ICCSA |

Authors |
Håkan Jonsson |

Comments (0)