Muaz Atiq

A Two-Phase Heuristic Search Approach to the Heilbronn Triangle Problem for n = 10, 11, 12

The Heilbronn triangle problem asks how to place n points in a unit square so that the minimum area triangle formed by any three of them is as large as possible. For n beyond roughly nine points, no configuration has been proven optimal, and progress has relied on a mix of analyt...