Finding sets of points without empty convex 6-gons

DOI10.1007/s00454-002-2829-xzbMath1019.52010OpenAlexW2134189835WikidataQ54152676 ScholiaQ54152676MaRDI QIDQ1864134

Mark H. Overmars

Publication date: 17 March 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-2829-x

zbMATH Keywords

convex hullErdős problemsincremental algorithmempty convex \(6\)-gons

Mathematics Subject Classification ID

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

Related Items (21)

Two disjoint 5-holes in point sets ⋮ On empty convex polygons in a planar point set ⋮ On the Erdös-Szekeres problem ⋮ A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets ⋮ On weighted sums of numbers of convex polygons in point sets ⋮ On the Erdős–Szekeres problem in combinatorial geometry ⋮ On the minimum number of mutually disjoint holes in planar point sets ⋮ Large convex holes in random point sets ⋮ Interior points in the Erdős-Szekeres theorems ⋮ Unnamed Item ⋮ Almost empty hexagons ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ Cells in any simple polygon formed by a planar point set ⋮ Largest and smallest area triangles on imprecise points ⋮ Specified holes with pairwise disjoint interiors in planar point sets ⋮ Empty convex hexagons in planar point sets ⋮ On the Erdős-Szekeres \(n\)-interior-point problem ⋮ A superlinear lower bound on the number of 5-holes ⋮ The Erdős-Szekeres Problem ⋮ On Erdős-Szekeres-type problems ⋮ On the existence of a convex point subset containing one triangle in the plane

This page was built for publication: Finding sets of points without empty convex 6-gons