Acute triangulations of the regular dodecahedral surface. (English) Zbl 1115.52004

The authors study acute (non-obtuse) geodesic triangulations of two-dimensional spaces, i.e. triangulations by geodesic triangles whose angles are smaller (not larger) than \(\pi/2\). The question is to find an acute (non-obtuse) triangulation of a given space \(M^2\) with as few triangles as possible. The problem was solved for the surfaces of four Platonic solids – tetrahedron, cube, octahedron and icosahedron [see the authors, Discrete Comput. Geom. 31, No. 2, 197–206 (2004; Zbl 1062.51014), J.-I. Itoh, Josai Math. Monogr. 3, 53–62 (2001; Zbl 0998.52015), T. Hangan, J.-I. Itoh and T. Zamfirescu, Bull. Math. Soc. Sci. Math. Roum., Nouv. Sér. 43(91), No. 3–4, 279–285 (2000; Zbl 1048.51501)]. Actually the authors propose a solution for the dodecahedron: the main statement is that there exists a non-obtuse geodesic triangulation of the dodecahedron with only 10 triangles, and that this is the best possible.
Besides, it is demonstrated that there exist an acute geodesic triangulation of the dodecahedron with only 14 triangles, however it is still unclear whether an acute geodesic triangulation with less that 14 triangles does exist. Another more general open problem is the following: does a number \(N\) exist such that every compact convex surface in \(R^3\) admits an acute triangulation with at most \(N\) triangles.


52B05 Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
52B10 Three-dimensional polytopes
52C20 Tilings in \(2\) dimensions (aspects of discrete geometry)
Full Text: DOI


[1] Baker, B.S.; Grosse, E.; Rafferty, C.S., Nonobtuse triangulation of polygons, Discrete comput. geom., 3, 147-168, (1988) · Zbl 0634.57012
[2] Burago, Y.D.; Zalgaller, V.A., Polyhedral embedding of a net, Vestn. leningrad. univ., 15, 66-80, (1960), (in Russian) · Zbl 0098.35403
[3] Cassidy, Ch.; Lord, G., A square acutely triangulated, J. recr. math., 13, 263-268, (1980)
[4] Ciarlet, P.G.; Raviart, P.A., Maximum principle and uniform convergence for the finite element method, Comput. methods appl. mech. engrg., 2, 17-31, (1973) · Zbl 0251.65069
[5] Colin de Verdière, Y., Comment rendre géodésique une triangulation d’une surface?, Enseign. math., II. Sér., 37, 201-212, (1991) · Zbl 0753.57009
[6] Colin de Verdière, Y.; Marin, A., Triangulations presque équilaterales des surfaces, J. differential geom., 32, 199-207, (1990) · Zbl 0705.53021
[7] Fary, I., On straight line representation of planar graphs, Acta sci. math. (Szeged), 11, 229-233, (1948) · Zbl 0030.17902
[8] Gardner, M., Mathematical games. A fifth collection of brain-teasers, Sci. am., 202, 2, 150-154, (1960)
[9] Gardner, M., Mathematical games. the games and puzzles of Lewis carroll, and the answers to february’s problems, Sci. am., 202, 3, 172-182, (1960)
[10] Gerver, J.L., The dissection of a polygon into nearly equilateral triangles, Geom. dedicata, 16, 93-106, (1984) · Zbl 0547.05026
[11] Hangan, T.; Itoh, J.-i.; Zamfirescu, T., Acute triangulations, Bull. math. soc. sci. math. roumanie, 43, 279-286, (2000) · Zbl 1048.51501
[12] Itoh, J.-i., Acute triangulations of sphere and icosahedron, Josai math. monographs, 3, 53-61, (2001) · Zbl 0998.52015
[13] Itoh, J.-i.; Zamfirescu, T., Acute triangulations of the regular icosahedral surface, Discrete comput. geom., 31, 197-206, (2004) · Zbl 1062.51014
[14] Křížek, M.; Qun, L., On diagonal dominance of stiffness matrices in 3D, East – west J. numer. math., 3, 1, 59-69, (1995) · Zbl 0824.65112
[15] S. Korotov, M. Křížek, Acute type refinements of tetrahedral partitions of polyhedral domains, manuscript, 2001 · Zbl 1069.65017
[16] S. Korotov, M. Křížek, P. Neittaanmäki, Weakened acute type condition for tetrahedral triangulations and the discrete maximum principle, University of Jyväskylä, Report B 11/1999 · Zbl 1001.65125
[17] MacNeal, R.H., An asymmetrical finite difference network, Quart. appl. math., 11, 295-310, (1953) · Zbl 0053.26304
[18] H. Maehara, On acute triangulations of quadrilaterals, in: Akiyama, Jin et al. (Eds.), Discrete and Computational Geometry. Japanese Conference, JCDCG 2000, Tokyo, Japan, 22-25 November, 2000. Revised Papers. Berlin: Springer. Lect. Notes Comput. Sci. 2098 (2001) 237-243
[19] Maehara, H., Acute triangulations of polygons, European J. combin., 23, 45-55, (2002) · Zbl 1006.65019
[20] Santos, V.R., On the strong maximum principle for some piecewise linear finite element approximate problems of non-positive type, J. fac. sci. univ. Tokyo, sect. IA math., 29, 473-491, (1982) · Zbl 0488.65052
[21] Strang, G.; Fix, G.J., An analysis of the finite element method, (1973), Prentice-Hall Englewood Cliffs, NJ · Zbl 0278.65116
[22] Tutte, W., How to draw a graph, Proc. London math. soc., 13, 743-768, (1963) · Zbl 0115.40805
[23] Yuan, L., Acute triangulations of polygons, Discrete comput. geom., 34, 697-706, (2005) · Zbl 1112.52002
[24] Zamfirescu, C., Acute triangulations of the double triangle, Bull. math. soc. sci. math. roumanie, 47, 189-193, (2004) · Zbl 1114.52012
[25] T. Zamfirescu, Acute triangulations: a short survey, in: Proc. 6th Annual Conference Romanian Soc. Math. Sciences I, 2002, pp. 10-18
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.