Shortest paths in simple polygons with polygon-meet constraints

Authors:
Ramtin Khosravi;Mohammad Ghodsi
Affiliations:
IPM School of Computer Science, P.O. Box 19395-574 Tehran Iran and Department of Computer Engineering, Sharif University of Technology P.O. Box 11365-9517, Tehran, Iran;Department of Computer Engineering, Sharif University of Technology P.O. Box 11365-9517, Tehran, Iran and IPM School of Computer Science, P.O. Box 19395-574 Tehran Iran
Venue:
Information Processing Letters
Year:
2004

Citing 10
Cited 2

Shortest watchman routes in simple polygons

Discrete & Computational Geometry
Watchman routes under limited visibility

Computational Geometry: Theory and Applications
The zookeeper route problem

Information Sciences: an International Journal
An Optimal Algorithm for Euclidean Shortest Paths in the Plane

SIAM Journal on Computing
Approximation algorithms for TSP with neighborhoods in the plane

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Touring a sequence of polygons

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A new representation for linear lists

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Finding shortest safari routes in simple polygons

Information Processing Letters
Approximation algorithms for the watchman route and zookeeper's problems

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
A fast approximation algorithm for TSP with neighborhoods and red-blue separation

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Query-point visibility constrained shortest paths in simple polygons

Theoretical Computer Science
Visiting a Polygon on the Optimal Way to a Query Point

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study a constrained version of the shortest path problem in simple polygons, in which the path must visit a given target polygon. We provide a worst-case optimal algorithm for this problem and also present a method to construct a subdivision of the simple polygon to efficiently answer queries to retrieve the shortest polygon-meeting paths from a single-source to the query point. The algorithms are linear, both in time and space, in terms of the complexity of the two polygons.