Convexly independent subsets of the Minkowski sum of planar point sets

Let P and Q be finite sets of points in the plane. In this note we consider the largest cardinality of a subset of the Minkowski sum S ⊆ P⊕Q which consist of convex independent points. We show that, if P and Q contain at most n points, then |S| = O(n^(4/3)).


Published in:
Electronic Journal of Combinatorics, 15, 1, Note 8, 4
Year:
2008
Publisher:
American Mathematical Society
ISSN:
1077-8926
Keywords:
Note:
Professor Pach's number: [224]
Other identifiers:
Laboratories:




 Record created 2008-08-21, last modified 2018-03-18

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)