Miѻ2SrSSKrSSKrSSKJr SSKJr SSKrSSK J r J r J r J r JrJrJrJrJr SSK Jr SSK Jr SS KJr SS KJr SS KJr SS KJr SS KJrJ r J!r!J"r"J#r#J$r$J%r%J&r&J'r'J(r( SSK)J*r* SSK J+r+J,r,J-r-J.r.J/r/ SSK0J1r1 SSK2J3r3 SSKJ4r4 SSK J5r5 SSK J9r9 SSK:J;r; SSKr?"SS\R5rA"SS\A5rB"SS\A5rCg!\6ar7\Rp"\75r5Sr7C7NcSr7C7ff=f!\6ar7\Rp"\75r9Sr7C7NSr7C7ff=f!\6ar7\Rp"\75r;Sr7C7NSr7C7ff=f!\6ar7\Rp"\75r=Sr7C7NSr7C7ff=f!\6ar7\Rp"\75r?Sr7C7NSr7C7ff=f)zm path.py ----------- A module designed to work with vector paths such as those stored in a DXF or SVG file. N)deepcopy)sha256) boundscaching comparisonconvex exceptionsgroupingparentunitsutil)transformations)cache_decorator)log)tol_path)plane_transform) plane_fit) ArrayLikeIterableListMappingNDArrayOptionalSelfTupleUnionfloat64)to_rgba)creationrastersegmentssimplify traversal)Entity export_path concatenate)repair)polygons)cKDTree)PolygoncL\rSrSrSrSS#jr%\S$5r&\S%5r'\S&5r(\S'5r)S(\S \4S)jr*S*\"S S4S+jr+S,r,S?S-jr-S.r.S/r/S0r0S1r1\S25r2S3r3\S \4\\4S4j5r5S@S5jr6S \74S6jr8S?S7\\"S\\\"S444S8jjr9S9r:S:r;S;r     ! cS[U5RSURRS[ UR 5S3$)z? Print a quick summary of the number of vertices and entities. z )type__name__r3shapelenr2rAs rC__repr__ Path.__repr__sF4:..//? @S@S?TTdehimivivewdxxz{{rFreturncUR UR5 UR5 UR5 SSS5 U$!,(df  U$=f)z= Apply basic cleaning functions to the Path object in-place. N)r?r@remove_duplicate_entitiesremove_unreferenced_verticesrLs rCr5 Path.processsJ[[    !  * * ,  - - / [ s 1A AcURVs/sHoRPM nn[SU55(dg[R"UVs/sHn[ U5PM sn5nSUR S'U$s snfs snf)zu Colors are stored per-entity. Returns ------------ colors : (len(entities), 4) uint8 RGBA colors for each entity c3(# UHoSLv M g7fN).0cs rC Path.colors..s.#QD=#sNF WRITEABLE)r2coloranynparrayrflags)rAerawrYr6s rCr6 Path.colorssp!% . 1ww ..#...s3s!71:s34$) [! /4s A?BvaluescUcg[U5n[U5[UR5:wa [S5e[ X R5H up4X4lM g)z Set the color for every entity in the Path. Parameters ------------ values : (len(entities), 4) uint8 Color of each entity Nzcolors must be per-entity!)rrKr2 ValueErrorzipr])rArer6rYrbs rCr6rdsP >  v;#dmm, ,9: : .DAG/rFcUR$rV) _verticesrLs rCr3 Path.verticess ~~rFcUc)[R"/[RS9Ulg[R"U[RS9Ulg)Ndtype)r tracked_arrayr_rrjrAres rCr3rks7 >$222RZZHDN$226LDNrFcUR$)z The actual entities making up the path. Returns ----------- entities : (n,) trimesh.path.entities.Entity Entities such as Line, Arc, or BSpline curves ) _entitiesrLs rCr2 Path.entitiess~~rFcxUc[R"/5Ulg[R"U5UlgrV)r_r`rr asanyarrayrps rCr2rss& >XXb\DN]]62DNrFcXURVs/sHoRPM sn$s snf)z Get a list of the layer for every entity. Returns --------- layers : (len(entities), ) any Whatever is stored in each `entity.layer` r2layerrArbs rClayers Path.layerss""&/A///s'c[URR55RS5/nUR SUR 55 [ R"SRU55$)zf A hash of the current vertices and entities. Returns ------------ hash : long int Appended hashes zutf-8c3@# UHoR5v M g7frV)_bytes)rXrbs rCrZ Path.__hash__..s:Mq MsrF) hexr3r>encodeextendr2r hash_fastjoin)rAhashables rCr> Path.__hash__sY ..0188AB:DMM::  (!344rFcURS-R[R5n[ UR SS95R 5$)zq Return a hash of the identifier. Returns ---------- hashed : (64,) str SHA256 hash of the identifier vector. g@C)order) identifierastyper_int64rtobytes hexdigest)rAas_ints rCidentifier_hashPath.identifier_hashs@//C'//9fnn3n/0::<[UR5S:Xa)[R"[UR55$[R "[R"[UR55[R "UR55$)zy List of entities that aren't included in a closed path Returns ---------- dangling : (n,) int Index of self.entities r)rKrr_aranger2 setdiff1dhstackrLs rCdangling Path.danglings\ tzz?a 99S/0 0||BIIc$--&89299TZZ;PQQrFcj[URR[R55nU$)z A KDTree object holding the vertices of the path. Returns ---------- kdtree : scipy.spatial.cKDTree Object holding self.vertices )r-r3viewr_ndarray)rAkdtrees rCr Path.kdtree.s&++BJJ78 rFcX^[[U4SjTR555nU$)zp The total discretized length of every entity. Returns -------- length : float Summed length of every entity c3X># UHoRTR5v M! g7frV)lengthr3)rXirAs rCrZPath.length..EsJMq88DMM22Ms'*)floatsumr2)rArs` rCr Path.length;s#sJDMMJJK rFc[R"URVs/sHoRUR5PM sn[R S9nUR SURRS45n[R"URSS9URSS9/[R S9$s snf)z Return the axis aligned bounding box of the current path. Returns ---------- bounds : (2, dimension) float AABB with (min, max) coordinates rmr raxis) r_r`r2rr3rreshaperJminmax)rArbpointss rCr Path.boundsHs.2mm .sO%N!V%Ns)allr; vertex_graphdegreere)rAcloseds rC is_closedPath.is_closeds6OT$*;*;*B*B*D%E%L%L%NOO rFc2[UR5S:H$)zs Are any entities defined for the current path. Returns ---------- empty : bool True if no entities are defined r)rKr2rLs rCis_empty Path.is_emptys4==!Q&&rFcJ[R"UR5upU$)zk Return a networkx.Graph object for the entity connectivity graph : networkx.Graph Holds vertex indexes )r%rr2)rAgraph_closeds rCrPath.vertex_graphs#// > rFc[R"URVs/sHoRPM sn5nU$s snf)z Get a list of which vertex indices are nodes, which are either endpoints or points where the entity makes a direction change. Returns -------------- nodes : (n, 2) int Indexes of self.vertices which are nodes )r_vstackr2nodes)rArbrs rC vertex_nodesPath.vertex_nodess1 DMM:Mq77M:; ;s= transformcURRSn[R"U[RS9nURUS-US-4:wa [ S5e[R "U[R"US-5- 5R5S:aU$URR5 0nSURR;a2URVs/sHn[R"XAS9PM snUS'SH9nXPRR;dMURRUX5'M; [R"URUS9UlURR5 URR!5 URRR#U5 U$s snf)z Apply a transformation matrix to the current path in- place Parameters ----------- transform : (d+1, d+1) float Homogeneous transformations for vertices r rmztransform is incorrect shape!g:0yE>discrete)matrix)rootr path_validrr enclosureenclosure_shellenclosure_directed)r3rJr_rurrgabseyerr?verifycachertftransform_pointsrid_setr<)rAr dimensionrdkeys rCapply_transformPath.apply_transformsjMM''* MM)2::> ??y1}i!m< <<= = VVIy1} 55 6 : : ++CII ,BqQF"..t}}VL f- ;?;Q;Q;W;W;Y" ;YZSC%( (;Y" ggc$--0= &t}}5ME<((D,, ' 6 (()?@Fv~v;!#q VBZ(?#BQZF[1_).K&3v;!#3%* "#M166 k2 C" s &GcPURHnXRUlM g)z Replace the vertex index references in every entity. Parameters ------------ mask : (len(self.vertices), ) int Contains new vertex indexes Notes ------------ entity.points in self.entities Replaced by mask[entity.points] N)r2r)rAmaskrs rCreplace_vertex_referencesPath.replace_vertex_references[s mmF /FM$rFc[U5S:Xag[R"[UR5[S9nSX!'URUUlg)zn Remove entities by index. Parameters ----------- entity_ids : (n,) int Indexes of self.entities to remove rNrmF)rKr_r r2r )rA entity_idskeeps rCremove_entitiesPath.remove_entitieslsD z?a  wws4==)6  d+ rFc[R"URVs/sHoRPM sn[S9nURUUlgs snf)z] Remove entities which declare themselves invalid Notes ---------- self.entities: shortened rmN)r_r`r2is_validr )rArvalids rCremove_invalidPath.remove_invalid{s>dmm v;#dmm, , MM&1DM -"BsB cZ[UR5S:Xa#[R"/[RS9$[R "[R "URVs/sHoRPM sn5R[R55$s snf)zz Which vertices are referenced by an entity. Returns ----------- referenced_vertices: (n,) int, indexes of self.vertices rrm) rKr2r_r`rrr*rrrys rCreferenced_verticesPath.referenced_verticessn t}}  "88Bbhh/ /yy NNdmmks rCcopy Path.copys  **,-C > (s); < .  &#&& V#'==F=aGGv4E=HFH}}Hdh'dmm,    M = ))..01D#DKK$5$5a$89$   ]  > d3%';<== >G0 . II, - = II,t < =s6E%=FFAF%$F F G8GGc"SSKJn U"U5nU$)z Get a scene object containing the current Path3D object. Returns -------- scene: trimesh.scene.Scene object containing current path r)Scene)scenerK)rArKrLs rCrL Path.scene(s "d  rFc[X/5nU$)z Concatenate two Path objects by appending vertices and reindexing point references. Parameters ----------- other: Path object Returns ----------- concat: Path object, appended from self and other r))rAotherconcats rC__add__ Path.__add__5sd]+ rF)r?rrrjr6r2r4r7r3)NNNTNNF)g?rVNN)=rI __module__ __qualname____firstlineno____doc__rrrr&rrr rDrMrr5propertyrr6setterrr3r2rzr>rrrrrrrrrrArrrrrrrrrrr@rrr!rQr)rRrrr4r;r7rHrLrQ__static_attributes__rWrFrCr0r0SsX>B(,&*&*/31" 8F#3T9:1"9%1"7# 1"  1" # 1"$G,1"f| )& ]]Xi0(''*__Mx 2MM   __33  0 05  = =   R R    TT, (''* ( ( +) + + AS A A  2   ' '  44t4l   $23h0" , - 2    .$ $ww/0  .S$--D5dHU395E,F!FGDL rFr0c \rSrSrSrSrSS\\S\\S\S\ S \ \ 44S jjr \ S\ \ 4S j5r\ S 5rS rSrg)Path3DiF@ Hold multiple vector curves (lines, arcs, splines, etc) in 3D. cZ[R"S[SS9 UR"U0UD6$)zF DEPRECATED: replace `path.to_planar`->`path.to_2D), removal 1/1/2026 zDDEPRECATED: replace `path.to_planar`->`path.to_2D), removal 1/1/2026r)category stacklevel)warningswarnDeprecationWarningto_2D)rAargsrBs rC to_planarPath3D.to_planarKs/  R' zz4*6**rFNrenormalcheckrOPath2DcRURn[U5S:Xa [5[R"S54$UR R SnUS:Xa[R"S5nOUS:wa[SUS35eUc[UR U5upgUb_[R"U[RS 9RS5nU[R"[R"Xr55-n[XgS 9n[R"U[RS 9nUR S :wa [S 5eUS:Xaz[R "UR U5nXSS2S4n [R""U 5[$R&:aS n U(a [S5eO3U R)5n O"US:XaUR R+5nS n [R,R/U5n [R0"W 5[$R&:a/[R2"SSU /5n [R"X5n [5UR65n XS'[[5UR85WSS2SS24U SS9nX4$)aR Check to see if current vectors are all coplanar. If they are, return a Path2D and a transform which will transform the 2D representation back into 3 dimensions Parameters ----------- to_2D : (4, 4) float Homogeneous transformation matrix to apply, if not passed a plane will be fitted to vertices. normal : (3,) float or None Normal of direction of plane to use. check Raise a ValueError if points aren't coplanar. Returns ----------- planar Current path transformed onto plane to_3D : (4, 4) float Homeogenous transformations to move planar back into the original 3D frame. rr rrzvertices are `zD != 2D | 3D`!Nrm)originri)rmrmzunable to create transform!gzpoints are not flat!to_3DFr:)r)rKrkr_rr3rJrgrr`rrsigndotrrrrrplanarrrHlinalginvrrrr4r2)rArerirj referenceddimrNflatheightsheightroadjustr4rrs rCre Path3D.to_2DVs/>-- z?a 8RVVAY& &mm!!!$ !8FF1IE AX~cU.AB B =T]]:67DA!& ;CCAFRWWRVVA.//#17Ebjj1 ;;& :; ; !8&&t}}eCJJ &**Aq&>:FFF5)EDMM*!dmm,!RaR%[  }rFc[R"[R"UR5UR /45$)z- Return a simple identifier for the 3D path. )r_r*ridentifier_simple convex_hullrrLs rCrPath3D.identifiers4 ~~  ) )$*:*: ;dkk] K  rFc\[R"URUR5$)z{ Return a convex hull of the 3D path. Returns -------- hull : trimesh.Trimesh A mesh of the convex hull of the 3D path. )r rr3r)rLs rCrPath3D.convex_hulls$!!$--0H0H"IJJrFc FUR5nUR"S0UD6$)z! Show the current Path3D object. rW)rLshow)rArBrLs rCr Path3D.shows! zz#F##rFrW)NNT)rIrUrVrWrXrgrrr rrrrerrrrr[rWrFrCr]r]Fs +&*&* j "j#j j x)) * jX GG,   K K$rFr]c\rSrSrSrS!SjrSrSr\S5r \S"Sj5r S#S jr S r \ S 5rS$S jr\S\4Sj5r\S\4Sj5r\S5rSrSrS%SjrS&SjrSrS'SjrSrS(SjrS)Sjr\ S5r\ S5r\S\\ RB4Sj5r"\S5r#\S5r$\S5r%S r&g )*rkir^chUR(aURSUS9 gURSUS9 g)z2 Plot the current Path2D object using matplotlib. T)r annotationsN)r plot_discrete plot_entities)rArs rCr Path2D.shows1 >>   Dk  B   Dk  BrFc@URnURU5 U$)z Transform the current path so that its OBB is axis aligned and OBB center is at the origin. Returns ----------- obb : (3, 3) float Homogeneous transformation matrix )obbrrs rC apply_obbPath2D.apply_obbs  V$ rFcv[R"S5nUSS2SS24==U-ss'URU5$)zz Apply a 2D scale to the current Path2D. Parameters ------------- scale : float or (2,) float Scale to apply in-place. rNr)r_rr)rArrs rC apply_scalePath2D.apply_scales<rr2A2v%##F++rFcf[R"URUR5SnU$)z Get a transform that centers and aligns the OBB of the referenced vertices with the XY axis. Returns ----------- obb : (3, 3) float Homogeneous transformation matrix r)roriented_bounds_2Dr3r)rs rCr Path2D.obbs.**4==9Q9Q+RSTUV rFrOc zSSKJn SSKJn URUR /nUR UR5 [R"U5n[U5S:a [5$U"U5n[R"[UR 55n[R"[UR55XTR'XTR"nUR URn[S 0U"XgS 9D6$![a" [R"SSS9 [5s$f=f) zr Return a convex hull of the 2D path. Returns -------- hull A convex hull of included vertices from this path. r) ConvexHullr  edges_to_pathrzFailed to construct convex hullTr;edgesr3rW) scipy.spatialr exchange.miscrr3r)rrr_rrKrkrDrrCrr simplices)rArr candidateshullremaprr3s rCrPath2D.convex_hulls -0mmD$<$<=>  $--(YYz*  z?Q 8O j)D #dkk*+!yyT]]);<mmnn%;;t}}-F EEFF  II7$ G8O  s2D)D:9D:Nc 8[R"UUUUUUS9nU$)a Rasterize a Path2D object into a boolean image ("mode 1"). Parameters ------------ pitch : float or (2,) float Length(s) in model space of pixel edges origin : (2,) float Origin position in model space resolution : (2,) int Resolution in pixel space fill : bool If True will return closed regions as filled width : int If not None will draw outline this wide (pixels) Returns ------------ raster : PIL.Image object, mode 1 Rasterized version of closed regions. )pitchrn resolutionfillwidth)r" rasterize)rArrnrrrrBimages rCrPath2D.rasterizeDs-0  !   rFc LURn[U5S:Xa[R"/5nU$[U5S:Xa[R "US4SU0UD6nU$[ R"UVs/sHn[R "U4SU0UD6PM sn5nU$s snf)a Use rejection sampling to generate random points inside a polygon. Parameters ----------- count : int Number of points to return If there are multiple bodies, there will be up to count * bodies points returned factor : float How many points to test per loop IE, count * factor max_iter : int, Maximum number of intersection loops to run, total points sampled is count * factor * max_iter Returns ----------- hit : (n, 2) float Random points inside polygon rr count) polygons_fullrKr_r`r,sampler vstack_empty)rArrBpolysamplesrs rCr Path2D.samplefs2!! t9>hhrlGY!^ood1gEUEfEG  ''DHIDq:%:6:DIGJs5#B!c,[UR5$)z Returns a count of the number of unconnected polygons that may contain other curves but aren't contained themselves. Returns --------- body_count : int Number of unconnected independent polygons. )rKrrLs rC body_countPath2D.body_counts499~rFcUcSUR;aURSn[R"[UR5[R "[ UR5545nUb[R"X!5n[[UR5U[UR5S9nU$)a Convert 2D path to 3D path on the XY plane. Parameters ------------- transform : (4, 4) float If passed, will transform vertices. If not passed and 'to_3D' is in self.metadata that transform will be used. Returns ----------- path_3D : Path3D 3D version of current path ro)r2r3r4) r4r_ column_stackrr3zerosrKrrr]r2)rArr3path_3Ds rCro Path2D.to_3Ds"  DMM!9 g.I?? dmm $bhhs4==/A&B C   **8?Hdmm,dmm,  rFcB[R"UR5$)a@ Cycles in the vertex graph, as shapely.geometry.Polygons. These are polygon objects for every closed circuit, with no notion of whether a polygon is a hole or an area. Every polygon in this list will have an exterior, but NO interiors. Returns --------- polygons_closed : (n,) list of shapely.geometry.Polygon objects )r,paths_to_polygonsrrLs rCpolygons_closedPath2D.polygons_closeds))$--88rFcS/[UR5-nURnURn[ UR5HupEX%R 5Vs/sHocUPM nnUVs/sH3n[ R"URR5SSS2PM5 n nX5Rn [R"[XS95X'M U$s snfs snf)z A list of shapely.geometry.Polygon objects with interiors created by checking which closed polygons enclose which other polygons. Returns --------- full : (len(self.root),) shapely.geometry.Polygon Polygons containing interiors Nr)shellholes) rKrrrr r>r_r`exteriorcoordsr,repair_invalidr.) rAfullrrrrchildchildrenprrs rCrPath2D.polygons_fullsvDII&++ %%!+GA4=?3G3G3IJ3I%u 3IHJ@HI1RXXajj//026EIL))E--gE.OPDG, KIs C#4:C(cP[[SUR555nU$)zt Return the area of the polygons interior. Returns --------- area : float Total area of polygons minus interiors c38# UHoRv M g7frV)arears rCrZPath2D.area..s<);A);s)rrr)rArs rCr Path2D.areas$S<););<<= rFc SSKJn URVs/sH oC"SXAS.UD6PM nn[U5S:XaUS$U$s snf)a Extrude the current 2D path into a 3D mesh. Parameters ---------- height: float, how far to extrude the profile kwargs: passed directly to meshpy.triangle.build: triangle.build(mesh_info, verbose=False, refinement_func=None, attributes=False, volume_constraints=True, max_volume=None, allow_boundary_steiner=True, allow_volume_steiner=True, quality_meshing=True, generate_edges=None, generate_faces=False, min_angle=None) Returns -------- mesh: trimesh object representing extruded polygon r) Extrusion)polygonrzr rrW) primitivesrrrK)rArzrBrrresults rCextrudePath2D.extrudes]0 +DHCUCU CUaI 9a 9& 9CU   v;! !9   sAc SSKJn /n/nURH0nU"U40UD6upgURU5 URU5 M2 [R "X45$)a Create a region- aware triangulation of the 2D path. Parameters ------------- **kwargs : dict Passed to `trimesh.creation.triangulate_polygon` Returns ------------- vertices : (n, 2) float 2D vertices of triangulation faces : (n, 3) int Indexes of vertices for triangles r)triangulate_polygon)r!rrappendr append_faces)rArBrv_seqf_seqrvfs rC triangulatePath2D.triangulates_ 3))G&w9&9DA LLO LLO*   ..rFc  UcURS- nSSKJn URVs/sHn[R "XAU5PM nnUVVs/sHupg[ S0U"XgS9D6PM nnn[U5n U $s snfs snnf)ae Find the approximate medial axis based on a voronoi diagram of evenly spaced points on the boundary of the polygon. Parameters ---------- resolution : None or float Distance between each sample on the polygon boundary clip : None, or (2,) float Min, max number of samples Returns ---------- medial : Path2D object Contains only medial axis of Path g@@r rrrW)rrrrr, medial_axisrkr*) rArcliprr edge_vertrbrmedialsmedials rCrPath2D.medial_axis6s$  f,J 1@D?Q?Q ?Q!H  5?Q  MVVIDA6?M>?IVW%  Ws !A:A?cD[UR5S:Xa*[R"[UR55nO*[ [ R"URU55nU(a[R"U5$[R"X1/5$)a& Given an index of self.paths find other paths which overlap with that path. Parameters ----------- path_id : int Index of self.paths include_self : bool Should the result include path_id or not Returns ----------- path_ids : (n, ) int Indexes of self.paths that overlap input path_id r ) rKrr_rrr=nxnode_connected_componentrr`r)rApath_id include_selfpath_idss rCconnected_pathsPath2D.connected_pathsZsk" tyy>Q yyT%9%9!:;HB77PQH 88H% %||Hi00rFc 0[R"U40UD6$)z Return a version of the current path with colinear segments merged, and circles entities replacing segmented circular paths. Returns --------- simplified : Path2D object )r$simplify_basicrArBs rCr$Path2D.simplifyss&&t6v66rFc,[R"XUS9$)z Convert paths into b-splines. Parameters ----------- smooth : float How much the spline should smooth the curve verbose : bool Print detailed log messages Returns ------------ simplified : Path2D Discrete curves replaced with splines )smoothverbose)r$simplify_spline)rArrs rCrPath2D.simplify_spline~s ''WMMrFc .[R"U5$)z If the current Path2D consists of n 'root' curves, split them into a list of n Path2D objects Returns ---------- split: (n,) list of Path2D objects Each connected region and interiors )r%splitrs rCr Path2D.splitst$$rFcSSKJn UR5nURSS5 [ UR 5H4upVSS/XPR ;nUR"URSU06 M6 U(aAURH1n[US5(dMURUR5 M3 U(aUR5 U$) z% Plot the closed curves of the path. rNequaldatalimgrGr]plot) matplotlib.pyplotpyplotgca set_aspectr rrrTr2hasattrr3r) rArrpltrrrr]rbs rCrPath2D.plot_discretes (wwy +"4==1IA#JqII~.E IIvxx -u -2 ]]q&))t}}%#  HHJ rFc SSKJn UR5nURSS5 SSS.SSS.S SS.S SS.S SS.S SS.S SS.S SS.S .nURHnU(a.[ US5(aUR UR5 M8URUR5nURR[[UR55-n XiR5n UbX:S'O [ US5(aURU S'UR "UR 0U D6 M U(aUR#5 gg)a Plot the entities of the path with no notion of topology. Parameters ------------ show : bool Open a window immediately or not annotations : bool Call an entities custom plot function. color : str Override entity colors and make them all this color. rNrrrr )r] linewidthyrbrGm)Line0Line1Arc0Arc1Bezier0Bezier1BSpline0BSpline1rr])rrrrr2rrr3r __class__rIrAintrrHr]rr) rArrr]rreformatrre_keyfmts rCrPath2D.plot_entitiess2 (wwy + #3"3!2!2!$15!$15"%A6"%A6  mmFwvv66 DMM*t}}5H$$--C 4F0GGE.%%'C $G ))%||G IIxzz )S )#$$  HHJ rFc,[RnURn[U5S:XaU"URS5$[U5S:Xa[R "S5$[R "UVs/sH o1"U5PM snSS9$s snf)zb A unique identifier for the path. Returns --------- identifier : (5,) float Unique identifier r rr)r,rrrKr_rr)rAhashertargetrs rCrPath2D.identifiers}$$## v;! $,,Q/0 0 [A 88A; vv&1&Qvay&1::1s:Bcv[R"URVs/sHoSLPM sn[S9$s snf)zt Returns ---------- path_valid : (n,) bool Indexes of self.paths self.polygons_closed which are valid polygons. Nrm)r_r`rr )rArs rCrPath2D.path_valids1xx0D0DE0D1$0DETRREs 6c8URnURS$)z Which indexes of self.paths/self.polygons_closed are root curves, also known as 'shell' or 'exterior. Returns --------- root : (n,) int List of indexes r)rr?)rApopulates rCr Path2D.roots**{{6""rFcUR URR5nSSS5 U$!,(df  W$=f)z Undirected graph object of polygon enclosure. Returns ----------- enclosure : networkx.Graph Enclosure graph of self.polygons by index. N)r?r to_undirected)rA undirecteds rCrPath2D.enclosures8[[00>>@J[s 2 Acf[R"UR5upXRS'U$)z Directed graph of polygon enclosure. Returns ---------- enclosure_directed : networkx.DiGraph Directed graph: child nodes are fully contained by their parent node. r)r,enclosure_treerr?)rArrs rCrPath2D.enclosure_directeds.#11$2F2FG" FrFc URVs/sHoURUSS94PM nn[R"U5$s snf)z A dictionary of path indexes which are 'shell' paths, and values of 'hole' paths. Returns ---------- corresponding : dict {index of self.paths of shell : [indexes of holes]} F)r)rr collections OrderedDict)rAr pairss rCrPath2D.enclosure_shell-sHLP99U9aT))!%)@A9U&&u--VsArW)T)rOrk)NNNTNrVrTrS)g-C6*?F)FT)FTN)'rIrUrVrWrXrrrrrrrrrYrrorrrrrrrrrr$rrrrrrr_rrrrrr[rWrFrCrkrkstC  ,  +G+G\JN D#J   D 9 9 9t>  B/<"H12 7N$ %.0d;;"SS #gbhh' # #     . .rFrk)DrXr.rbrHrhashlibrnumpyr_rrrr r r r r rrrr constantsrrrgeometryrrrtypedrrrrrrrrrrvisualrr!r"r#r$r%r2r&exchange.exportr(r*r+rDEExceptionWrapperr,rr-shapely.geometryr.networkxrGeometryr0r]rkrWrFrCr?sf   %%'&   ( ,.-%-(( p 6??p fV$TV$r[ .T[ .C,  ( ( +F,.**1-H.-))!,G--))!,G- (  $ $Q 'B(sxC D"D*)E0E4 D&C==DD' D""D'*E 0EE E1E,,E14F:FF