Abstract
This paper presents an algorithm for convex polygon decomposition around a given set of locations. Given an n-vertex convex polygon P and a set X of k points positioned arbitrarily inside P, the task is to divide P into k equal area convex parts, each containing exactly one point of X. The problem is motivated by a terrain covering task for a swarm of autonomous mobile robots. The algorithm runs in time O(k n + k 2logk).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akiyama, J.M., Kaneko, A., Kano, M., Nakamura, G., Rivera-Campo, E., Tokunaga, S., Urrutia, J.: Radial perfect partitions of convex sets. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 1–13. Springer, Heidelberg (2000)
Akiyama, J.M., Nakamura, G., Rivera-Campo, E., Urrutia, J.: Perfect division of a cake. In: Proc. 10th Canadian Conf. on Computational Geometry, pp. 114–115 (1998)
Arkin, R.C.: Behavior-Based Robotics. MIT Press, Cambridge (1998)
Aronov, B., Carmi, P., Katz, M.J.: Minimum-cost load-balancing partitions. In: Proc. 22nd ACM Symp. on Computational geometry (SoCG), pp. 301–308 (2006)
Balch, T., Parker, L.E. (eds.): Robot Teams: From Diversity to Polymorphism. A.K. Peters (2001)
Barany, I., Matousek, J.: Simultaneous partitions of measures by k-fans. Discrete and Computational Geometry, pp. 317–334 (2001)
Bast, H., Hert, S.: The area partitioning problem. In: Proc. 12th Canadian Conf. on Computational Geometry (CCCG), pp. 163–171 (2000)
Bereg, S.: Equipartitions of measures by 2-fans. Discrete and Computational Geometry, pp. 87–96 (2005)
Bespamyatnikh, S., Kirkpatrick, D., Snoeyink, J.: Generalizing ham sandwich cuts to equitable subdivisions. Discrete and Computational Geometry, pp. 605–622 (2000)
Bespamyatnikh, S.: On partitioning a cake. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol. 2866, pp. 60–71. Springer, Heidelberg (2003)
Beyer, W.A., Zardecki, A.: The early history of the ham sandwich theorem. American Mathematical Monthly, pp. 58–61 (2004)
Carlsson, J.G., Armbruster, B., Ye, Y.: Finding equitable convex partitions of points in a polygon (Unpublished manuscript, 2007)
Choset, H.: Coverage for robotics - a survey of recent results. Annals of Mathematics and Artificial Intelligence 31, 113–126 (2001)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (1997)
Fox, D., Ko, J., Konolige, K., Limketkai, B., Schulz, D., Stewart, B.: Distributed multi-robot exploration and mapping. In: Proc. IEEE 2006 (2006)
Hert, S., Lumelsky, V.J.: Polygon area decomposition for multiple-robot workspace division. International Journal of Computational Geometry and Applications 8, 437–466 (1998)
Ito, H., Uehara, H., Yokoyama, M.: 2-dimension ham sandwich theorem for partitioning into three convex pieces. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 129–157. Springer, Heidelberg (2000)
Steinhaus, H., et al.: A note on the ham sandwich theorem. Mathesis Polska, pp. 26–28 (1938)
Peleg, D.: Distributed coordination algorithms for mobile robot swarms: New directions and challenges. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol. 3741, pp. 1–12. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adjiashvili, D., Peleg, D. (2008). Equal-Area Locus-Based Convex Polygon Decomposition. In: Shvartsman, A.A., Felber, P. (eds) Structural Information and Communication Complexity. SIROCCO 2008. Lecture Notes in Computer Science, vol 5058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69355-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-69355-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69326-0
Online ISBN: 978-3-540-69355-0
eBook Packages: Computer ScienceComputer Science (R0)