Readonly classRequired to generate proper CSS classes and other class related IDs.
isDestroyed
Polygon
Polygon
Readonly uidThe UID of this drawable object.
Polygon
Polygon
Static utilsCalculate the area of the given polygon (unsigned).
Note that this does not work for self-intersecting polygons.
area
Calulate the signed polyon area by interpreting the polygon as a matrix and calculating its determinant.
signedArea
Add a vertex to the end of the vertices array.
The vertex to add.
addVertex
Polygon
Add a vertex at a particular position of the vertices array.
The vertex to add.
The position to add the vertex at. Will be handled modulo.
addVertexAt
Polygon
Get the closest line-polygon-intersection point (closest the line point A).
See demo 47-closest-vector-projection-on-polygon for how it works.
The line to find intersections with.
If set to true only intersecion points on the passed vector are considered (located strictly between start and end vertex).
Check if the passed polygon is completly contained inside this polygon.
This means:
The polygon to check if contained.
Check if the given vertex is inside this polygon.
Ray-casting algorithm found at
https://stackoverflow.com/questions/22521982/check-if-point-inside-a-polygon
The vertex to check.
True if the passed vertex is inside this polygon. The polygon is considered closed.
containsVert
Polygon
Check if all given vertices are inside this polygon.
This method just uses the Polygon.containsVert method.
The vertices to check.
True if all passed vertices are inside this polygon. The polygon is considered closed.
containsVerts
Polygon
Create a new polygon without colinear adjacent edges. This method does not midify the current polygon but creates a new one.
Please note that this method does NOT create deep clones of the vertices. Use Polygon.clone() if you need to.
Please also note that the tolerance may become really large here, as the denominator of two closely
parallel lines is usually pretty large. See the demo 57-eliminate-colinear-polygon-edges to get
an impression of how denominators work.
Optional tolerance: number(default is 1.0) The epsilon to detect co-linear edges.
A new polygon without co-linear adjacent edges – respective the given epsilon.
elimitateColinearEdges
Polygon
Get a new instance of the line at the given start index. The returned line will consist
of the vertex at vertIndex and vertIndex+1 (will be handled modulo).
The vertex index of the line to start.
getEdgeAt
Polygon
Checks if the angle at the given polygon vertex (index) is acute. Please not that this is
only working for clockwise polygons. If this polygon is not clockwise please use the
isClockwise method and reverse polygon vertices if needed.
The index of the polygon vertex to check.
true is angle is acute, false is obtuse.
isAngleAcute
Polygon
Construct a new polygon from this polygon with more vertices on each edge. The
interpolation count determines the number of additional vertices on each edge.
An interpolation count of 0 will return a polygon that equals the source
polygon.
A polygon with interpolationCount more vertices (as as factor).
Get the polygon vertex at the given position (index).
The index may exceed the total vertex count, and will be wrapped around then (modulo).
For k >= 0:
The index of the desired vertex.
At the given index.
getVertexAt
Polygon
Get all line intersections with this polygon.
See demo 47-closest-vector-projection-on-polygon for how it works.
The line to find intersections with.
If set to true only intersecion points on the passed vector are returned (located strictly between start and end vertex).
Convert this polygon to a sequence of cubic Bézier curves.
The first vertex in the returned array is the start point.
The following sequence are triplets of (first-control-point, secnond-control-point, end-point):
startPoint, controlPoint0_0, controlPoint1_1, pathPoint1, controlPoint1_0, controlPoint1_1, ..., endPoint
An optional threshold (default=1.0) how strong the curve segments should over-/under-drive. Should be between 0.0 and 1.0 for best results but other values are allowed.
An array of 2d vertices that shape the cubic Bézier curve.
toCubicBezierData
Polygon
Convert this polygon to a cubic bezier path instance.
The threshold, usually from 0.0 to 1.0.
toCubicBezierPath
Polygon
Convert this polygon to a sequence of quadratic Bézier curves.
The first vertex in the returned array is the start point.
The following sequence are pairs of control-point-and-end-point:
startPoint, controlPoint0, pathPoint1, controlPoint1, pathPoint2, controlPoint2, ..., endPoint
An array of 2d vertices that shape the quadratic Bézier curve.
toQuadraticBezierData
Polygon
Classdesc
A polygon class. Any polygon consists of an array of vertices; polygons can be open or closed.
Requires
BezierPath
Requires
Bounds
Requires
SVGSerializabe
Requires
UID
Requires
UIDGenerator
Requires
Vertex
Requires
XYCoords