Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Home / Get Math Help

    Heilbronn Triangle Problem

    Definition

    The Heilbronn triangle problem is to place n>=3 points in a disk (square, equilateral triangle, etc.) of unit area so as to maximize the area Δ(n) of the smallest of the (n 3) = n(n - 1)(n - 2)/6 triangles determined by the n points. For n = 3 points, there is only a single triangle, so Heilbronn's problem degenerates into finding the largest triangle that can be constructed from points in a square. For n = 4, there are four possible triangles for each configuration, so the problem is to find the configuration of points for which the smallest of these four triangles is the maximum possible.

    Associated person

    Hans Arnold Heilbronn

    Back to List | POWERED BY THE WOLFRAM LANGUAGE