Abstract.
For any set P of n points in general position in the plane there is a convex decomposition of P with at most 
elements. Moreover, any minimal convex decomposition of such a set P has at most 
elements, where k is the number of points in the boundary of the convex hull of P.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Partially supported by Conacyt, Mexico
Final version received: November 10, 2003
Rights and permissions
About this article
Cite this article
Neumann-Lara, V., Rivera-Campo, E. & Urrutia, J. A Note on Convex Decompositions of a Set of Points in the Plane. Graphs and Combinatorics 20, 223–231 (2004). https://doi.org/10.1007/s00373-004-0555-2
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-004-0555-2