Abstract
A convex partition of a point set P in the plane is a planar subdivision of the convex hull of P whose edges are segments with both endpoints in P and such that all internal faces are empty convex polygons. In the Minimum Convex Partition Problem (mcpp) one seeks to find a convex partition with the least number of faces. The complexity of the problem is still open and so far no computational tests have been reported. In this paper, we formulate the mcpp as an integer program that is used both to solve the problem exactly and to design heuristics. Thorough experiments are conducted to compare these algorithms in terms of solution quality and runtime, showing that the duality gap is decidedly small and grows quite slowly with the instance size.
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
Similar content being viewed by others
Notes
- 1.
Here, \((i+\overrightarrow{u})\) denotes any point obtained by a translation of i in the direction \(\overrightarrow{u}\).
References
Barboza, A.S., de Souza, C.C., de Rezende, P.J.: Minimum Convex Partition of Point Sets - Benchmark Instances and Solutions (2018). www.ic.unicamp.br/~cid/Problem-instances/Convex-Partition
Bose, P., et al.: Online routing in convex subdivisions. Int. J. Comput. Geom. Appl. 12(4), 283–296 (2002)
Fevens, T., Meijer, H., Rappaport, D.: Minimum convex partition of a constrained point set. Discrete Appl. Math. 109(1–2), 95–107 (2001)
García-López, J., Nicolás, M.: Planar point sets with large minimum convex partitions. In: Abstracts 22nd European Workshop on Computational Geometry, pp. 51–54 (2006)
Hosono, K.: On convex decompositions of a planar point set. Discrete Math. 309(6), 1714–1717 (2009)
Keil, J.M.: Polygon decomposition. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 491–518. North-Holland, Amsterdam (2000)
Knauer, C., Spillner, A.: Approximation algorithms for the minimum convex partition problem. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 232–241. Springer, Heidelberg (2006). https://doi.org/10.1007/11785293_23
Löffler, M., Mulzer, W.: Unions of onions: preprocessing imprecise points for fast onion decomposition. J. Comput. Geom. 5(1), 1–13 (2014)
Neumann-Lara, V., Rivera-Campo, E., Urrutia, J.: A note on convex decompositions of a set of points in the plane. Graphs Comb. 20(2), 223–231 (2004)
Spillner, A.: A fixed parameter algorithm for optimal convex partitions. J. Discrete Algorithms 6(4), 561–569 (2008)
Acknowledgments
This research was financed in part by grants from Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) #311140/2014-9, #304727/2014-8, Coordenação de Aperfeiçoamento do Pessoal do Ensino Superior - Brasil (Capes) #001 and Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) #2014/12236-1, #2017/12523-9, #2018/14883-5.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Barboza, A.S., de Souza, C.C., de Rezende, P.J. (2019). Minimum Convex Partition of Point Sets. In: Heggernes, P. (eds) Algorithms and Complexity. CIAC 2019. Lecture Notes in Computer Science(), vol 11485. Springer, Cham. https://doi.org/10.1007/978-3-030-17402-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-17402-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-17401-9
Online ISBN: 978-3-030-17402-6
eBook Packages: Computer ScienceComputer Science (R0)