Convex polygons in cartesian products
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of $n$ real numbers (for short, \emph{grid}). First, we prove that every such grid contains $\Omega(\log n)$ points in convex position and that this bound is tight up to a constant factor. We...
| Published in: | Journal of Computational Geometry |
|---|---|
| Main Authors: | , , , , , , |
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2021-02-01
|
| Online Access: | https://jocg.org/index.php/jocg/article/view/3124 |