Name
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. © 2005 Springer Science+Business Media, Inc. |
Year | DOI | Venue |
|---|---|---|
2005 | null | Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie |
Keywords | DocType | Volume |
Computational Mathematic,Acute Triangulation | Journal | 53 |
Issue | ISSN | Citations |
4 | null | 3 |
PageRank | References | Authors |
0.45 | 6 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liping Yuan | 1 | 21 | 5.07 |