Finding sets of points without empty convex 6-gons
From MaRDI portal
Recommendations
Cited in
(26)- On disjoint holes in point sets
- On the minimum number of mutually disjoint holes in planar point sets
- The Erdős-Szekeres Problem
- On Erdős-Szekeres-type problems
- On the Erdős-Szekeres \(n\)-interior-point problem
- Two disjoint 5-holes in point sets
- On empty convex polygons in a planar point set
- A superlinear lower bound on the number of 5-holes
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
- Almost empty hexagons
- Large convex holes in random point sets
- A SAT attack on higher dimensional Erdős-Szekeres numbers
- Largest and smallest area triangles on imprecise points
- On the Erdös-Szekeres problem
- On the Erdős–Szekeres problem in combinatorial geometry
- Cells in any simple polygon formed by a planar point set
- Empty convex hexagons in planar point sets
- Specified holes with pairwise disjoint interiors in planar point sets
- Every large point set contains many collinear points or an empty pentagon
- On the existence of a convex point subset containing one triangle in the plane
- A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
- Convex hulls of random order types
- On empty hexagons
- Interior points in the Erdős-Szekeres theorems
- Searching for empty convex polygons
- On weighted sums of numbers of convex polygons in point sets
This page was built for publication: Finding sets of points without empty convex 6-gons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864134)
