More on an Erdős-Szekeres-type problem for interior points

DOI10.1007/s00454-008-9090-xzbMath1187.52017OpenAlexW2041321344MaRDI QIDQ1042448

Ren Ding, Xianglin Wei

Publication date: 14 December 2009

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

Full work available at URL: https://doi.org/10.1007/s00454-008-9090-x

zbMATH Keywords

interior pointgeneral positionsplitterdeficient point setempty convex polygonErdős--Szekeres problem

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (5)

A result of the existence with three types of interior points ⋮ Unnamed Item ⋮ On the existence of a point subset with 3 or 6 interior points ⋮ On the Erdős-Szekeres \(n\)-interior-point problem ⋮ Erdős-Szekeres theorem for lines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructions from empty polygons
• A generalisation of the Erdős-Szekeres theorem to disjoint convex sets
• Erdős-Szekeres-type theorems for segments and noncrossing convex sets
• A sufficient condition for the existence of large empty convex polygons
• More on planar point subsets with a specified number of interior points
• On the existence of a convex point subset containing one triangle in the plane
• Research Problems in Discrete Geometry
• On Convex Polygons Determined by a Finite Planar Set
• The Erdos-Szekeres problem on points in convex position – a survey
• A modular version of the Erdős– Szekeres theorem
• Discrete and Computational Geometry
• On the existence of a point subset with a specified number of interior points

This page was built for publication: More on an Erdős-Szekeres-type problem for interior points