Acute Triangulations of Polygons

Authors:
Liping Yuan
Affiliations:
College of Mathematics and Information Science, Hebei Normal University, 050016 Shijiazhuang, People's Republic of China and Department of Mathematics, University of Dortmund, 44221 Dortmund, Germ ...
Venue:
Discrete & Computational Geometry
Year:
2005

Citing 0
Cited 8

Acute triangulations of the regular dodecahedral surface

European Journal of Combinatorics
Acute triangulations of flat tori

European Journal of Combinatorics
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

In this paper we present upper bounds for the number of triangles in a triangulation of an n-gon, imposing the condition that all triangles used are non-obtuse, or just acute. This is based on work by Bern et al. and Maehara, and strengthens their results.