Article ID Journal Published Year Pages File Type
4650074 Discrete Mathematics 2009 4 Pages PDF
Abstract

Let PP be a planar point set in general position. Neumann-Lara et al. showed that there is a convex decomposition of PP with at most 10n−187 elements. In this paper, we improve this upper bound to ⌈75(n−3)⌉+1.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On convex decompositions of a planar point set
Authors
,