On the Heilbronn Optimal Configuration of Seven Points in the Square

DOI10.1007/978-3-642-21046-4_11zbMath1302.52022DBLPconf/adg/ZengC08OpenAlexW2110938502WikidataQ56446516 ScholiaQ56446516MaRDI QIDQ3003236

Liangyu Chen, Zhenbing Zeng

Publication date: 26 May 2011

Published in: Automated Deduction in Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21046-4_11

zbMATH Keywords

combinatorial geometryautomated deductionHeilbronn problem

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Inequalities and extremum problems involving convexity in convex geometry (52A40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (3)

Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing ⋮ Heilbronn triangle‐type problems in the unit square [0,1²] ⋮ Heilbronn's problem of eight points in the square

This page was built for publication: On the Heilbronn Optimal Configuration of Seven Points in the Square