Acute triangulations of polygons

Authors:
H. Maehara
Affiliations:
Ryukyu University, Nishihara, Okinawa, Japan
Venue:
European Journal of Combinatorics
Year:
2002

Citing 2
Cited 10

Nonobtuse triangulation of polygons

Discrete & Computational Geometry
On Acute Triangulations of Quadrilaterals

JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry

Plane graphs with straight edges whose bounded faces are acute triangles

Journal of Combinatorial Theory Series B
Acute triangulations of the regular dodecahedral surface

European Journal of Combinatorics
Acute triangulations of flat tori

European Journal of Combinatorics
On a Discrete Maximum Principle for Linear FE Solutions of Elliptic Problems with a Nondiagonal Coefficient Matrix

Numerical Analysis and Its Applications
Acute and nonobtuse triangulations of polyhedral surfaces

European Journal of Combinatorics
Note: Acute triangulations of trapezoids

Discrete Applied Mathematics
Acute triangulations of polyhedra and the Euclidean space

Proceedings of the twenty-sixth annual symposium on Computational geometry
Computational geometry I

Algorithms and theory of computation handbook
Well-Centered Triangulation

SIAM Journal on Scientific Computing
Acute triangulations of the cuboctahedral surface

CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that every n-gon can be triangulated into O(n) acute triangles. We also present a short proof of the result that every polygon can be triangulated into right triangles.