Abstract
In this paper, we introduce a new version of the shortest path problem appeared in many applications. In this problem, there is a start point s, an end point t, an ordered sequence \(\cal{S}\)=(S 0 = s,S 1,...,S k ,S k + 1 = t) of sets of polygons, and an ordered sequence \(\cal{F}\)=(F 0,...,F k ) of simple polygons named fences in \(\Re^2\) such that each fence F i contains polygons of S i and S i + 1. The goal is to find a path of minimum possible length from s to t which orderly touches the sets of polygons of \(\cal{S}\) in at least one point supporting the fences constraints. This is the general version of the previously answered Touring Polygons Problem (TPP). We prove that this problem is NP-Hard and propose a precision sensitive FPTAS algorithm of O(k 2 n 2/ε 2) time complexity where n is the total complexity of polygons and fences.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility-polygon search and Euclidean shortest paths. In: Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 155–164 (1985)
Asano, T., Kirkpatrick, D., Yap, C.: Pseudo approximation algorithms, with applications to optimal motion planning. In: Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 170–178 (2002)
Canny, J., Reif, J.H.: New lower bound techniques for robot motion planning problems. In: Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci, pp. 49–60 (1987)
Chin, W., Ntafos, S.: Shortest Watchman Routes in Simple Polygons. Discrete and Computational Geometry 6(1), 9–31 (1991)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT press (2009) ISBN 978-0-262-03384-8
Dror, M., Efrat, A., Lubiw, A., Mitchell, J.: Touring a sequence of polygons. In: Proc. STOC 2003, pp. 473–482 (2003)
Dror, M.: Polygon plate-cutting with a given order. IIE Transactions 31, 271–274 (1999)
Guibas, L.J., Hershberger, J.: optimal shortest path queries in simple polygon. J. Comput. Syst. Sci. 39, 126–152 (1989)
Hershberger, J., Snoeyink, J.: An efficient solution to the zookeeper’s problem. In: Proc. 6th Canadian Conf. on Comp. Geometry, pp. 104–109 (1994)
Li, F., Klette, R.: Rubberband algorithms for solving various 2D or 3D shortest path problems. In: Proc. Computing: Theory and Applications, The Indian Statistical Institute, Kolkata, pp. 9–18. IEEE (2007)
Tan, X., Hirata, T.: Constructing Shortest Watchman Routes by Divide and Conquer. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 68–77. Springer, Heidelberg (1993)
Tan, X., Hirata, T.: Shortest Safari Routes in Simple Polygons. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol. 834, pp. 523–531. Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mozafari, A., Zarei, A. (2012). Touring Polygons: An Approximation Algorithm. In: Arumugam, S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2012. Lecture Notes in Computer Science, vol 7643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35926-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-35926-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35925-5
Online ISBN: 978-3-642-35926-2
eBook Packages: Computer ScienceComputer Science (R0)