Acute triangulations of polygons (Q5966248): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00454-005-1188-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2002106526 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:05, 20 March 2024
scientific article; zbMATH DE number 5009616
Language | Label | Description | Also known as |
---|---|---|---|
English | Acute triangulations of polygons |
scientific article; zbMATH DE number 5009616 |
Statements
Acute triangulations of polygons (English)
0 references
2 March 2006
0 references
Triangulation of a polygon subject to certain condition is a traditional topic in planimetry. The condition can be that all the triangles are acute or non-obtuse. The appropriate triangulations are called respectively acute and non-obtuse. Burago and Zalgaller proved in 1960 that every polygon allows an acute triangulation. Let \(P\) be a class of polygons and \(p \in P\). Denote by \(m(p)\) the minimum size of all acute triangulations of \(p\). Some other results in that area establish for \(P\) upper bounds of \(m(p)\) when \(p \in P\). Say, Machara proved that, if \(P\) is a class of polygons allowing a non-obtuse triangulation of size \(N\), then \(m(p) \leq 2.6^5N\). The present author improves this result significantly showing that \(m(p) \leq 24N\) (Theorem 2). He shows also that, if \(P\) is the class of all \(n\)-gons, then \(m(p) \leq 106n -216\) (Theorem 3).
0 references
Triangulation
0 references
polygon
0 references
acute triangulation
0 references