As a result, most image maps coded by hand are simple polygons.

For simple polygons, the problem of straight skeleton construction is easier.

Each wall, the floor and the ceiling is a simple polygon, in this case, a rectangle.

For simple polygons, both algorithms will always give the same results for all points.

It states that guards are always sufficient and sometimes necessary to guard a simple polygon with vertices.

The simplest polygon is the equilateral triangle which echoes itself at 60 intervals.

A simple polygon does not cross itself.

A simple polygon may be decomposed into monotone polygons as follows.

When it is not known in advance that the sequence of points defines a simple polygon, the following things must be kept in mind.

The following properties of a simple polygon are all equivalent to convexity:

The buildings themselves were simple polygons, with cutout windows showing various programs and objicons for sale.

The same algorithm may also be used for determining whether a closed polygonal chain forms a simple polygon.

A concave simple polygon has at least one interior angle that exceeds 180 .

A simple closed polygonal chain in the plane is the boundary of a simple polygon.

A linear time algorithm is known to report all directions in which a given simple polygon is monotone.

Simple polygon, a single contiguous closed region, the more common usage of "polygon"

Using this algorithm to triangulate a simple polygon takes O(n log n) time.

Georg Alexander Pick publishes his theorem on the area of simple polygons.

Every maximal outerplanar graph is the visibility graph of a simple polygon.

Therefore, unlike simple polygons, a complex polygon may not always be interpreted as a simple polygonal region.

Some authors use the name exterior angle of a simple polygon to simply mean the explementary (not supplementary!)

In geometry, an anthropomorphic polygon is a simple polygon with precisely two ears and one mouth.

This argument can be generalized to concave simple polygons, if external angles that turn in the opposite direction are subtracted from the total turned.

A simple polygon may be easily cut into monotone polygons in O(n log n) time.

A simple polygon that is not convex is called concave, non-convex or reentrant.