Constructions from empty polygons

DOI10.1007/S10998-004-0518-7zbMATH Open1068.52023OpenAlexW2014439009MaRDI QIDQ558322FDOQ558322

Authors T. Bisztriczky, Kiyoshi Hosono, Gyula Károlyi, Masatsugu Urabe

Publication date 5 July 2005

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10998-004-0518-7

zbMATH Keywords

empty polygon[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Szekeres+theorem&go=Go Erd��s-Szekeres theorem]combinatorial convexitypoint configurations

Mathematics Subject Classification ID

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

Recommendations

• Constructions of Polygons From Buildings
• Almost empty polygons
• On empty convex polytopes
• Polygons derived from polygons via iterated constructions
• Empty convex polygons in almost convex sets
• Construction theorems for polytopes
• scientific article; zbMATH DE number 125492
• Constructions for regular polytopes

Cites work

• A modular version of the Erdős– Szekeres theorem
• A sufficient condition for the existence of large empty convex polygons
• Almost empty polygons
• Large empty convex polygons in \(k\)-convex sets
• On the existence of a point subset with a specified number of interior points
• Sets with No Empty Convex 7-Gons

Cited in

(7)

• On polygons enclosing point sets. II
• On polygons enclosing point sets
• More on planar point subsets with a specified number of interior points
• Every large point set contains many collinear points or an empty pentagon
• A sufficient condition for the existence of large empty convex polygons
• More on an Erdős-Szekeres-type problem for interior points
• On the existence of a point subset with three or five interior points

This page was built for publication: Constructions from empty polygons

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