hJ<SSKJr SSKJr SSKJrJrJr SSKJ r J r J r S/r Sr SrSrSrS r"S S 5r"S S 5r"SS5r"SS5rg)) annotations)Optional)Vec3best_fit_normalnormal_vector_3p)MeshVertexMerger MeshBuilderMeshTransformerCSGgh㈵>cz\rSrSrSrSrS Sjr\S Sj5rS Sjr SSjr SSjr SS jr Sr g )Plane1zRepresents a plane in 3D space.normalwcXlX lgNr)selfrrs D/var/www/html/env/lib/python3.13/site-packages/ezdxf/addons/pycsg.py__init__Plane.__init__6s  cN[XU5n[XDRU55$r)rrdot)clsabcns r from_pointsPlane.from_points;s! Q1 %Qa!!rcB[URUR5$r)rrrrs rclone Plane.clone@sT[[$&&))rcLUR*UlUR*Ulgrrr&s rflip Plane.flipCs{{l &&rc<SURSURS3$)NzPlane(, )rr&s r__repr__Plane.__repr__Gs }Btvvha00rcSn/nURnURn UHin URRU 5UR- n U [ *:a[ n OU [ :a[n O[n Xl-nURU 5 Mk U[:XaWURRURR5S:aURU5 gURU5 gU[:XaURU5 gU[ :XaURU5 gU[:XGaM/n /n[U5n[U5HnUS-U-nUUn UUnUUn UUnU [ :waU RU 5 U [:waURU 5 U U-[:XdMdURURRU 5- URRUU - 5- nU RUU5nU RU5 URU5 M [U 5S:aUR[XS95 [U5S:aUR[XS95 ggg)a8 Split `polygon` by this plane if needed, then put the polygon or polygon fragments in the appropriate lists. Coplanar polygons go into either `coplanarFront` or `coplanarBack` depending on their orientation with respect to this plane. Polygons in front or in back of this plane go into either `front` or `back` rr rmeshidN)verticesr3rrr PLANE_EPSILONBACKFRONTCOPLANARappendplaneSPANNINGlenrangelerpPolygon)rpolygoncoplanar_front coplanar_backfrontback polygon_type vertex_typesr4r3vertexdistance vertex_typefront_vertices back_vertices len_verticesindex next_indexnext_vertex_type next_vertexinterpolation_weightplane_intersection_points r split_polygonPlane.split_polygonJs<  ##F{{v.7H=.(" M)# &  'L    , 8 #{{w}}334q8%%g.$$W- U " LL ! T ! KK X %NMx=L|,#ai<7 *51 #/ #; !%&z2 $&"))&1%'!((0"22x?!88  f(<=,>(06{{#%90,#))*BC!(()AB%-&>"a' W^CD=!Q& GMAB'3&rN)rrrfloat)rrr rr!rreturnr)rVrrVNonerVstr) r@z 'Polygon'rA list[Polygon]rBr[rCr[rDr[rVrX)__name__ __module__ __qualname____firstlineno____doc__ __slots__r classmethodr#r'r*r/rS__static_attributes__rrrr1s)I ""*1ECEC&EC% EC  EC  EC ECrrcH\rSrSrSrSrS S SjjrS SjrS SjrSSjr Sr g )r?a Represents a convex polygon. The vertices used to initialize a polygon must be coplanar and form a convex loop, the `meshid` argument associates a polygon to a mesh. Args: vertices: polygon vertices as :class:`Vec3` objects meshid: id associated mesh )r4r:r3cXl[USUSUS5n[ X3R US55UlX lg![a [U5nN@f=f)Nrr r )r4rZeroDivisionErrorrrrr:r3)rr4r3rs rrPolygon.__init__sa  /%hqk8A; LF6::hqk#:;  ! /$X.F /sAAAcP[[UR5URS9$)Nr2)r?listr4r3r&s rr' Polygon.clonestDMM*4;;??rclURR5 URR5 gr)r4reverser:r*r&s rr* Polygon.flips   rclSRSUR55nSUSURS3$)Nr-c38# UHn[U5v M g7fr)repr).0vs r #Polygon.__repr__..s5}!d1gg}sz Polygon([z], mesh=r.)joinr4r3)rrts rr/Polygon.__repr__s3 II5t}}5 51#Xdkk]!44r)r3r:r4Nr)r4z list[Vec3]r3int)rVr?rWrY) r\r]r^r_r`rarr'r*r/rcrdrrr?r?s# 0I@5rr?cf\rSrSrSrSrS SSjjrSSjrSSjrSSjr SS jr SS jr SS jr S r g)BSPNodeac Holds a node in a BSP tree. A BSP tree is built from a collection of polygons by picking a polygon to split along. That polygon (and all other coplanar polygons) are added directly to that node and the other polygons are added to the front and/or back subtrees. This is not a leafy BSP tree since there is no distinction between internal and leaf nodes. )r:rCrDpolygonsNcnSUlSUlSUl/UlU(aUR U5 ggr)r:rCrDr~buildrr~s rrBSPNode.__init__s2&* (, '+ ')  JJx  rc[5nUR(aURR5UlUR(aURR5UlUR(aURR5UlUR Vs/sHo"R5PM snUlU$s snfr)r|r:r'rCrDr~)rnodeps rr' BSPNode.clonesy ::))+DJ ::))+DJ 99 )DI,0MM:MqM:  ;s)C cURHnUR5 M URceURR5 UR(aURR 5 UR (aUR R 5 UR URsUlUlg)zBConvert solid space to empty space and empty space to solid space.N)r~r*r:rCinvertrD)rpolys rrBSPNode.inverts}MMD IIK"zz%%%  :: JJ    99 II    $ 4:: DIrcVURcUSS$/n/nUH nURRXBX2U5 M" UR(aURRU5nUR(aURRU5nO/nUR U5 U$)zNRecursively remove all polygons in `polygons` that are inside this BSP tree. N)r:rSrC clip_polygonsrDextend)rr~rCrDr@s rrBSPNode.clip_polygonss :: A; ! G JJ $ $WT$ G  ::JJ,,U3E 9999**40DD T rcURUR5UlUR(aURRU5 UR(aURRU5 gg)zORemove all polygons in this BSP tree that are inside the other BSP tree `bsp`. N)rr~rCclip_torD)rbsps rrBSPNode.clip_tosQ))$--8 :: JJ  s # 99 II  c " rc URSSnUR(a)URURR55 UR(a)URURR55 U$)z/Return a list of all polygons in this BSP tree.N)r~rCr all_polygonsrDrs rrBSPNode.all_polygonssU==# :: OODJJ335 6 99 OODII224 5rcZ[U5S:XagURc"USRR5UlURR US5 /n/nUSSH4nURR X@RURX#5 M6 [U5S:a7UR c[5UlUR RU5 [U5S:a8URc[5Ul URRU5 gg)a Build a BSP tree out of `polygons`. When called on an existing tree, the new polygons are filtered down to the bottom of the tree and become new nodes there. Each set of polygons is partitioned using the first polygon (no heuristic is used to pick a good split). rNr ) r<r:r'r~r9rSrCr|rrD)rr~rCrDrs rr BSPNode.build s x=A   :: !!**002DJ Xa[)! QRLD JJ $ $mmT]]E ! u:>zz!$Y JJ  U # t9q=yy #I IIOOD ! r)rDrCr:r~r)r~zOptional[list[Polygon]])rVr|rW)r~r[rVr[)rr|rVrX)rVr[)r~r[rVrX)r\r]r^r_r`rarr'rrrrrrcrdrrr|r|s17I!  60#"rr|c\rSrSrSrS SSjjr\SSj5rSSSjjrSSjr SSjr \ r SS jr \ r SS jr\rSS jrS rg)r i,a  Constructive Solid Geometry (CSG) is a modeling technique that uses Boolean operations like union and intersection to combine 3D solids. This class implements CSG operations on meshes. New 3D solids are created from :class:`~ezdxf.render.MeshBuilder` objects and results can be exported as :class:`~ezdxf.render.MeshTransformer` objects to `ezdxf` by method :meth:`mesh`. Args: mesh: :class:`ezdxf.render.MeshBuilder` or inherited object meshid: individual mesh ID to separate result meshes, ``0`` is default NcUc/UlgUR5nUR5 UR5Vs/sHn[ XB5PM snUlgs snfr)r~copynormalize_facesfaces_as_verticesr?)rmeshr3 mesh_copyfaces rr CSG.__init__<sT <+-DM I  % % '2;2M2M2O2O$%2ODMsAc&[5nXlU$r)r r~)rr~csgs r from_polygonsCSG.from_polygonsFse  rc[5nURH/nXR:XdMURUR5 M1 [ R "U5$)zs Returns a :class:`ezdxf.render.MeshTransformer` object. Args: meshid: individual mesh ID, ``0`` is default )rr~r3add_facer4r from_builder)rr3rrs rrCSG.meshLsG !MMD$ dmm,"++D11rc~URURVs/sHoR5PM sn5$s snfr)rr~r')rrs rr' CSG.cloneZs-!!dmm"Dm779m"DEE"Ds:c[UR5R5n[UR5R5nURU5 URU5 UR 5 URU5 UR 5 UR UR 55 [RUR 55$)a Return a new CSG solid representing space in either this solid or in the solid `other`. Neither this solid nor the solid `other` are modified:: A.union(B) +-------+ +-------+ | | | | | A | | | | +--+----+ = | +----+ +----+--+ | +----+ | | B | | | | | | | +-------+ +-------+ ) r|r'r~rrrrr rrotherrr s runion CSG.union]s DJJL)) * EKKM** + !  !    !     !  !122rc[UR5R5n[UR5R5nUR5 UR U5 UR U5 UR5 UR U5 UR5 UR UR 55 UR5 [RUR 55$)a Return a new CSG solid representing space in this solid but not in the solid `other`. Neither this solid nor the solid `other` are modified:: A.subtract(B) +-------+ +-------+ | | | | | A | | | | +--+----+ = | +--+ +----+--+ | +----+ | B | | | +-------+ r|r'r~rrrrr rrs rsubtract CSG.subtractys DJJL)) * EKKM** +   !  !    !     !    !122rc[UR5R5n[UR5R5nUR5 UR U5 UR5 UR U5 UR U5 UR UR 55 UR5 [RUR 55$)aA Return a new CSG solid representing space both this solid and in the solid `other`. Neither this solid nor the solid `other` are modified:: A.intersect(B) +-------+ | | | A | | +--+----+ = +--+ +----+--+ | +--+ | B | | | +-------+ rrs r intersect CSG.intersects DJJL)) * EKKM** +   !    !  !   !    !122rclUR5nURHnUR5 M U$)zY Return a new CSG solid with solid and empty space switched. This solid is not modified. )r'r~r*)rrrs rinverse CSG.inverses+ jjlA FFH r)r~)Nr)rzOptional[MeshBuilder]r3rz)r~r[rVr ry)r3rzrVr )rVr )rr rVr )r\r]r^r_r`rrbrrr'r__add__r__sub__r__mul__rrcrdrrr r ,sT  2F34G38G36GrN) __future__rtypingr ezdxf.mathrrr ezdxf.renderrr r __all__r8r7r6r;r5rr?r|r rdrrrsn #>>GG> '    ^C^CB!5!5Hs"s"lPPr