Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

The On-Line Heilbronn's Triangle Problem in d Dimensions

  • 75 Accesses

  • 5 Citations


In this paper we show a lower bound for the on-line version of Heilbronn's triangle problem in d dimensions. Specifically, we provide an incremental construction for positioning n points in the d-dimensional unit cube, for which every simplex defined by d + 1 of these points has volume Ω(1/n(d+1)ln(d-2)-0.265 d+2.269) (for d ≥ 5).

Author information

Correspondence to Gill Barequet or Alina Shaikhet.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Barequet, G., Shaikhet, A. The On-Line Heilbronn's Triangle Problem in d Dimensions. Discrete Comput Geom 38, 51–60 (2007).

Download citation


  • Discrete Comput Geom
  • Spherical Packing
  • Dimensional Sphere
  • Small Triangle
  • Incremental Construction