Acute Triangulations of Trapezoids and Pentagons | Zendy

Maddalena Cavicchioli | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Acute Triangulations of Trapezoids and Pentagons

Author(s) -

Maddalena Cavicchioli

Publication year - 2013

Publication title -

journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.252

H-Index - 13

eISSN - 2314-4785

pISSN - 2314-4629

DOI - 10.1155/2013/747128

Subject(s) - triangulation , mathematics , point set triangulation , polygon (computer graphics) , regular polygon , minimum weight triangulation , combinatorics , pitteway triangulation , geometry , delaunay triangulation , constrained delaunay triangulation , computer science , telecommunications , frame (networking)

An acute triangulation of a polygon is a triangulation whose triangles have all their angles less than . The number of triangles in a triangulation is called the size of it. In this paper, we investigate acute triangulations of trapezoids and convex pentagons and prove new results about such triangulations with minimum size. This completes and improves in some cases the results obtained in two papers of Yuan (2010).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research