On empty hexagons

zbMATH Open1147.52301MaRDI QIDQ3514531FDOQ3514531

Authors: Pavel Valtr 

Publication date: 21 July 2008

Recommendations

• Empty convex hexagons in planar point sets
• The empty hexagon theorem
• Almost empty polygons
• Empty convex hexagons in planar point sets
• Finding sets of points without empty convex 6-gons

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Cited In (18)

• Two disjoint 5-holes in point sets
• On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
• Finding sets of points without empty convex 6-gons
• A simple proof for open cups and caps
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Almost empty monochromatic triangles in planar point sets
• Disjoint empty convex pentagons in planar point sets
• Specified holes with pairwise disjoint interiors in planar point sets
• Computer solution of the almost empty hexagon problem
• On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
• Holes and islands in random point sets
• Covering islands in plane point sets
• Large convex holes in random point sets
• A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
• Almost empty hexagons
• The empty hexagon theorem
• Every large point set contains many collinear points or an empty pentagon
• On pseudo-convex partitions of a planar point set

This page was built for publication: On empty hexagons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514531)