:vj6B^dZddlmZddlZddlmZmZddlm Z ddl m Z  d dZ d d Z d d Zy)zJ remesh.py ------------- Deal with re- triangulation of existing meshes. ) zip_longestN)graphgrouping)tol)faces_to_edgesc|%tjt|t}n)tjt|t}d||<||}tj t |d}tj|\}} |||jd} | jdt|z} tj|dddf| dddf| dddf| dddf|dddf| dddf| dddf| dddf|dddf| dddf| dddf| dddfg jd} tj||| f} tj|| f}|ii}|jD]O\}}t|t|k7r|||jd}tj||f||<Q|| |fS|r}tj|d}t|t|z }tj||t| d zzjd }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}. NdtypeTraxisr)rr)nponeslenboolzerossortrr unique_rowsmeanreshape column_stackvstackitemsnonzeroarangedictzip)verticesfaces face_indexvertex_attributes return_index face_mask faces_subsetedgesuniqueinversemidmid_idxf new_faces new_verticesnew_attributeskeyvaluesattr_midrstartstack index_dicts _/workspace/moltex-experiments/.pixi/envs/default/lib/python3.12/site-packages/trimesh/remesh.py subdivider:ssDGGCJd3 HHSZt4 $ *#L GGN<0q 9E**51OFG 5= ! & &A & .Coog&X6G  A  AqDM AqDM AqDM A  AqDM AqDM AqDM A  AqDM AqDM AqDM  gg( 5),a01I99h_-L$,224KC6{c(m+eFm,11q19H"$))VX,>"?N3  5 Y66**Y'*E S\) %Q!!34<H HHU"(( 6E IIc%j !E 8a< u-A6"..u5V} l1a4("1", -ad9KRaR9O0P PUV V #1#+h& }}  =12 2773v;"((; iiIMMO(<=H M99hi1H(I(N(NTU(N(VWXG$,,W5A  q !z4[ 4[ qj IIeCjq ) IIc!f :x}DQT(Bq1q5A+~.1q1uk>0Ba1 AJOOQ1aA$67??H IIeCj!, qj YYuSz *Q .! 3 IIc!f :x}DQT(Bq1q5A+~.1q1uk>0Ba1AqDz4AEQ;/1q"1"uoBQB/A 5 : : : B!RaR%8ArrE?2q8==1=E F T'!Q+&"//1a)"XY&"//1a)"XYIIvvv67 GGE#J*  <%DTT BVV Boo RRRRR < ''  iie a0  :y)[IJQQ HH  Iy+NO_!b5zSZ'''%% U?r;c|d}fdt|D]}||\}}tjs tj|j sJtj|j sJtj||j sJ|ddddf|ddddfk7j 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 Nrc t|d\}}|jdtj|\}}t jtj |dd}tj |d}t |dzt |zt |k(stj||}t |dk(r tdg} g} d} |D]} tj|| jd d \}}(|||jd  \} }|| z }| t | z } | j| | j|t j| t j| fSt jt |t }d||<||}|}t jt |j!t"}|dddf||dddf<|dddf||dddf<||}|||}|||j%d}|||}||dddf}||dddf}|||}|||}||dddddf|dddddfk(j'd }||dddddf|dddddfk(j'd }||}||}d|zd|zz|dz z|dz z||<tj(||t |}t j*t-t/|dd ij0}t j|gdg}|dzj!tj3d} t j4|}!ddt j6dtj8z| z zdzdzz d| zz }"|"dddf||j3dzd| dddf|"dddfzz |zz}!|j'rxt jt |t }#d|#t j:|||<||#}$d |$|#||#<||$j3ddz d||#zz|!|#<|jd t |z}%t j<|dddf|%dddf|%dddf|%dddf|dddf|%dddf|%dddf|%dddf|dddf|%dddf|%dddf|%dddfg jd }&t j|!|f}'|'|&fS)NT)r'rr r) require_countz*Some edges are shared by more than 2 facesrr)return_inverser)r#r$r g?g @)r* max_index fillvalue)rrgD@g@r@g?)rrrrr group_rowsrrconnected_componentsrDunique_bincountrappendrrrrMrFrrC neighborsr>listrrLrB zeros_likecospir+r))r#r$r* edges_facer+r, edge_inter edge_bound faces_group seq_verts seq_facesrYr/ cur_verts cur_facesedge_bound_maskedge_inter_mask edge_pairopposite_face1opposite_face2oddee_v0e_v1e_f0e_f1e_v2_idxe_v3_idxe_v2e_v3r vertices_kevenbetavrt_bound_maskboundary_neighborsodd_idxr0r1 _subdivides) r9rz"subdivide_loop.._subdivide&s*5tDz  "..u5WWX00aHqQ ((a@ :"S_4E B  44Z 5KLK;1$ !MNNIIE  #+":":!H$$R(# (2%f-W__W5M($ 9 U" Y'  +  ++!099Y'9)== =((3u:T:&* #)&1**HHSZ(//4 &0A&6 *QT"#&0A&6 *QT"##F+#If$56uV}%***2 &) *{1a4 {1a4 ^O45^O45$q!Tz*a4 m;@@DDE$q!Tz*a4 m;@@DDE!! %t|edl:TCZG$QT*TOOO%-3x=Q HHT+y"GB"GHIKK IIx9: ] " "4 ( , ,! , 4}}X&bffQY]33a7A=="q&I DMIi044Q7 71QW:QW --9 :    XXc(m4@NIMN299U6]O3C%DE F"+>!: MO y/H II J,-11q19C? 889  //'*S]:OOad 1 1 1 ad 1 1 1 ad 1 1 1    ''  $yy$- Y&&r;)rArstrictrisfiniteall)r#r$ iterations_rs @r9subdivide_looprs^ Q'f: $Xu5% zzT{{8$((***{{5!%%'''{{8E?+//111ae a!e ,11333 U?r;)NNF) F)N)__doc__ itertoolsrnumpyrrr constantsrgeometryrr:r}rr;r9rs6"$LQa#H|~Rr;