English

Convex decompositions of point sets in the plane

Combinatorics 2019-09-16 v1

Abstract

Let PP be a set of nn points in general position on the plane. A set of closed convex polygons with vertices in PP, and with pairwise disjoint interiors is called a convex decomposition of PP if their union is the convex hull of PP, and no point of PP lies in the interior of the polygons. We show that there is a convex decomposition of PP with at most 43I(P)+13B(P)+143P2\frac{4}{3}|I(P)|+\frac{1}{3}|B(P)|+1\le \frac{4}{3}|P|-2 elements, where B(P)PB(P)\subseteq P is the set of points at the vertices of the convex hull of PP, and I(P)=PB(P)I(P)=P-B(P).

Keywords

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