Discrete & Computational Geometry

, Volume 61, Issue 1, pp 212–217 | Cite as

Acute Sets

  • Dmitriy ZakharovEmail author


A set of points in \({\mathbb {R}}^d\) is acute if any three points from this set form an acute triangle. In this note we construct an acute set in \({\mathbb {R}}^d\) of size at least \(1.618^d\). We also present a simple example of an acute set of size at least \(2^{{d}/{2}}\). Obtained bounds improve the previously best bound.


Acute set Euclidean space Danzer-Grünbaum problem 



We would like to thank Andrey Kupavskii and Alexandr Polyanskii for discussions that helped to improve the main result, as well as for their help in preparing this note. We would also like to thank Prof. Raigorodskii for introducing us to this problem and for his constant encouragement.


  1. 1.
    Ackerman, E., Ben-Zwi, O.: On sets of points that determine only acute angles. Eur. J. Comb. 30(4), 908–910 (2009)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Danzer, L., Grünbaum, B.: Uber zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee. Math. Z. 79, 95–99 (1962)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Erdős, P., Füredi, Z.: The greatest angle among \(n\) points in the \(d\)-dimensional Euclidean space. In: Berge, C., et al. (eds.) Combinatorial Mathematics. Annals of Discrete Mathematics, vol. 17, pp. 275–283. North-Holland, Amsterdam (1983)Google Scholar
  4. 4.
    Harangi, V.: Acute sets in Euclidean spaces. SIAM J. Discrete Math. 25(3), 1212–1229 (2011)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.School 179MoscowRussian Federation

Personalised recommendations