A simple polygonal chainA self-intersecting polygonal chainA closed polygonal chain
In geometry, a polygonal chain[a] is a connected series of line segments. More formally, a polygonal chain is a curve specified by a sequence of points called its vertices. The curve itself consists of the line segments connecting the consecutive vertices.
Cite error: There are <ref group=lower-alpha> tags or {{efn}} templates on this page, but the references will not show without a {{reflist|group=lower-alpha}} template or {{notelist}} template (see the help page).
it is important to draw a distinction between a polygonal area and a polygonalchain. A polygonalchain is called monotone if there is a straight line...
polygon (/ˈpɒlɪɡɒn/) is a plane figure made up of line segments connected to form a closed polygonalchain. The segments of a closed polygonalchain are...
of a simple polygon can be subdivided into the given polygon itself and into polygonal pockets bounded by a polygonalchain of the polygon together with...
orthogonal to L intersects the boundary of P at most twice. Similarly, a polygonalchain C is called monotone with respect to a straight line L, if every line...
given line and that intersect a Polygonalchain in a plane that is not parallel to the given line. The polygonalchain is the directrix of the surface;...
geometry, a polygon is traditionally a plane figure that is bounded by a finite chain of straight line segments closing in a loop to form a closed chain. These...
another tangent line, and continuing in the same way until the resulting polygonalchain closes up to an n-gon. The fact that it will always do so is implied...
the polygonalchain ABCBA is a weakly simple polygon according to this definition: it may be viewed as the limit of "squeezing" of the polygon ABCFGHA...
distance between two points in a polygon is the minimum number of line segments of any polygonalchain within the polygon that has the two points as its...
which is the polygon itself. The other regions, bounded by a polygonalchain of the polygon and a single convex hull edge, are called pockets. Computing...
generalizes the directed line segment. Chord (geometry) Diameter Radius Polygonalchain Interval (mathematics) Line segment intersection, the algorithmic problem...
for Multipoint features consisting of several disconnected points. A Polygonalchain or Polyline is an ordered list of points (termed vertices in this context)...
intervening line. A polygonalchain or polyline, a connected set of line segments, defined by an ordered list of points. A polygon, representing a region...
In geometry, a spirangle is a spiral polygonalchain. Spirangles are similar to spirals in that they expand from a center point as they grow larger, but...
closed polygonalchain in three-dimensional space (a skew polygon) that is topologically equal to the unknot but cannot be deformed to a simple polygon when...
Euclidean plane is a closed polygonalchain that has each site as one of its vertices, such that any vertical line crosses the chain at most twice. The optimal...
orthogonal convex hull is a polygon with some degenerate "edges", namely, orthogonally convex alternating polygonalchains with interior angle 90 ∘ {\displaystyle...
knot is tame if and only if it can be represented as a finite closed polygonalchain. Every closed curve containing a wild arc is a wild knot. Knots that...
"chain" and is equivalent to a free-standing arch with no external load), the resulting curve is a catenary. In graphic statics, a funicular polygon is...
necessarily preserve their length. It consists of a sequence of "staircase" polygonalchains in a unit square, formed from horizontal and vertical line segments...
Global Information
