Introduction to Ear Cutting for Simple Polygons

First of all, some very important definitions are introduced.

A **polygon**
is a closed chain of *n* line segments (*p _{i}*,

2 Polygons

A **simple polygon** is a polygon *P*
with no two non-consecutive edges intersecting. There is a
well-defined bounded interior and an unbounded exterior for a simple polygon,
where the interior is surrounded by edges. When referring to *P*,
the convention is to include the interior of *P*.

A **diagonal** is a line segment lying entirely inside
polygon *P* and
joining two non-consecutive vertices *p _{i}* and

A vertex *p _{i}* is called a

A
principal vertex *p _{i}* of a
simple polygon

`This page was last updated on Saturday, December 6 ^{th},
1997.`

`©` `1997 Ian Inc.`