Automated Proofs in Geometry : Computing Upper Bounds for the Heilbronn Problem for Triangles


The Heilbronn problem for triangle[Wei] is defined as follows: place N points inside a triangle of unit area, so as to maximize the area of the smallest triangle obtained by choosing 3 points among N. Several authors worked towards finding lower bounds or optimal configurations of points. In this paper, we propose upper bounds for those problems, obtained… (More)

6 Figures and Tables


  • Presentations referencing similar topics