Maximizing the Smallest Triangle Made by N Points in a Square

DOI10.2307/2687869MaRDI QIDQ5649043zbMATH OpenOpenAlexWikidataFDO

Authors Michael Goldberg

Publication date 1972

Full work available at URL https://doi.org/10.2307/2687869

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cited in

(7)

• Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing
• The average‐case area of Heilbronn‐type triangles*
• Heilbronn triangle‐type problems in the unit square [0,1]²
• Heilbronn's problem of eight points in the square
• On the global minimum of the classical potential energy for clusters bound by many-body forces
• On Heilbronn triangle-type problems in higher dimensions
• On a Heilbronn-type problem

This page was built for publication: Maximizing the Smallest Triangle Made by N Points in a Square

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