Abstract
In the touring polygons problem (TPP), for a given sequence \((s=P_0,P_1,\dots ,P_k,t=P_{k+1})\) of polygons in the plane, where s and t are two points, the goal is to find a shortest path that starts from s, visits each of the polygons in order and ends at t. In the constrained version of TPP, there is another sequence \((F_{0},\dots ,F_{k})\) of polygons called fences, and the portion of the path from \(P_i\) to \(P_{i+1}\) must lie inside the fence \(F_{i}\). TPP is NP-hard for disjoint non-convex polygons, while TPP and constrained TPP are polynomially solvable when the polygons are convex and the fences are simple polygons. In this work, we present the first polynomial time algorithm for solving constrained TPP when the fences are polygonal domains (polygons with holes). Since, the safari problem is a special case of TPP, our algorithm can be used for solving safari problem inside polygons with holes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahadi, A., Mozafari, A., Zarei, A.: Touring a sequence of disjoint polygons: complexity and extension. Theor. Comput. Sci. 556, 45–54 (2014)
Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a sequence of polygons. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing. ACM (2003)
Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput. 16(4), 647–668 (1987)
Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput. 28(6), 2215–2256 (1999)
Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Int. J. Comput. Geom. Appl. 6(03), 309–332 (1996)
Mozafari, A., Zarei, A.: Touring a sequence of line segments in polygonal domain fences. In: CCCG (2015)
Sack, J.R., Urrutia, U.J.: Handbook of Computational Geometry. Elsevier, Boca Raton (1999)
Tan, X., Jiang, B.: Efficient algorithms for touring a sequence of convex polygons and related problems. In: Gopal, T.V., Jäger, G., Steila, S. (eds.) TAMC 2017. LNCS, vol. 10185, pp. 614–627. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-55911-7_44
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Ahadi, A., Mozafari, A., Zarei, A. (2017). Touring Convex Polygons in Polygonal Domain Fences. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10628. Springer, Cham. https://doi.org/10.1007/978-3-319-71147-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-71147-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71146-1
Online ISBN: 978-3-319-71147-8
eBook Packages: Computer ScienceComputer Science (R0)