“…Recently, Jiang, Li and Vitany [9] showed by using methods from Kolmogorov complexity that if n points are distributed uniformly at random and independently of each other in the unit-square [0, 1] 2 , then the expected value of the minimum area of a triangle formed by some three of these n random points is equal to Θ(1/n 3 ). As indicated in [9], this result might be of use to measure the affiancy of certain Monte Carlo methods for determining fair market values of derivatives. Higher dimensional extensions of Heilbronn's triangle problem were investigated by Barequet [2,3], who considered for fixed integers d ≥ 2 the minimum volumes of simplices among n points in the d-dimensional unit-cube [0, 1] d , maximized over all distributions of n points in [0,1] d , see also [12], [13] and Brass [6].…”