论文信息 - Improved bounds for acute triangulations of convex polygons

Improved bounds for acute triangulations of convex polygons

We present a novel method of constructing non-obtuse and acute triangulations of planar convex n-gons, improving existing bounds presented in [L. Yuan, Discrete Comput. Geom. 34, 697-706 (2005)] for 6 <= n <= 11 and 6 <= n <= 56, respectively.

Carol T. Zamfirescu | C. T. Zamfirescu

[1] Carol T. Zamfirescu,et al. Acute Triangulations of Doubly Covered Convex Quadrilaterals , 2007 .

[2] Hiroshi Maehara. On Acute Triangulations of Quadrilaterals , 2000, JCDCG.

[3] Shubhangi Saraf,et al. Acute and nonobtuse triangulations of polyhedral surfaces , 2009, Eur. J. Comb..

[4] Tudor Zamfirescu,et al. Acute triangulations: a short survey , 2005 .

[5] Charles Cassidy,et al. A square acutely triangulated , 1980 .

[6] Liping Yuan,et al. Acute Triangulations of Pentagons , 2010 .

[7] Carol T. Zamfirescu. Acute triangulations of the double triangle , 2004 .

[8] Liping Yuan,et al. Acute Triangulations of Polygons , 2005, Discret. Comput. Geom..

[9] Marshall W. Bern,et al. Linear-size nonobtuse triangulation of polygons , 1995, Discret. Comput. Geom..

[10] Hiroshi Maehara,et al. Acute Triangulations of Polygons , 2002, Eur. J. Comb..