Utils Module

pode.utils.cut(contour: Contour, start: Point, end: Point) → List[Point]: Returns all points between the start point and the end point lying on the counter including the endpoints themselves. The points do not necessarily match with contour vertices.

pode.utils.edges(contour: Contour) → Iterator[Segment]

pode.utils.joined_constrained_delaunay_triangles(polygon: Polygon, *, extra_points: Sequence[Point] = (), extra_constraints: Sequence[Segment] = (), context: Context) → List[Contour]: Joins polygons to form convex parts of greater size

pode.utils.order_convex_contour_points(points: List[Point]) → List[Point]

pode.utils.orient(polygon: Polygon) → Polygon: To counterclockwise. No holes

pode.utils.rotate(sequence: List[T], index: int) → List[T]

pode.utils.shrink_collinear_vertices(contour: Contour) → List[Point]

pode.utils.splitter_point(requirement: float, pivot: Point, low_area_point: Point, high_area_point: Point) → Point: Alternative to bisection search since we always have triangles

pode.utils.to_fractions(geometry: GeometryType) → GeometryType
pode.utils.to_fractions(geometry: Point) → Point
pode.utils.to_fractions(geometry: Contour) → Contour
pode.utils.to_fractions(geometry: Polygon) → Polygon

pode.utils.unite(*geometries: Shaped) → Shaped | Empty