Nonobtuse triangulation of polygons
Discrete & Computational Geometry
Acute triangulations of polygons
European Journal of Combinatorics
Plane graphs with straight edges whose bounded faces are acute triangles
Journal of Combinatorial Theory Series B
Tiling space and slabs with acute tetrahedra
Computational Geometry: Theory and Applications
Acute triangulations of the regular dodecahedral surface
European Journal of Combinatorics
Acute triangulations of flat tori
European Journal of Combinatorics
Note: Acute triangulations of trapezoids
Discrete Applied Mathematics
Note: Acute triangulations of convex quadrilaterals
Discrete Applied Mathematics
Acute triangulations of the cuboctahedral surface
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Hi-index | 0.00 |
An acute triangulation of a polygon 驴 is a triangulation of 驴 into acute triangles. Let f(驴) denote the minimum number of triangles necessary for an acute triangulation of 驴, and let f(n) denote the maximum value of f(驴) for all n-gons 驴. We prove f(4) = 10.