Title of article
On convex decompositions of a planar point set
Author/Authors
Hosono، نويسنده , , Kiyoshi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
4
From page
1714
To page
1717
Abstract
Let P be a planar point set in general position. Neumann-Lara et al. showed that there is a convex decomposition of P with at most 10 n − 18 7 elements. In this paper, we improve this upper bound to ⌈ 7 5 ( n − 3 ) ⌉ + 1 .
Keywords
Combinatorial Convexity , Convex hull of a point set , decomposition problem
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598636
Link To Document