scientific article; zbMATH DE number 2209713
From MaRDI portal
Publication:5692695
zbMath1077.52509MaRDI QIDQ5692695
Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Sethia Saurabh, Vera Sacristán, Joseph S. B. Mitchell, Marc Noy
Publication date: 28 September 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Erd?s problems and related topics of discrete geometry (52C10)
Related Items (13)
Optimal area polygonization problems: exact solutions through geometric duality ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Going around in circles ⋮ Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set ⋮ A combinatorial property on angular orders of plane point sets ⋮ Bottleneck convex subsets: finding \(k\) large convex sets in a point set ⋮ Spiral Serpentine Polygonization of a Planar Point Set ⋮ A Bound on a Convexity Measure for Point Sets ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ On \(k\)-convex point sets ⋮ Holes in 2-convex point sets ⋮ Improved upper bounds on the reflexivity of point sets
This page was built for publication:
