Convex decompositions of point sets in the plane

Abstract

Let P be a set of n points in general position on the plane. A set of closed convex polygons with vertices in P, and with pairwise disjoint interiors is called a convex decomposition of P if their union is the convex hull of P, and no point of P lies in the interior of the polygons. We show that there is a convex decomposition of P with at most 43|I(P)|+13|B(P)|+1 43|P|-2 elements, where B(P)⊂eq P is the set of points at the vertices of the convex hull of P, and I(P)=P-B(P).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…