### Abstract

Let S be a set of n points in the plane in general position (no three points from S are collinear). For a positive integer k, a k-hole in S is a convex polygon with k vertices from S and no points of S in its interior. For a positive integer l, a simple polygon P is l-convex if no straight line intersects the interior of P in more than l connected components. A point set S is l-convex if there exists an l-convex polygonization of S. Considering a typical Erdős–Szekeres-type problem, we show that every 2-convex point set of size n contains an Ω(logn)-hole. In comparison, it is well known that there exist arbitrarily large point sets in general position with no 7-hole. Further, we show that our bound is tight by constructing 2-convex point sets in which every hole has size O(logn).

Original language | English |
---|---|

Pages (from-to) | 38-49 |

Number of pages | 12 |

Journal | Computational Geometry: Theory and Applications |

Volume | 74 |

DOIs | |

Publication status | Published - 1 Oct 2018 |

### ASJC Scopus subject areas

- Computer Science Applications
- Geometry and Topology
- Control and Optimization
- Computational Theory and Mathematics
- Computational Mathematics

## Fingerprint Dive into the research topics of 'Holes in 2-convex point sets'. Together they form a unique fingerprint.

## Cite this

*Computational Geometry: Theory and Applications*,

*74*, 38-49. https://doi.org/10.1016/j.comgeo.2018.06.002