Convex polygons in Cartesian products
From MaRDI portal
Publication:5088949
DOI10.4230/LIPIcs.SoCG.2019.22OpenAlexW2908270252MaRDI QIDQ5088949
Jean-Lou De Carufel, Adrian Dumitrescu, Sander Verdonschot, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1812.11332
convexitypolyhedronapproximation algorithmrecursive constructionCartesian productErdös-Szekeres theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
- Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited
- No-three-in-line-in-3D
- On consecutive sums in sequences
- Topologically sweeping an arrangement
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
- Counting convex polygons in planar point sets
- Point configurations in \(d\)-space without large subsets in convex position
- Convexity and sumsets
- Extensions of a result of Elekes and Rónyai
- On the number of unit-area triangles spanned by convex grids in the plane
- On the number of convex lattice polytopes
- General position subsets and independent hyperplanes in \(d\)-space
- Polynomials vanishing on grids: The Elekes-Rónyai problem revisited
- Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
- On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3
- On Sumsets of Convex Sets
- Ramsey-type results for semi-algebraic relations
- Random points and lattice points in convex bodies
- On the Number of Convex Lattice Polygons
- On the Erdős-Szekeres convex polygon problem
- On the General Position Subset Selection Problem
- The No-Three-In-Line Problem
- On a Problem of Heilbronn
This page was built for publication: Convex polygons in Cartesian products
