Skip to main content

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4112))

Abstract

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 \(^{\rm ({\it d}+1)ln ({\it d}--2)+2}\)).

Work on this paper by the first author has been supported in part by the European FP6 Network of Excellence Grant 506766 (AIM@SHAPE).

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barequet, G.: A lower bound for Heilbronn’s triangle problem in d dimensions. SIAM J. on Discrete Mathematics 14, 230–236 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Barequet, G.: The online Heilbronn’s triangle problem. Discrete Mathematics 283, 7–14 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barequet, G., Naor, J.: Large k-D simplices in the d-dimensional unit cube. In: Barequet, G., Naor, J. (eds.) Proc. 17th Canadian Conf. on Computational Geometry, Windsor, Ontario, Canada, pp. 30–33 (August 2005)

    Google Scholar 

  4. Jiang, T., Li, M., Vitányi, P.: The average-case area of Heilbronn-type triangles. Random Structures and Algorithms 20, 206–219 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Komlós, J., Pintz, J., Szemerédi, E.: On Heilbronn’s triangle problem. J. London Math. Soc. 24(2), 385–396 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  6. Komlós, J., Pintz, J., Szemerédi, E.: A lower bound for Heilbronn’s problem. J. London Math. Soc. 25(2), 13–24 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lefmann, H.: On Heilbronn’s problem in higher dimension. Combinatorica 23, 669–680 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lefmann, H.: Large triangles in the d-dimensional unit-cube. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 43–52. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Lefmann, H.: Distributions of points in d dimensions and large k-point simplices. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 514–523. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Roth, K.F.: On a problem of Heilbronn. Proc. London Math. Soc. 26, 198–204 (1951)

    Article  MATH  Google Scholar 

  11. Schmidt, W.M.: On a problem of Heilbronn. J. London Math. Soc. 4(2), 545–550 (1971)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barequet, G., Shaikhet, A. (2006). The On-Line Heilbronn’s Triangle Problem in d Dimensions. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_43

Download citation

  • DOI: https://doi.org/10.1007/11809678_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36925-7

  • Online ISBN: 978-3-540-36926-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics