Acute triangulations of convex quadrilaterals (Q423942): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.01.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059227808 / rank | |||
Normal rank | |||
Revision as of 19:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Acute triangulations of convex quadrilaterals |
scientific article |
Statements
Acute triangulations of convex quadrilaterals (English)
0 references
30 May 2012
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\). Solving 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
acute triangulation
0 references
convex quadrilateral
0 references
planar straight-line graph
0 references
