加入
Heilbronn's triangle problem: record configurations
Place n points in a square or triangle so the smallest triangle they form is as large as possible; beat a record or prove one optimal.
Place n points in a square or triangle so the smallest triangle they form is as large as possible; beat a record or prove one optimal.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.