Applications of Mathematics

, Volume 62, Issue 3, pp 213–223

# Simplices rarely contain their circumcenter in high dimensions

Article

## Abstract

Acute triangles are defined by having all angles less than π/2, and are characterized as the triangles containing their circumcenter in the interior. For simplices of dimension n ≥ 3, acuteness is defined by demanding that all dihedral angles between (n−1)-dimensional faces are smaller than π/2. However, there are, in a practical sense, too few acute simplices in general. This is unfortunate, since the acuteness property provides good qualitative features for finite element methods. The property of acuteness is logically independent of the property of containing the circumcenter when the dimension is greater than two. In this article, we show that the latter property is also quite rare in higher dimensions. In a natural probability measure on the set of n-dimensional simplices, we show that the probability that a uniformly random n-simplex contains its circumcenter is 1/2n.

### Keywords

simplex circumcenter finite element method

65M60 52A05

## Preview

### References

1. [1]
J. Bertrand: Calcul des probabilités, Gauthier-Villars, Paris, 1889.
2. [2]
J. Brandts, S. Korotov, M. Křížek: Dissection of the path-simplex in Rn into n path-subsimplices. Linear Algebra Appl. 421 (2007), 382–393.
3. [3]
J. Brandts, S. Korotov, M. Křížek: A geometric toolbox for tetrahedral finite element partitions. Efficient Preconditioned Solution Methods for Elliptic Partial Differential Equations (O. Axelsson, J. Karátson, eds.). Bentham Science Publishers Ltd., 2011, pp. 103–122.Google Scholar
4. [4]
P. G. Ciarlet: Basic error estimates for elliptic problems, Handbook of Numerical Analysis. Volume II: Finite Element Methods (Part 1). North-Holland, Amsterdam, 1991, pp. 17–351.Google Scholar
5. [5]
M. Hajja, P. Walker: Equifacial tetrahedra. Int. J. Math. Educ. Sci. Technol. 32 (2001), 501–508.
6. [6]
R. Hošek: Face-to-face partition of 3D space with identical well-centered tetrahedra. Appl. Math., Praha 60 (2015), 637–651.
7. [7]
G. Kalai: On low-dimensional faces that high-dimensional polytopes must have. Combinatorica 10 (1990), 271–280.
8. [8]
E. Kopczyński, I. Pak, P. Przytycki: Acute triangulations of polyhedra and RN. Combinatorica 32 (2012), 85–110.
9. [9]
S. Korotov, M. Křížek: Global and local refinement techniques yielding nonobtuse tetrahedral partitions. Comput. Math. Appl. 50 (2005), 1105–1113.
10. [10]
S. Korotov, J. Stańdo: Yellow-red and nonobtuse refinements of planar triangulations. Math. Notes, Miskolc 3 (2002), 39–46.
11. [11]
M. Křížek: On the maximum angle condition for linear tetrahedral elements. SIAM J. Numer. Anal. 29 (1992), 513–520.
12. [12]
M. Křížek: There is no face-to-face partition of R 5 into acute simplices. Discrete Comput. Geom. 36 (2006), 381–390; Erratum. Discrete Comput. Geom. 44 (2010), 484–485.
13. [13]
M. E. Muller: A note on a method for generating points uniformly on N-dimensional spheres. Commun. ACM 2 (1959), 19–20.
14. [14]
E. VanderZee, A. N. Hirani, D. Guoy: Triangulation of simple 3D shapes with wellcentered tetrahedra, Proceedings of the 17th International Meshing Roundtable. Springer, Berlin, 2008, pp. 19–35.Google Scholar
15. [15]
E. VanderZee, A. N. Hirani, V. Zharnitsky, D. Guoy: A dihedral acute triangulation of the cube. Comput. Geom. 43 (2010), 445–452.