Improved upper bounds on the reflexivity of point sets
From MaRDI portal
Publication:1000926
DOI10.1016/j.comgeo.2008.05.004zbMath1157.52008OpenAlexW2084143237MaRDI QIDQ1000926
Oswin Aichholzer, Balázs Keszegh, Eyal Ackerman
Publication date: 12 February 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.05.004
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Erd?s problems and related topics of discrete geometry (52C10)
Related Items (6)
Optimal area polygonization problems: exact solutions through geometric duality ⋮ On polygons excluding point sets ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Going around in circles ⋮ A combinatorial property on angular orders of plane point sets
Cites Work
This page was built for publication: Improved upper bounds on the reflexivity of point sets