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...
Na minha lista:
| Principais autores: | , , , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Carleton University
2021-02-01
|
| coleção: | Journal of Computational Geometry |
| Acesso em linha: | https://jocg.org/index.php/jocg/article/view/3124 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|