This submodule contains utility functions, mainly to help with polygon creation.
Check if the points given forms a clockwise polygon
Returns: | True if the points forms a clockwise polygon |
---|
Remove close points to simplify a polyline tolerance is the min distance between two points squared.
Returns: | The reduced polygon as a list of (x,y) |
---|
Create a convex hull from a list of points. This function uses the Graham Scan Algorithm.
Returns: | Convex hull as a list of (x,y) |
---|
Rearranges vectors around the center If points_as_Vec2d, then return points are also Vec2d, else pos
Returns: | pointlist ([Vec2d/pos, ...]) |
---|
Test if a polygon (list of (x,y)) is convex or not
Returns: | True if the polygon is convex, False otherwise |
---|
Calculate the perimeter of a polygon
Returns: | Perimeter of polygon |
---|
Triangulates poly and returns a list of triangles
Parameters : |
|
---|
Reduces a list of triangles (such as returned by triangulate()) to a non-optimum list of convex polygons
Parameters : |
|
---|