The maximum size of a convex polygon in a restricted set of points in the plane
From MaRDI portal
Publication:2640144
DOI10.1007/BF02187725zbMath0719.52007OpenAlexW2060633701MaRDI QIDQ2640144
Noga Alon, Meir Katchalski, William R. Pulleyblank
Publication date: 1989
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131074
Inequalities and extremum problems involving convexity in convex geometry (52A40) Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (7)
Cutting dense point sets in half ⋮ Lines, line-point incidences and crossing families in dense sets ⋮ The visible perimeter of an arrangement of disks ⋮ Fixing a hole ⋮ Point sets with small integer coordinates and no large convex polygons ⋮ Convex independent sets and 7-holes in restricted planar point sets ⋮ The Erdos-Szekeres problem on points in convex position – a survey
Cites Work
This page was built for publication: The maximum size of a convex polygon in a restricted set of points in the plane