Maximizing the Smallest Triangle Made by N Points in a Square

DOI10.2307/2687869zbMath0238.52006OpenAlexW4251403158WikidataQ56446515 ScholiaQ56446515MaRDI QIDQ5649043

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)

Related Items (6)

The average‐case area of Heilbronn‐type triangles* ⋮ 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 ⋮ On the global minimum of the classical potential energy for clusters bound by many-body forces ⋮ On a Heilbronn-type problem

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