fairfolio
Saved Projects

Polygon Triangulation Problem

ISEF · 2017 Mathematics

Qader, Saya

Is this your project?

Overview

Polygon Triangulation problem is one of the problem in combinatorial mathematics. The problem is that, in how many ways can a convex polygon with n+2 sides (labelled 0,1,2,…,n) be divided into triangles by non-intersecting diagonals. When we have n+1 sided polygon, it can be separated into triangles by non-intersecting diagonal in many ways. Our aim to find formula in how many ways we can do this. The main purpose of this project is to find a mathematical model of polygon triangulation and the explicit formula of how many ways can we use to have different triangle from n+2 sided polygon. ?

Working on something like this? See what's been done and what's still open.

Competition history

  • ISEF 2017 Mathematics · Entry MATH055 Affiliated fair in Iraq

Resources

Related projects

Closest projects by meaning, across every fair and year in the corpus.

Browse more like this

Report a problem

Source: Regeneron International Science and Engineering Fair

Save projects to your library

Sign in with Google to keep track of projects you find interesting, organized into folders. An account also raises your daily allowance for “Has this been done?”, and lets you create a key for the MCP server with a much higher limit than anonymous use. Browsing stays public.

Continue with Google