A Note on the Minimum Size of a Point Set Containing Three Nonintersecting Empty Convex Polygons
Let P be a planar point set with no three points collinear, k points of P be a k-hole of P if the k points are the vertices of a convex polygon without points of P. This article proves 13 is the smallest integer such that any planar points set containing at least 13 points with no three points colli...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-09-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/10/10/447 |