h SSKJr SSKJrJrJrJrJr SSKJ r SSK r SSK r SSK J r JrJrJrJrJrJrJr SSKJrJr /SQr"SS \ 5rS.S jr"S S 5r"S S5r"SS5rS/SjrS0Sjr\4S1Sjjr "SS\5r!\4S2Sjjr"S3Sjr#"SS5r$"SS\%5r&"SS5r'S4Sjr(S5Sjr)S r*\4S6S!jjr+"S"S#\ RX5r-S7S$jr.S7S%jr/S7S&jr0S8S'jr1S(r2S)r3S*r4S+r5"S,S-5r6g)9) annotations)IterableSequenceOptionalIteratorCallable)ProtocolN)Vec2UVecintersection_line_line_2dis_point_in_polygon_2dhas_clockwise_orientationpoint_to_line_relation TOLERANCE BoundingBox2d)take2pairwise) greiner_hormann_uniongreiner_hormann_differencegreiner_hormann_intersectionClippingConvexClippingPolygon2dConcaveClippingPolygon2dClippingRect2dInvertedClippingPolygon2dCohenSutherlandLineClipping2dc<\rSrSrSSjrS SjrS SjrS SjrSrg) r#cg)z)Returns the parts of the clipped polygon.Nselfpolygons E/var/www/html/env/lib/python3.13/site-packages/ezdxf/math/clipping.py clip_polygonClipping.clip_polygon$cg)*Returns the parts of the clipped polyline.Nr r"polylines r$ clip_polylineClipping.clip_polyline'r'r(cg)&Returns the parts of the clipped line.Nr )r"startends r$ clip_lineClipping.clip_line*r'r(cg)z8Returns ``True`` if `point` is inside the clipping path.Nr r"points r$ is_insideClipping.is_inside-r'r(r Nr#Sequence[Vec2]returnSequence[Sequence[Vec2]]r,r;r<r=r1r r2r r<zSequence[tuple[Vec2, Vec2]]r7r r<bool) __name__ __module__ __qualname____firstlineno__r%r-r3r8__static_attributes__r r(r$rr#s895Gr(rcl[U5S:a/$/n/nUSnUSSHxnUnUnU"Xv5Hen[U5S:waMU(a?UupUSRXS9(aURU 5 MIURU5 [U5nMg Mz U(aURU5 U$)r*rNabs_tol)leniscloseappendlist) r, line_clipperrLresultparts next_startr2r1 clipped_line clip_startclip_ends r$_clip_polylinerX1s  8}q F E!J| (4L< A%'3$ ":%%j%BMM(+ V$,'F5 V Lr(cR\rSrSrSrS\4S SjjrS SjrS SjrSSjr SSjr S r g )rNz4The clipping path is an arbitrary convex 2D polygon.Tc<X0l[U5n[U5S:a5USRUSURS9(aUR 5 [U5S:a [ S5eU(a [ U5(aUR5 X@lgNrIrrJrK1more than 3 vertices as clipping polygon required) rLrPrMrNpop ValueErrorrreverse_clipping_polygon)r"vertices ccw_checkrLclips r$__init__ ConvexClippingPolygon2d.__init__Qst H~ t9q=AwtBx> t9q=PQ Q 2488 LLN-1r(c>[XRURS9$)r*rKrXr3rLr+s r$r-%ConvexClippingPolygon2d.clip_polyline]sh MMr(c4^^^^^SUU4SjjnSUUUUU4SjjnTRSmUmUmTRHWmU"T5(aU"T5(dU"T5mO/U"T5(aU"T5(dU"T5mO [5s $TmMY TT44$)r0c>TRTR- URTR- -TRTR- URTR- -- S:$Nxyr7rWrVs r$r84ConvexClippingPolygon2d.clip_line..is_insideds]JJ-%''JLL2HI Z\\):<<'M)),/0 0r(cD>[TT4TT4TRS9nUcU$U$NrK)r rL)defaultiprWrVedge_end edge_startr"s r$edge_intersection.edge_intersectionjs3*X&X(> BzIr(rJr@)rvr r<r )rbtuple) r"r1r2r8rzrWrVrxrys ` @@@@r$r3!ConvexClippingPolygon2d.clip_lineas 0 0   ++B/  ..H$$ **0:H8$$ ,,!2:!>Jw!J/X&((r(c*^^^^^^ SUU4SjjnSUUUUU U4SjjnTRSm[U5mTRHmT(d T4$TR5n[U5S:a5USR USTR S9(aUR 5 TR5 USm UHLmU"T5(a&U"T 5(dU"5 TRT5 OU"T 5(aU"5 Tm MN TmM T4$) IReturns the parts of the clipped polygon. A polygon is a closed polyline.c>TRTR- URTR- -TRTR- URTR- -- S:$rmrorrs r$r87ConvexClippingPolygon2d.clip_polygon..is_insides]JJ-%''JLL2HI Z\\):<<'M))+./ /r(cb>[TT4TT4TRS9nUbTRU5 ggru)r rLrO)rwrWrVclippedrxryr"s r$rz?ConvexClippingPolygon2d.clip_polygon..edge_intersections:*X&X(> B~r"r(rJrIrrKr@)r<None) rbrPcopyrMrNrLr_clearrO) r"r#r8rzrcrWrVrrxrys ` @@@@@r$r%$ConvexClippingPolygon2d.clip_polygons / /  # #++B/ w-..H(z%||~H8}q Xa[%8%8 dll&9&  MMO!"J$X&&$Z00)+NN8,z**%'% %"J-/.zr(c2[XR5S:$);Returns ``True`` if `point` is inside the clipping polygon.rr rbr6s r$r8!ConvexClippingPolygon2d.is_insides%e-C-CDIIr()rbrLNrcIterable[Vec2]r>r?r:r@) rBrCrDrE__doc__rrfr-r3r%r8rFr r(r$rrNs'>;? 2N)B*XJr(rcZ\rSrSrSr\4S SjjrS SjrS SjrSSjr SSjr SSjr S r g )rzcThe clipping path is an axis-aligned rectangle, where all sides are parallel to the x- and y-axis. c X0l[X45UlURRnURRn[ U[ URUR5U[ URUR5/SURS9Ul [URRURR5Ul g)NF)rdrL) rLr_bboxextminextmaxrr rprqrbr _line_clipper)r" bottom_left top_rightrLs r$rfClippingRect2d.__init__s "K#;< jj'' JJ%% !8Y[[+--0[]]IKK0   LL " ; JJ  tzz00 r(c8URRU5$)r)rbr%r!s r$r%ClippingRect2d.clip_polygons%%227;;r(cB[XRUR5$)r*rir+s r$r-ClippingRect2d.clip_polylinesh EEr(cpURRX5n[U5S:XaU4$[5$)Returns the clipped line.rH)rr3rMr|)r"r1r2rRs r$r3ClippingRect2d.clip_lines3##--e9 v;! 9 wr(c8URRU5$)z=Returns ``True`` if `point` is inside the clipping rectangle.)rinsider6s r$r8ClippingRect2d.is_insideszz  ''r(c8URRU5$)zKReturns ``True`` if `other` bounding box intersects the clipping rectangle.)rhas_intersection)r"others r$rClippingRect2d.has_intersectionszz**511r()rrbrrLN)rr rr r:r>r?r@)rrr<rA) rBrCrDrErrrfr%r-r3r8rrFr r(r$rrs-DM &<F(2r(rcP\rSrSrSr\4S SjjrS SjrS SjrS Sjr SSjr Sr g )rz5The clipping path is an arbitrary concave 2D polygon.cX l[U5n[U5S:a5USRUSURS9(aUR 5 [U5S:a [ S5eX0l[U5Ulgr\) rLrPrMrNr_r`rbrr)r"rcrLres r$rf!ConcaveClippingPolygon2d.__init__si H~ t9q=AwtBx> t9q=PQ Q!%"4( r(cURRU5(dg[XRURS9S:$)rFrKr)rrr rbrLr6s r$r8"ConcaveClippingPolygon2d.is_insides;zz  '' "5*@*@$,, W  r(c0URnX4nURR[U55(d [ 5$[ UR U5n[XR 5S:n[U5S:XaU(aU4$[ 5$[X R US9S:nU(a(USRX#S9(dURU5 U(a)USRXS9(dURSU5 [U5S:a,USRUSUS9(aURS5 [U5S:a+USRUSUS9(aUR5 [UR X5(aj/n[U5HWupU RXS9(aM[U RU 5UR US9S:dMEURX45 MY U$[![#U55$)rrrKrJrI)rLr has_overlaprr|polygon_line_intersections_2drbr rMrNrOinsertr_has_collinear_edgerlerprPr) r"r1r2rLline intersectionsstart_is_inside end_is_insidesegmentsabs r$r3"ConcaveClippingPolygon2d.clip_lines,,|zz%%mD&9::7N5d6L6LdS 08N8NOSTT }  "w7N "3(>(> PTU U  r!2!:!:3!:!P   % =#3#;#;E#;#S  E * }  !mA&6&>&> ! g'?'    a }  !mB&7&?&? " w'@'      d44e A A13H /99Q90*q 4#9#97 OOQF+0O E-())r(cURn/n[U5HgupEURXE5HMupgU(a/USnUSRXbS9(aUR U5 M;UR Xg/5 MO Mi U$)r*rJrK)rLrr3rNrO) r"r,rLrr1r2rrlast_segs r$r-&ConcaveClippingPolygon2d.clip_polyline6s{,,%'"8,JEu2'|H|++A+? * ' 3-r(c^^[U5nTRm[U5S:a+USRUSTS9(aUR 5 [U5S:a [ 5$[ U5nTRRU5(d [ 5$[TRU5n[U5S:Xa*[UU4SjU55nU(a [ 5$U4$U$)rrIrrJrKr]c3T># UHn[UTRTS9S:v M g7f)rKrNr).0vrLr"s r$ 8ConcaveClippingPolygon2d.clip_polygon..Rs-!A'q$*@*@'RUVV!s%() rPrLrMrNr_r|rrrclip_arbitrary_polygonsrbany)r"r#rc polygon_boxrR is_outsiderLs` @r$r%%ConcaveClippingPolygon2d.clip_polygonDs=,, x=1 {""8B<"A  x=1 7N#H- zz**;777N()?)?J v;! !Jw;  r(rrbrLNrr@r?r>r:) rBrCrDrErrrfr8r3r-r%rFr r(r$rrs"?9B ) 9*v r(rcx[RU5n[RU5nURU5$)zReturns the parts of the clipped subject. Both polygons can be concave Args: clipper: clipping window closed polygon subject: closed polygon to clip ) GHPolygon from_vec2 intersection)clippersubject gh_clipper gh_subjects r$rr]s5$$W-J$$W-J  " ": ..r(ctUSn[X1U5nUH!n[XQU5nUS:XaUS:Xa gUnUnM# g)zJReturns ``True`` if `polygon` has any collinear edge to line `start->end`.rJrTF)r)r#r1r2rrel_arrel_bs r$rrmsL A "1S 1E &q5 A:%1*   r(c^/nUumn[U5n[U5HnXS- nXn[Xx4USUS9n U cM U RXrS9(a%XS- n [ U TXBS9n [ UTXBS9n X:XaMXO;U RXS9(a'XS-U-n [ UTXBS9n [ U TXBS9n X:XaMUR U 5 M UR U4SjS9 U$)a>Returns all intersections of polygon with line. All intersections points are ordered from start to end of line. Start and end points are not included if not explicit intersection points. .. Note:: Returns duplicate intersections points when the line intersects at the connection point of two polygon edges! rIF)virtualrLrKrHc&>URT5$N)distance)rwr1s r$/polygon_line_intersections_2d..sBKK,>r()key)rMranger rNrrOsort)r#rrLintersection_pointsr2sizeindexrrrwa_prevrel_prevrel_nextb_nextr1s @r$rrzs ')JE3 w? r(c.\rSrSrSr\4SSjjrSrg)riaThis class represents an inverted clipping path. Everything between the inner polygon and the outer extents is considered as inside. The inner clipping path is an arbitrary 2D polygon. .. Important:: The `outer_bounds` must be larger than the content to clip to work correctly. cX0l[U5n[U5S:a/USRUSUS9(dUR US5 [U5S:a [ S5e[ XBU5UlX lg)NrIrrJrKr^) rLrPrMrNrOr`make_inverted_clipping_polygonrbr)r" inner_polygon outer_boundsrLres r$rf"InvertedClippingPolygon2d.__init__sy  M" t9q=7??48W?= DG$ t9q=PQ Q "@ " " r(rN)rrrr)rBrCrDrErrrfrFr r(r$rrs( "%"$""r(rcURSLdeUR5nUSRUSUS9(aUR5 [ U5S:de[ UR 55nUR5 [X5upEXSnURUSUS-5 URX5S5 URUSUS-5 URUS5 U$)zCreates a closed inverted clipping polygon by connecting the inner polygon with the surrounding rectangle at their closest vertices. TrrJrKrHNrI) has_datarrNr_rMrP rect_verticesrafind_closest_verticesextendrO)rrrL outer_rectcicorRs r$rrs  D (( (!&&(MQ b 17C }  !! !l0023J "= =FB 3 F MM-"q&)* MM*S/" MM*XrAv&' MM&) Mr(c[RnSn[U5H6upE[U5H"upgURU5nX:dMUnXF4nM$ M8 U$)z:Returns the indices of the closest vertices of both lists.)rr)mathinf enumerater) vertices0 vertices1min_distrRi0v0i1v1rs r$rrsZxxH"FI& *FB{{2H"# +' Mr(c6\rSrSrSSSjjrSrSrg)_NodeicjXlSUlSUlSUlX@lX lX0lXPlgr)vtxnextprevneighborentryalpha intersectchecked)r"rr r r r s r$rf_Node.__init__s@     $ ! "  )% r(cSUlUR(a7URR(dURR5 gggNT)r r set_checked)r"s r$r_Node.set_checkeds3 ==!6!6 MM % % '"7=r()r r r r rrrrN)rnFTF)rr r float)rBrCrDrErfrrFr r(r$rrs, % %%>(r(rc\rSrSrSrg)IntersectionErrorir N)rBrCrDrErFr r(r$rrsr(rc\rSrSr%SrS\S'SrS\S'SSjr\SS j5r \SS j5r \SS j5r SS jr \ SS j5r\ SSj5rSrSSjrSSjrSSjrSSjrSrg)riNrfirstg.Armax_xc*[URURR5UlURc'XlXRlXRlgURnUR nXlX!lX1lXlg)zAdd a polygon vertex node.N)maxrrrprrr)r"noderlasts r$add GHPolygon.add seTXXZZ0 :: J"JJO"JJOJJE::DJIIIr(cT[R[R"U55$z3Build a new GHPolygon from an iterable of vertices.)rrr rP)rcs r$buildGHPolygon.build0s""499X#677r(c`[5nUHnUR[U55 M U$r)rrr)rcr#rs r$rGHPolygon.from_vec25s*+A KKa !r(cUnX2:waGURUR:a-URnX2:waURUR:aM-X0lURnX@lXlXlg)aInsert and sort an intersection node. This function inserts an intersection node between two other start- and end node of an edge. The start and end node cannot be an intersection node (that is, they must be actual vertex nodes of the original polygon). If there are multiple intersection nodes between the start- and end node, then the new node is inserted based on its alpha value. N)r rr)vertexr1r2currrs r$rGHPolygon.insert=s[kdjj6<<799Dkdjj6<<7 yy   r(c## URceURnUv URnXRLagM!7fr)rr)r"ss r$__iter__GHPolygon.__iter__Rs@zz%%% JJGAJJ s>AcfUH+nUR(dMUR(aM)Us $ grr r r"rs r$first_intersectGHPolygon.first_intersect[s'A{{{1999r(cUVs/sHoRPM nnUSRUS5(dURUS5 U$s snf)NrrJ)rrNrO)r"rpointss r$r2GHPolygon.pointsbsK!%&A%%&ay  ,, MM&) $ 'sAcbUH)nUR(dMUR(aM) g g)NTFr-r.s r$ unprocessedGHPolygon.unprocessedis%A{{{1999r(c(URUSS5$)NFrer"res r$unionGHPolygon.unionosyyue,,r(c(URUSS5$rr8r9s r$rGHPolygon.intersectionrsyytT**r(c(URUSS5$)NFTr8r9s r$ differenceGHPolygon.differenceusyyud++r(c rUGHnUR(aMUHnUR(aM[UR[UR5RUR[UR5R5upgnUcMz[ XgSSS9n [ XhSSS9n XlXlURU U[UR55 URU U[UR55 M GM U[URRU5-nUH#nUR(dMX$l U(+nM% U[URRU5-nUH#nUR(dMX5l U(+nM% /n UR5(aURn U R/n U R5 U R(a<U Rn U RU R5 U R(aO>M;U Rn U RU R5 U R(aOM;U R n U R (aOMU RU 5 UR5(aMU $)aClip this polygon using another one as a clipper. This is where the algorithm is executed. It allows you to make a UNION, INTERSECT or DIFFERENCE operation between two polygons. Given two polygons A, B the following operations may be performed: A|B ... A OR B (Union of A and B) A&B ... A AND B (Intersection of A and B) A\B ... A - B B\A ... B - A The entry records store the direction the algorithm should take when it arrives at that entry point in an intersection. Depending on the operation requested, the direction is set as follows for entry points (f=forward, b=backward; exit points are always set to the opposite): Entry A B ----- A|B b b A&B f f A\B b f B\A f b f = True, b = False when stored in the entry record TF)r r )r line_intersectionrnext_vertex_noderrrris_inside_polygonrr r5r/rrOrr )r"res_entryc_entrysubject_vertexclipper_vertexrwusuc subject_node clipper_nodeclipped_polygonscurrentrs r$reGHPolygon.clipysN:#N!+++&*N)333%6*..,^-@-@AEE*..,^-@-@AEE &  :$',Rt5'Q ',Rt5'Q 0<-0<- (*,^-@-@A  (*,^-@-@A)'+#: $TZZ^^T::"N''''.$%+# $TZZ^^T::"N''''.$%+# .0  !11G#*;;-G##%=="),,w{{3",,!  "),,w{{3",,!  "**??#$  # #G ,+  , r()rr)rr)rcIterable[UVec]r<r)rcr;r<r)r%rr1rr2r)r<zIterator[_Node])r<zOptional[_Node])r< list[Vec2])rerr<list[list[Vec2]])rBrCrDrEr__annotations__rr staticmethodr rrr*propertyr/r2r5r:rr?rerFr r(r$rrsE5E5 88(   -+,^ r(rcjUnUR(aURnUR(aMU$)z@Return the next non-intersecting vertex after the one specified.)r r)rcs r$rCrCs' A ++ FF +++ Hr(c8[XR[S9S:$)z2Returns ``True`` if `vertex` is inside `polygon`.rKr)r r2r)r%r#s r$rDrDs "&..) LPQ QQr()NrrcURUR- URUR- -URUR- URUR- -- n[U5U:a[$URUR- URUR- -URUR- URUR- -- U- nSU-nSU- nXvs=:a U:d[$ [$URUR- URUR- -URUR- URUR- -- U- n Xys=:aU:acO [$[ URXaRUR- --URXaRUR- --5UU 4$[$)zReturns the intersection point between two lines. This special implementation excludes the line end points as intersection points! Algorithm based on: http://paulbourke.net/geometry/lineline2d/ rng?)rqrpabs_ERRORr ) s1s2c1c2toldenrIlwruprrJs r$rBrBsy 44"$$;244"$$; '244"$$;244"$$;*G GC 3x#~ 44"$$;244"$$; '244"$$;244"$$;*G G3 NB )C )C NsN   44"$$;244"$$; '244"$$;244"$$;*G G3 NB ~#~ M ddRTTk**BDD23E,E F    Mr(c \rSrSrSrSrSrSrg)BooleanOperationi r:r?rr N)rBrCrDrEUNION DIFFERENCE INTERSECTIONrFr r(r$rere s EJ!Lr(rec6[X[R5$)zReturns the INTERSECTION of polygon `p1` & polygon `p2`. This algorithm works only for polygons with real intersection points and line end points on face edges are not considered as such intersection points! )greiner_hormannrerhp1p2s r$rrs 2#3#@#@ AAr(c6[X[R5$)zReturns the DIFFERENCE of polygon `p1` - polygon `p2`. This algorithm works only for polygons with real intersection points and line end points on face edges are not considered as such intersection points! )rjrergrks r$rrs 2#3#>#> ??r(c6[X[R5$)zReturns the UNION of polygon `p1` | polygon `p2`. This algorithm works only for polygons with real intersection points and line end points on face edges are not considered as such intersection points! )rjrerfrks r$rr)s 2#3#9#9 ::r(cP[RU5n[RU5nU[R:XaUR U5$U[R :XaUR U5$U[R:XaURU5$[SU35e)uImplements a 2d clipping function to perform 3 boolean operations: - UNION: p1 | p2 ... p1 OR p2 - INTERSECTION: p1 & p2 ... p1 AND p2 - DIFFERENCE: p1 \ p2 ... p1 - p2 Based on the paper "Efficient Clipping of Arbitrary Polygons" by Günther Greiner and Kai Hormann. This algorithm works only for polygons with real intersection points and line end points on face edges are not considered as such intersection points! z*unknown or unsupported boolean operation: ) rr rerfr:rgr?rhrr`)rlrmoppolygon1polygon2s r$rjrj3s r"Hr"H  # ##~~h'' ** *""8,, ,, ,$$X.. A"F GGr(rIrHrc:\rSrSrSrSrS SjrS SjrS SjrSr g) riUzCohen-Sutherland 2D line clipping algorithm, source: https://en.wikipedia.org/wiki/Cohen%E2%80%93Sutherland_algorithm Args: w_min: bottom-left corner of the clipping rectangle w_max: top-right corner of the clipping rectangle )x_minx_maxy_miny_maxc@UuUlUlUuUlUlgr)rvrxrwry)r"w_minw_maxs r$rf&CohenSutherlandLineClipping2d.__init__as!& DJ!& DJr(cSnXR:a U[-nOXR:a U[-nX R:a U[ -nU$X R :a U[-nU$)Nr)rvLEFTrwRIGHTrxBOTTOMryTOP)r"rprqcodes r$encode$CohenSutherlandLineClipping2d.encodees] zz> DLD ^ EMD zz> FND ^ CKD r(cUup4UupVURX45nURXV5nUn Un Xx-(d[X45[XV54$Xx-(a [5$X:aUOUn U [-(a)X5U- URU- -Xd- - -n URn OU [ -(a)X5U- UR U- -Xd- - -n UR n OmU [-(a)XFU- URU- -XS- - -n URn O6U [-(a(XFU- URU- -XS- - -n URn X:XaU nU nURX45nOU nU nURXV5nGMI)zReturns the clipped line part as tuple[Vec2, Vec2] or an empty tuple. Args: p0: start-point of the line to clip p1: end-point of the line to clip ) rr r|rryrrxrrwrrv) r"p0rlx0y0x1y1code0code1rprqrs r$r3'CohenSutherlandLineClipping2d.clip_lineqsm B# B#  =B|T"\11}w "M5uDczr'djj2o6"'BBJJr'djj2o6"'BBJJr'djj2o6"'BBJJr'djj2o6"'BBJJ} B+ B+Wr()rwrvryrxN)r{r r|r r<r)rprrqrr<int)rr rlr r<r;) rBrCrDrEr __slots__rfrr3rFr r(r$rrUs5I' 9,r(r)r,r;rQz3Callable[[Vec2, Vec2], Sequence[tuple[Vec2, Vec2]]]rLrr<r=)rrQrrQr<r=)r#rQr1r r2r r<rA)r#rQrztuple[Vec2, Vec2]rLrr<rQ)rrQrrr<rQ)rrQrrQr<ztuple[int, int])rrr<r)r%r r#rr<rA) r\r r]r r^r r_r r`rr<z#tuple[Optional[Vec2], float, float])rlrPrmrPr<rR)rlrPrmrPrqrer<rR)7 __future__rtypingrrrrrtyping_extensionsr renum ezdxf.mathr r r r rrrr ezdxf.toolsrr__all__rrXrrrrrrrrrr ExceptionrrrCrDr[rBEnumrerrrrjrrrrrr r(r$rsD#CC&    (  Gx GE :bJbJJ-2-2`wwt /  /", / / DM( (0(;@((V" 8"FEN-:,  &0  *#(#(L  { { | R :C  &*16(>"tyy" B B* B B @ @* @ @;HH*H0@HH8    U,U,r(