Convex decompositions of point sets in the plane
Combinatorics
2019-09-16 v1
Abstract
Let be a set of points in general position on the plane. A set of closed convex polygons with vertices in , and with pairwise disjoint interiors is called a convex decomposition of if their union is the convex hull of , and no point of lies in the interior of the polygons. We show that there is a convex decomposition of with at most elements, where is the set of points at the vertices of the convex hull of , and .
Cite
@article{arxiv.1909.06105,
title = {Convex decompositions of point sets in the plane},
author = {Toshinori Sakai and Jorge Urrutia},
journal= {arXiv preprint arXiv:1909.06105},
year = {2019}
}
Comments
This result was first presented at Japan Conference on Computational Geometry and Graphs (JCCGG2009), Kanazawa, Japan, in 2009