Heilbronn's triangle problem
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

n = 11: reproduction of Goldberg's 1/27 (Comellas and Yebra 2002, p. 7) #10
Open
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic
