
5.4 Polylines and Polygons 179
P
4
P
3
P
3
P
2
P
0
= P
5
P
1
P
4
P
2
P
1
Q
0
Q
1
Q
0
Q
1
P
0
= P
5
(a)
(b)
Figure 5.9 Examples of (a) a simple concave polygon and (b) a simple convex polygon.
A polygon is a closed polyline. Each point P
i
is called a vertex of the polygon. Each
line segment is called an edge of the polygon. The polygon is said to be simple if non-
adjacent line segments do not intersect. A simple polygon bounds a simply connected
region in the plane. The points in this region are said to be inside the polygon. The
vertices of a simple polygon can be ordered as clockwise or counterclockwise, just
as for triangles. The vertices are counterclockwise ordered if a traversal of the ver-
tices keeps the bounded region to the left. A simple polygon is convex if for any two
points inside the polygon, the line segment connecting the two points is also inside
the polygon. Special cases of convex polygons are triangles, rectangles, parallelograms
(four-sided with two pairs of parallel sides), and convex quadrilaterals (four-sided
with each point outside the triangle formed by the other three points). A polygon
that is not convex is said to be concave.
Figure 5.9 shows two simple polygons. The polygon in Figure 5.9(a) is concave
since the line segment connecting two interior points Q
0
and Q
1
is not fully inside
the polygon. The polygon in Figure 5.9(b) is convex since, regardless of how Q
0
and Q
1
are chosen inside the polygon, the line segment connecting them is always
fully inside the polygon. Figure 5.10 shows two nonsimple polygons. The polygon
in Figure 5.10(a) has nonadjacent line segments P
1
, P
2
and P
3
, P
4
that intersect.
The intersection point is not a vertex of the polygon. The polygon in Figure 5.10(b)
is the same polygon with the intersection point included as a vertex. But the polygon
is still nonsimple since it has multiple nonadjacent line segments that intersect at
P
2
. Polygons of this latter type are referred to as polysolids (Maynard and Tavernini
1984).
A polygonal chain is an open polyline for which nonadjacent line segments do
not intersect. A polygonal chain C is strictly monotonic with respect to a line L if
every line orthogonal to L intersects C in at most one point. The chain is monotonic