Polygonal chain



In geometry, a polygonal chain is a connected series of line segments. More formally, a polygonal chain $P$ is a curve specified by a sequence of points $$(A_1, A_2, \dots, A_n)$$ called its vertices. The curve itself consists of the line segments connecting the consecutive vertices.

Simple
A simple polygonal chain is one in which only consecutive segments intersect and only at their endpoints.

Closed
A closed polygonal chain is one in which the first vertex coincides with the last one, or, alternatively, the first and the last vertices are also connected by a line segment. A simple closed polygonal chain in the plane is the boundary of a simple polygon. Often the term "polygon" is used in the meaning of "closed polygonal chain", but in some cases it is important to draw a distinction between a polygonal area and a polygonal chain.

Monotone


A polygonal chain is called monotone if there is a straight line L such that every line perpendicular to L intersects the chain at most once. Every nontrivial monotone polygonal chain is open. In comparison, a monotone polygon is a polygon (a closed chain) that can be partitioned into exactly two monotone chains. The graphs of piecewise linear functions form monotone chains with respect to a horizontal line.

Parametrization
Each segment of a polygonal chain is typically parametrized linearly, using linear interpolation between successive vertices. For the whole chain, two parametrizations are common in practical applications: Each segment of the chain can be assigned a unit interval of the parameter corresponding to the index of the first vertex; alternately, each segment of the chain can be assigned an interval of the parameter corresponding to the length of the segment, so that the parameter corresponds uniformly to arclength along the whole chain.

From point sets
Every set of at least $$n$$ points contains a polygonal path of at least $$\lfloor\sqrt{n-1}\rfloor$$ edges in which all slopes have the same sign. This is a corollary of the Erdős–Szekeres theorem.

Applications
Polygonal chains can often be used to approximate more complex curves. In this context, the Ramer–Douglas–Peucker algorithm can be used to find a polygonal chain with few segments that serves as an accurate approximation.

In graph drawing, polygonal chains are often used to represent the edges of graphs, in drawing styles where drawing the edges as straight line segments would cause crossings, edge-vertex collisions, or other undesired features. In this context, it is often desired to draw edges with as few segments and bends as possible, to reduce the visual clutter in the drawing; the problem of minimizing the number of bends is called bend minimization.

In computer-aided geometric design, smooth curves are often defined by a list of control points, e.g. in defining Bézier curve segments. When connected together, the control points form a polygonal chain called a control polygon.

Polygonal chains are also a fundamental data type in computational geometry. For instance, a point location algorithm of Lee and Preparata operates by decomposing arbitrary planar subdivisions into an ordered sequence of monotone chains, in which a point location query problem may be solved by binary search; this method was later refined to give optimal time bounds for the point location problem.

With geographic information system, linestrings may represent any linear geometry, and can be described using the well-known text markup as a  or. Linear rings (or ) are closed and simple polygonal chains used to build polygon geometries.