Triangle dissections of convex polygons

Authors

  • Dochkova, Juliana
  • Mengersen, Ingrid

Abstract

The maximum number Δn and the minimum number δn of incongruent triangles in a dissection of a regular convex (n+2)-gon by n-1 non-intersecting diagonals into triangles are investigated. For Δn a general formula is determined. In case of δn general bounds are presented and the exact value for special (infinite) classes of n.

Published

2005-06-09

How to Cite

Dochkova, Juliana, & Mengersen, Ingrid. (2005). Triangle dissections of convex polygons. Utilitas Mathematica, 68. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/358

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.