Mi9hSrSSKJr SSKrSSKJrJrJr SSK J r SSK J r S Sjr S S jrS S jrg)zJ remesh.py ------------- Deal with re- triangulation of existing meshes. ) zip_longestN)graphgroupingutil)tol)faces_to_edgescUc#[R"[U5[S9nO&[R"[U5[S9nSXR'Xn[R "[ U5SS9n[R"U5upXURSS9n U RS5[U5-n [R"USS2S4U SS2S4U SS2S4U SS2S4USS2S4U SS2S4U SS2S4U SS2S4USS2S4U SS2S4U SS2S4U SS2S4/ 5RS5n [R"X)U 45n [R"X 45nUbi0nUR5HOunn[U5[U5:waM UXxRSS9n[R"UU45UU'MQ XU4$U(a~[R"U5Sn[U5[U5- n[R"UU[U 5S --5RS 5n[![#UU55nXU4$X4$) 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)nponeslenboolzerossortr r unique_rowsmeanreshape column_stackvstackitemsnonzeroarangedictzip)verticesfaces face_indexvertex_attributes return_index face_mask faces_subsetedgesuniqueinversemidmid_idxf new_faces new_verticesnew_attributeskeyvaluesattr_midr startstack index_dicts h/var/www/eduai.edurigo.com/storigo/production/storigo_env/lib/python3.13/site-packages/trimesh/remesh.py subdivider;s_DGGCJd3 HHSZt4 $ #L GGN<0q 9E**51OF = ! & &A & .Coog&X6G  A  AqDM AqDM AqDM A  AqDM AqDM AqDM A  AqDM AqDM AqDM  gg( 5,a01I99h_-L$,224KC6{c(m+em,11q19H"$))VX,>"?N3  5 66**Y'*E S\) %Q!!34<IIHHHU"((>Mxx FIIc%j)M8a<  GG$1l?%CRaR%GHq QUV V #1#+  *//Q/7)#22  " * * ,T  )1212  OOM2 3GGM$;VDFFLLNM||~~  =12 2-6 H5- ) =C!L#'"3"3I"INKnnX. ;3{#3333{K77 ; &&r<c^UcSnU4Sjm[U5H nT"X5upM [R(d[R"U5R 5(de[R"U5R 5(de[R"X5R 5(deUSS2SS24USS2SS24:gR 5(deX4$)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 NrcZ >[USS9up#URSS9 [R"U5upE[R"[R "USS9SS9n[R "USS9n[ U5S-[ U5-[ U5:Xd[R"X65n[ U5S:Xa [S5e/n /n Sn UHyn [R"XRS 5SS 9upET("XURS 5S 9upX- nU [ U 5- n U RU 5 U RU5 M{ [R"U 5[R"U 54$[R"[ U5[S 9nSX'XnU)n[R"[ U55R!["5nUSS2S4UUSS2S4'USS2S4UUSS2S4'X4nUUUnXUR%SS9nX$UnUUSS2S4nUUSS2S4nUUUnUUUnUUSS2SS2S4USS2SSS24:HR'S 5)nUUSS2SS2S4USS2SSS24:HR'S 5)nUUnUUnSU-SU--US- -US- -UU'[R("X$[ U5S9n[R*"[-[/USS 0655R0n[R"U/SQ/5nUS-R![5R3SS9n [R4"U5n!SS[R6"S[R8-U - 5-S-S-- SU -- n"U"SS2S4UUR3S5-SU SS2S4U"SS2S4-- U--n!UR'5(as[R"[ U5[S 9n#SU#[R:"X$U)5'UU#n$S U$U#UU#)'UU$R3SS9S- SUU#--U!U#'URS 5[ U5-n%[R<"USS2S4U%SS2S4U%SS2S4U%SS2S4USS2S4U%SS2S4U%SS2S4U%SS2S4USS2S4U%SS2S4U%SS2S4U%SS2S4/ 5RS 5n&[R"U!U45n'U'U&4$)NT)r(rr r) require_countz*Some edges are shared by more than 2 facesrrr?r)r$r%r g?g @)r+ max_index fillvalue)rfrfgD@g@r@g?)r rrrr group_rowsrrconnected_componentsrNrHrrJrrrastypeintrrG neighborsrAlistrrLrF zeros_likecospir,r))r$r%r+ edges_facer,r- edge_inter edge_bound faces_group seq_verts seq_facescountr0 cur_verts cur_facesedge_bound_maskedge_inter_mask edge_pairopposite_face1opposite_face2oddee_v0e_v1e_f0e_f1e_v2_idxe_v3_idxe_v2e_v3rl vertices_kevenbetavrt_bound_maskboundary_neighborsodd_idxr1r2 _subdivides) r:r"subdivide_loop.._subdivides*5tD  "..u5WWX00aHqQ ((a@ :"S_4E B  44Z5KLK;1$ !MNNIIE  #+":":H$$R(# (2%-W__W5M($ " Y'  +  ++!099Y'9)== =((3u:T:&*#)1**HHSZ(//4 &0A&6 *QT"#&0A&6 *QT"##+#If$56V}%***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@NIMN299U]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<)rDrstrictrisfiniteall)r$r% iterations_rs @r:subdivide_looprs^ Q'f: $X5% zzT{{8$((****{{5!%%''''{{8?+//1111ae a!e ,113333 ?r<)NNF) F)N)__doc__ itertoolsrnumpyrrrr constantsrgeometryr r;r`rr<r:rs9"##$LQa#HX'vRr<