l0jX:XdZddlZddlmZmZmZddlmZddl m Z  d dZ d d Z dd Z dS)zJ remesh.py ------------- Deal with re- triangulation of existing meshes. N)graphgroupingutil)tol)faces_to_edgesFc|)tjt|t}n-tjt|t}d||<||}tjt |d}tj|\}} ||| d} | dt|z} tj |dddf| dddf| dddf| dddf|dddf| dddf| dddf| dddf|dddf| dddf| dddf| dddfg  d} tj ||| f} tj || f}|si}| D]W\}}||tj fd ddgddgddgfD}||}tj ||f||<X|| |fS|rtj|d}t|t|z }tj||t| d zz d }t!t#||}|| |fS|| fS) a Subdivide a mesh into smaller triangles. Note that if `face_index` is passed, only those faces will be subdivided and their neighbors won't be modified making the mesh no longer "watertight." Parameters ------------ vertices : (n, 3) float Vertices in space faces : (m, 3) int Indexes of vertices which make up triangular faces face_index : faces to subdivide. if None: all faces of mesh will be subdivided if (n,) int array of indices: only specified faces vertex_attributes : dict Contains (n, d) attribute data return_index : bool If True, return index of original face for new faces Returns ---------- new_vertices : (q, 3) float Vertices in space new_faces : (p, 3) int Remeshed faces index_dict : dict Only returned if `return_index`, {index of original face : index of new faces}. NdtypeTraxisrcVg|]%}dd|ddfd&S)Nrr )mean).0g attr_triss Q/home/wildlama/miniconda3/envs/lam/lib/python3.11/site-packages/trimesh/remesh.py zsubdivide.._s=SSSQ111a7#((a(00SSS)rr)nponeslenboolzerossortrr unique_rowsrreshape column_stackvstackitemsnonzeroarangedictzip)verticesfaces face_indexvertex_attributes return_index face_mask faces_subsetedgesuniqueinversemidmid_idxf new_faces new_verticesnew_attributeskeyvaluesattr_midr&startstack index_dictrs @r subdivider@s DGCJJd333 HSZZt444 $ *#L GN<00q 9 9 9E*511OFG 5= ! & &A & . .Coog&&X6G  A  AAAqDM AAAqDM AAAqDM A  AAAqDM AAAqDM AAAqDM A  AAAqDM AAAqDM AAAqDM   gg( 5),a011I9h_--L$,2244 @ @KC|,IySSSSAq6Aq6Aq6:RSSSH 'H"$)VX,>"?"?N3  Y66 3*Y''*E S\\) %Q!!344<IIHHU"(>>>Mx FFFIc%jj))M8a< # #  G$]111lll?%CRaR%GHq Q Q QUV V #1#++  (*//Q/77)#2 ' " * * , ,T    )&122211222  O OOM'2 3 3 3GM($;VDDFLLNNM||~~  E ==122 2-6 mH5- - ) == #'"3Iy"I"INK8nX.. ;3{#3#33333{K77 ; &&rc ddlmn#t$r ddlmYnwxYw|d}fdt |D]}||\}}t js tj| sJtj| sJtj|| sJ|ddddf|ddddfk sJ||fS)a Subdivide a mesh by dividing each triangle into four triangles and approximating their smoothed surface (loop subdivision). This function is an array-based implementation of loop subdivision, which avoids slow for loop and enables faster calculation. Overall process: 1. Calculate odd vertices. Assign a new odd vertex on each edge and calculate the value for the boundary case and the interior case. The value is calculated as follows. v2 / f0 \ 0 v0--e--v1 / \ \f1 / v0--e--v1 v3 - interior case : 3:1 ratio of mean(v0,v1) and mean(v2,v3) - boundary case : mean(v0,v1) 2. Calculate even vertices. The new even vertices are calculated with the existing vertices and their adjacent vertices. 1---2 / \/ \ 0---1 0---v---3 / \/ \ \ /\/ b0---v---b1 k...4 - interior case : (1-kB):B ratio of v and k adjacencies - boundary case : 3:1 ratio of v and mean(b0,b1) 3. Compose new faces with new vertices. Parameters ------------ vertices : (n, 3) float Vertices in space faces : (m, 3) int Indices of vertices which make up triangles Returns ------------ vertices : (j, 3) float Vertices in space faces : (q, 3) int Indices of vertices iterations : int Number of iterations to run subdivision r) zip_longest) izip_longestNrc t|d\}}|dtj|\}}t jtj|dd}tj|d}t |dzt |zt |ks tj||}t |dkrtdg} g} d} |D]} tj ||  d d \}}(||| d  \} }|| z }| t | z } | | | |t j | t j | fSt jt |t }d||<||}|}t jt |t"}|dddf||dddf<|dddf||dddf<||}|||}|||d}|||}||dddf}||dddf}|||}|||}||dddddf|dddddfkd }||dddddf|dddddfkd }||}||}d|zd|zz|dz z|dz z||<tj||t |}t jt-)|dd ij}t j |gdg}|dztd} t j|}!ddt jdtjz| z zdzdzz d| zz }"|"dddf||dzd| dddf|"dddfzz |zz}!|rt jt |t }#d|#t j|||<||#}$d |$|#||#<||$ddz d||#zz|!|#<| d t |z}%t j|dddf|%dddf|%dddf|%dddf|dddf|%dddf|%dddf|%dddf|dddf|%dddf|%dddf|%dddfg  d }&t j |!|f}'|'|&fS)NT)r.rr r) require_countz*Some edges are shared by more than 2 facesrrrDr)r*r+r g?g @)r1 max_index fillvalue)rmrmgD@g@r@g?)rr rr!r group_rowsrrconnected_componentsrSrMr"rOr$rrastypeintrrL neighborsrFlistrQrK zeros_likecospir2r#)*r*r+r1 edges_facer2r3 edge_inter edge_bound faces_group seq_verts seq_facescountr6 cur_verts cur_facesedge_bound_maskedge_inter_mask edge_pairopposite_face1opposite_face2oddee_v0e_v1e_f0e_f1e_v2_idxe_v3_idxe_v2e_v3rs vertices_kevenbetavrt_bound_maskboundary_neighborsodd_idxr7r8 _subdividergs* rrz"subdivide_loop.._subdivides*5tDDDz  ".u55WX0aHHHqQQQ (a@@@ :"S__4E BB  4Z 5KLLK;1$$ !MNNNIIE  , , #+":!H$$R((### (2z%f-W__W5M5M((($ 9 U" Y'  +++  ++++9Y''9)=)== =(3u::T:::&* #)&1**HSZZ((//44 &0A&6 *QQQT"#&0A&6 *QQQT"##F+#If$56uV}%***22 &) *{111a4 {111a4 ^O45^O45$qqq!!!Tz*a4 m;@@DDDE$qqq!!!Tz*a4 m;@@DDDE!! %t|edl:TCZG$QT*TOO%-3x==QQQ HT++y"GB"G"GHHIIK Ix9:: ] " "4 ( ( , ,! , 4 4}X&&bfQY]333a7A=="q&I DMIi044Q77 71QQQW:QQQW --9 :    Xc(mm4@@@NIMN29U6]O3C%DEE F"+>!: MO y/H II J,-11q199C? 889  //'**S]]:Oaaad 1 1 1 aaad 1 1 1 aaad 1 1 1     ''   $y$-- Y&&r) itertoolsrg BaseExceptionrhrIrstrictrisfiniteall)r*r+ iterations_rrgs @@rsubdivide_looprsv^:))))))) :::99999999: Q'Q'Q'Q'Q'Q'f:  66$*Xu55%% z44{8$$((*****{5!!%%'''''{8E?++//11111aaae aaa!e ,1133333 U?s  )NNF)rAF)N)__doc__numpyrrrr constantsrgeometryrr@rerrrrs##########$$$$$$LQc#c#c#c#LX'X'X'X'vXXXXXXr