Acute triangulations of convex quadrilaterals (Q423942)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Acute triangulations of convex quadrilaterals |
scientific article; zbMATH DE number 6039493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acute triangulations of convex quadrilaterals |
scientific article; zbMATH DE number 6039493 |
Statements
Acute triangulations of convex quadrilaterals (English)
0 references
30 May 2012
0 references
acute triangulation
0 references
convex quadrilateral
0 references
planar straight-line graph
0 references
An acute triangulation of a polygon \(P\) is a triangulation of \(P\) into acute triangles. Let \(f(P)\) be the minimum number of triangles necessary for an acute triangulation of \(P\).NEWLINENEWLINESolving a problem raised by \textit{H. Maehara} [Lect. Notes Comput. Sci. 2098, 237--243 (2001; Zbl 0998.52005)], the author proves that the maximum value of \(f(Q)\) for all convex quadrilaterals \(Q\) is equal to 8.
0 references
0.8574028611183167
0 references
0.8343855738639832
0 references
0.8331931829452515
0 references
0.8314760327339172
0 references
