A Lower Bound for Heilbronn's Triangle Problem in d Dimensions
Author:
- Gill BarequetGBGill Barequet
- 1 January 2001
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 14 (2) , 230-236
Abstract
In this paper we show a lower bound for the generalization of Heilbronn's triangle problem to d dimensions; namely, we show that there exists a set S of n points in the d-dimensional unit cube so that every d+1 points of S define a simplex of volume $\Omega (\frac{1}{n^d})$. We also show a constructive incremental positioning of n points in a unit 3-cube for which every tetrahedron defined by four of these points has volume $\Omega (\frac{1}{n^4})$.
Keywords
This publication has 7 references indexed in Scilit:
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three DimensionsJournal of Algorithms, 2001
- The Probabilistic Method1998
- A Lower Bound for Heilbronn'S ProblemJournal of the London Mathematical Society, 1982
- On Heilbronn's Triangle ProblemJournal of the London Mathematical Society, 1981
- Developments in Heilbronn's triangle problemAdvances in Mathematics, 1976
- On a Problem of Heilbronn†Journal of the London Mathematical Society, 1972
- On a Problem of HeilbronnJournal of the London Mathematical Society, 1951