hC%SrSSKJr SSKJrJrJrJrJrJ r J r SSK J r SSK Jr SSKJr SSKJr /SQr\ "S \S 9r\\\\S 4rS \S '\"S S5rSSjrSSjrSSjrSSjrg)a This module provides "nested Polygon" detection for multiple paths. Terminology ----------- exterior creates a filled area, has counter-clockwise (ccw) winding exterior := Path hole creates an unfilled area, has clockwise winding (cw), hole := Polygon polygon list of nested paths: polygon without a hole: [path] polygon with 1 hole: [path, [path]] polygon with 2 separated holes: [path, [path], [path]] polygon with 2 nested holes: [path, [path, [path]]] polygon := [exterior, *hole] The result is a list of polygons: 1 polygon returns: [[ext-path]] 2 separated polygons returns: [[ext-path], [ext-path, [hole-path]]] A hole is just another polygon, some render backends may require a distinct winding order for nested paths like: ccw-cw-ccw-cw... [Exterior-ccw, [Hole-Exterior-cw, [Sub-Hole-ccw], [Sub-Hole-ccw], ], [Hole-Exterior-cw], [Hole-Exterior-cw], ] The implementation has to do some expensive tests, like check if a path is inside of another path or if paths do overlap. A goal is to reduce this costs by using proxy objects: Bounding Box Proxy ------------------ This implementation uses the bounding box of the path as proxy object, this is very fast but not accurate, but can handle most of the real world scenarios, in the assumption that most HATCHES are created from non-overlapping boundary paths. Overlap detection and resolving is not possible. The input paths have to implement the SupportsBoundingBox protocol, which requires only a method bbox() that returns a BoundingBox2d instance for the path. Sort by Area ------------ It is not possible for a path to contain another path with a larger area. ) annotations)TupleOptionalListIterableSequenceIteratorTypeVar) TypeAlias) namedtuple)AbstractBoundingBox)SupportsBoundingBox)make_polygon_structurewinding_deconstruction group_pathsflatten_polygonsT)boundPolygonr BoxStructz bbox, pathc^^^SSjnSSjmSUU4SjjmS U4Sjjm/nUH@nUR5nUR(dM&UR[XC55 MB UR US9 T"T"U55$) zpReturns a recursive polygon structure from iterable `paths`, uses 2D bounding boxes as fast detection objects. c`URRnURUR-$N)bboxsizexy)itemrs D/var/www/html/env/lib/python3.13/site-packages/ezdxf/path/nesting.pyarea$make_polygon_structure..areaes!yy~~vvc/n/nUH@nURURR5(aUOURU5 MB X#4$r)insidercenterappend)exterior candidatesholesoutside candidates rseparate(make_polygon_structure..separateisM"$#%#Iooinn&;&;</nU(aQUR5nT"URU5up0U(aT"U5nURU/UQ5 U(aMQU$r)poprr&)r*polygonsr'r)polygon_structurer,s rr11make_polygon_structure..polygon_structureus[{{}H&hmmW=NE*%0 OOX.. /gr"c>UVs/sH,n[U[5(a UROT"U5PM. sn$s snfr) isinstancerpath)r0polygonas_nested_pathss rr7/make_polygon_structure..as_nested_pathssE$ #'w ::GLLPW@X X#   s3<)key)rrreturnfloat)r'r r(list[BoxStruct]r:z'tuple[list[BoxStruct], list[BoxStruct]])r*r<r:z list[list])r:list)rhas_datar&rsort)pathsr boxed_pathsr5rr7r1r,s @@@rrr^s % 3B  0    Kyy{ ===   y4 5 ,[9 ::r"c:^^^UUU4Sjm/m/mT"US5 TT4$)a Flatten the nested polygon structure in a tuple of two lists, the first list contains the paths which should be counter-clockwise oriented and the second list contains the paths which should be clockwise oriented. The paths are not converted to this orientation. c>UHBn[U[5(a T"X!S-5 M%US-(aTOTRU5 MD g)N)r4rr&) polygons_levelr6 ccw_pathscw_paths deconstructs rrJ+winding_deconstruction..deconstructs> G'8,,GQY/ %qyx??H !r"r)r0rHrIrJs @@@rrrs*IHI! h r"c#~# UH1n[U[5(a[U5ShvN M-Uv M3 gN7f)z9Yield a flat representation of the given nested polygons.N)r4rr)r0r6s rrrs2 gx ( ('0 0 0M  0s )=;=cl[U5nUVs/sHn[[U55PM sn$s snf)z:Group separated paths and their inner holes as flat lists.)rr=r)r@r0r6s rrrs/%e,H;C D8D!'* +8 DD Ds1N)r@ Iterable[T]r: list[Polygon])r0rPr:ztuple[list[T], list[T]])r0rr:z Iterator[T])r@rOr:z list[list[T]])__doc__ __future__rtypingrrrrrr r typing_extensionsr collectionsr ezdxf.mathr ezdxf.protocolsr__all__rr__annotations__rrrrrrLr"rrZs<z#("*/  C*+1htI7788 {L 1 2;j4Er"