Finding convex sets among points in the plane

DOI10.1007/PL00009358zbMath0908.52005OpenAlexW2020316116WikidataQ29030889 ScholiaQ29030889MaRDI QIDQ1387852

Daniel J. Kleitman, Lior Pachter

Publication date: 18 March 1999

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

Full work available at URL: https://doi.org/10.1007/pl00009358

zbMATH Keywords

convex polygonvertex

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (14)

On the Erdős-Szekeres convex polygon problem ⋮ An improved upper bound for the Erdős-Szekeres conjecture ⋮ Erdős-Szekeres without induction ⋮ On the Erdös-Szekeres problem ⋮ Two upper bounds for the Erdős-Szekeres number with conditions ⋮ On the minimum number of mutually disjoint holes in planar point sets ⋮ Point sets with small integer coordinates and no large convex polygons ⋮ A SAT attack on the Erdős-Szekeres conjecture ⋮ Ramsey-remainder for convex sets and the Erdős-Szekeres theorem ⋮ Disjoint empty convex polygons in planar point sets ⋮ On the Erdős-Szekeres \(n\)-interior-point problem ⋮ Erdős-Szekeres theorem for lines ⋮ The Erdős-Szekeres Problem ⋮ The Erdos-Szekeres problem on points in convex position – a survey

This page was built for publication: Finding convex sets among points in the plane