h>ddlmZddlmZddlmZmZmZddlm Z m Z m Z dgZ dZ dZdZdZd ZGd d ZGd d ZGddZGddZy)) annotations)Optional)Vec3best_fit_normalnormal_vector_3p)MeshVertexMerger MeshBuilderMeshTransformerCSGgh㈵>cfeZdZdZdZd dZed dZd dZd dZ ddZ ddZ y )PlanezRepresents a plane in 3D space.normalwc ||_||_yNr)selfrrs 2lib/python3.12/site-packages/ezdxf/addons/pycsg.py__init__zPlane.__init__6s cRt|||}t||j|Sr)rrdot)clsabcns r from_pointszPlane.from_points;s% Q1 %Qa!!rcBt|j|jSr)rrrrs rclonez Plane.clone@sT[[$&&))rcL|j |_|j |_yrrr#s rflipz Plane.flipCs{{l &&rc<d|jd|jdS)NzPlane(, )rr#s r__repr__zPlane.__repr__Gs }Btvvha00rcd}g}|j}|j} |D]g} |jj| |jz } | t krt } n| t kDrt} nt} || z}|j| i|tk(rV|jj|jjdkDr|j|y|j|y|tk(r|j|y|t k(r|j|y|tk(rMg} g}t|}t|D]}|dz|z}||} ||}||} ||}| t k7r| j| | tk7r|j| | |ztk(s`|j|jj| z |jj|| z z }| j||}| j||j|t| dk\r|jt| | t|dk\r|jt|| yyy)ah 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)verticesr-rrr PLANE_EPSILONBACKFRONTCOPLANARappendplaneSPANNINGlenrangelerpPolygon)rpolygoncoplanar_front coplanar_backfrontback polygon_type vertex_typesr.r-vertexdistance vertex_typefront_vertices back_vertices len_verticesindex next_indexnext_vertex_type next_vertexinterpolation_weightplane_intersection_points r split_polygonzPlane.split_polygonJsB  ##F{{v.7H=.(" M)# & K '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^FCD=!Q& GM&AB'3&rN)rrrfloat)rrrrrrreturnr)rOrrONonerOstr) r:z 'Polygon'r; list[Polygon]r<rTr=rTr>rTrOrQ) __name__ __module__ __qualname____doc__ __slots__r classmethodr!r$r&r*rMrrrr1s)I ""*1ECEC&EC% EC  EC  EC ECrrc6eZdZdZdZdd dZd dZd dZd dZy) r9a" 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 )r.r4r-c||_ t|d|d|d}t ||j |d|_||_y#t$rt|}YAwxYw)Nrr r )r.rZeroDivisionErrorrrrr4r-)rr.r-rs rrzPolygon.__init__sg   /%hqk8A; LF66::hqk#:;  ! /$X.F /sA A! A!cVtt|j|jS)Nr,)r9listr.r-r#s rr$z Polygon.clonestDMM*4;;??rcl|jj|jjyr)r.reverser4r&r#s rr&z Polygon.flips   rcldjd|jD}d|d|jdS)Nr(c32K|]}t|ywr)repr).0vs r z#Polygon.__repr__..s5}!d1g}sz Polygon([z], mesh=r))joinr.r-)rrgs rr*zPolygon.__repr__s3 II5t}}5 51#Xdkk]!44rNr)r.z list[Vec3]r-int)rOr9rPrR) rUrVrWrXrYrr$r&r*r[rrr9r9s# 0I@5rr9cNeZdZdZdZd d dZd dZddZddZddZ dd Z dd Z y)BSPNodea{ 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. )r4r=r>polygonsNcdd|_d|_d|_g|_|r|j |yyr)r4r=r>rnbuildrrns rrzBSPNode.__init__s2&* (, '+ ')  JJx  rct}|jr|jj|_|jr|jj|_|jr|jj|_|j Dcgc]}|jc}|_|Scc}wr)rmr4r$r=r>rn)rnodeps rr$z BSPNode.clonesy ::))+DJ ::))+DJ 99 )DI,0MM:MqM:  ;sB;ct|jD]}|j|jJ|jj|jr|jj |j r|j j |j |jc|_|_y)zBConvert solid space to empty space and empty space to solid space.N)rnr&r4r=invertr>)rpolys rrvzBSPNode.inverts}MMD IIK"zz%%%  :: JJ    99 II    $ 4:: DIrc@|j|ddSg}g}|D]!}|jj|||||#|jr|jj|}|jr|jj|}ng}|j ||S)z^Recursively remove all polygons in `polygons` that are inside this BSP tree. N)r4rMr= clip_polygonsr>extend)rrnr=r>r:s rryzBSPNode.clip_polygonss :: A; ! G JJ $ $WeT5$ G  ::JJ,,U3E 9999**40DD T rc|j|j|_|jr|jj||jr|jj|yy)z_Remove all polygons in this BSP tree that are inside the other BSP tree `bsp`. N)ryrnr=clip_tor>)rbsps rr|zBSPNode.clip_tosQ))$--8 :: JJ  s # 99 II  c " rc|jdd}|jr)|j|jj|jr)|j|jj|S)z/Return a list of all polygons in this BSP tree.N)rnr=rz all_polygonsr>rqs rrzBSPNode.all_polygonssU==# :: OODJJ335 6 99 OODII224 5rcNt|dk(ry|j"|djj|_|jj |dg}g}|ddD]5}|jj ||j|j||7t|dkDr6|j t|_|j j|t|dkDr7|jt|_ |jj|yy)a0 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 ) r6r4r$rnr3rMr=rmrpr>)rrnr=r>rws rrpz BSPNode.build s x=A   :: !!**002DJ Xa[)! QRLD JJ $ $dmmT]]E4 ! u:>zz!$Y JJ  U # t9q=yy #I IIOOD ! rr)rnzOptional[list[Polygon]])rOrmrP)rnrTrOrT)r}rmrOrQ)rOrT)rnrTrOrQ) rUrVrWrXrYrr$rvryr|rrpr[rrrmrms17I!  60#"rrmcjeZdZdZd d dZed dZdddZddZddZ e Z ddZ e Z dd Z e Zdd Zy)r a1 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 Nc|g|_y|j}|j|jDcgc]}t ||c}|_ycc}wr)rncopynormalize_facesfaces_as_verticesr9)rmeshr- mesh_copyfaces rrz CSG.__init__<sV <+-DM I  % % '2;2M2M2O2O$f%2ODMsAc(t}||_|Sr)r rn)rrncsgs r from_polygonszCSG.from_polygonsFse  rct}|jD]-}||jk(s|j|j/t j |S)z Returns a :class:`ezdxf.render.MeshTransformer` object. Args: meshid: individual mesh ID, ``0`` is default )rrnr-add_facer.r from_builder)rr-rrs rrzCSG.meshLsI !MMD$ dmm,"++D11rcz|j|jDcgc]}|jc}Scc}wr)rrnr$)rrts rr$z CSG.cloneZs/!!dmm"Dm1779m"DEE"Ds8ct|jj}t|jj}|j||j||j |j||j |j |j tj|j S)a3 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 | | | | | | | +-------+ +-------+ ) rmr$rnr|rvrprr rrotherrrs runionz CSG.union]s DJJL)) * EKKM** + !  !    !     !  !122rct|jj}t|jj}|j|j ||j ||j|j ||j|j |j |jtj|j S)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 | | | +-------+ rmr$rnrvr|rprr rrs rsubtractz CSG.subtractys DJJL)) * EKKM** +   !  !    !     !    !122rct|jj}t|jj}|j|j ||j|j ||j ||j |j |jtj|j S)a 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 intersectz CSG.intersects DJJL)) * EKKM** +   !    !  !   !    !122rch|j}|jD]}|j|S)zq Return a new CSG solid with solid and empty space switched. This solid is not modified. )r$rnr&)rrrts rinversez CSG.inverses+ jjlA FFH r)Nr)rzOptional[MeshBuilder]r-rk)rnrTrOr rj)r-rkrOr )rOr )rr rOr )rUrVrWrXrrZrrr$r__add__r__sub__r__mul__rr[rrr r ,sT  2F34G38G36GrN) __future__rtypingr ezdxf.mathrrr ezdxf.renderrr r __all__r2r1r0r5r/rr9rmr r[rrrsn #>>GG> '    ^C^CB!5!5Hs"s"lPPr