Visiting a Polygon on the Optimal Way to a Query Point

Authors:
Ramtin Khosravi;Mohammad Ghodsi
Affiliations:
School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Department of Computer Engineering, Sharif University of Technology, Tehran, Iran and School of Computer Science, Institute for Studies in Theoretical Physics and Mathematics, Tehran, Iran
Venue:
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Year:
2008

Citing 6
Cited 0

Corrections to Lee's visibility polygon algorithm

BIT
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
Shortest paths in simple polygons with polygon-meet constraints

Information Processing Letters
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm for this problem based on the wavefront propagation method and also present a method to construct a subdivision of the domain to efficiently answer queries to retrieve the constrained shortest paths from a single-source to the query point.