MieJSrSSKrSSKJr SSKJrJr SSKJ r SSK J r SSK J r SS KJr SS KJr S rS rSr Sr"SS5r"SS5rSrSSjrSSjrg!\arSS KJr \"\5rSrCNHSrCff=f)z< proximity.py --------------- Query mesh- point proximity. N)util)log_timetol) group_min) closest_point)points_to_barycentric) diagonal_dot)cKDTree)ExceptionWrapperc[R"U[RS9n[R"US5(d [ S5eUR n[URUR5nURU5SRS5nU[R- n[R"X- X-45nUVs/sHn[UR!U55PM nnU$s snf)a* For each point find nearby faces relatively quickly. The closest point on the mesh to the queried point is guaranteed to be on one of the faces listed. Does this by finding the nearest vertex on the mesh to each point, and then returns all the faces that intersect the axis aligned bounding box centered at the queried point and extending to the nearest vertex. Parameters ---------- mesh : trimesh.Trimesh Mesh to query. points : (n, 3) float Points in space Returns ----------- candidates : (points,) int Sequence of indexes for mesh.faces dtypepoints must be (n,3)!r)rr)np asanyarrayfloat64ris_shape ValueErrortriangles_treer verticesreferenced_verticesqueryreshapermerge column_stacklist intersection)meshpointsrtreekdtreedistance_vertexboundsb candidatess k/var/www/eduai.edurigo.com/storigo/production/storigo_env/lib/python3.13/site-packages/trimesh/proximity.py nearby_facesr+s.]]6 4F == ) )011   E T]]4#;#;< =Fll6*1-55g>Osyy O__f68PQ RF8>>v!$u))!,-vJ> ?s$C7c URR[R5n[R"U[R S9n[ R"US5(d [S5e[ R"US5(d [S5e[R"US[U545n[R"UVs/sHn[X$RS55PM sn5n[XQ5VVs/sHupFXF- S-RSS9PM nnn[R"UVs/sHoDR!5PM sn5n[R"[X5VV s/sH upIXPM sn n5n [R"[X5VV s/sH upIXPM sn n5S -n XU4$s snfs snnfs snfs sn nfs sn nf) a Given a mesh and a list of points find the closest point on any triangle. Does this by constructing a very large intermediate array and comparing every point to every triangle. Parameters ---------- mesh : Trimesh Takes mesh to have same interfaces as `closest_point` points : (m, 3) float Points in space Returns ---------- closest : (m, 3) float Closest point on triangles for each point distance : (m,) float Distances between point and triangle triangle_id : (m,) int Index of triangle containing closest point r)rrrztriangles shape incorrectrzpoints must be (n,3)raxis?) trianglesviewrndarrayrrrrrtilelenarray_correspondingrzipsumargmin) r"r#r1 points_tiledi on_triangleq distance_2 triangle_idgclosestdistances r*closest_point_naiverDFs2##BJJ/I ]]6 4F ==J / /455 == ) )/00776As9~#67L((@LM 1 99W#5 6 MK :=[9QR9QAEa<$$!$,9QJR(( ; 1HHJ ;>42 3D 299RVVSAQ=R+STUI T %%r|c$[R"U[RS9n[R"US5(d [ S5eUbn[R"U[RS9n[R"US5(d [ S5e[ U5[ U5:wa [ S5eOUR[X5SnU(aU*n[XU5nUS-n[R"[ U5[S9n[R"[R"U55SHn [R"URX- X95n U R!5["R$:a[R&Xy'S X'MeURU R)5n [R"XU - XU - 5S[R"XU - X95-- Xy'M X[R*"UR-S S 55--n [R.[R.[R./U [R"U5'[R0R3UR4S UR4S- 5n XM-nSnUR75S:Ga;X:Ga5US - nUR8R;X5unnn[R<"U[R0R3XX- S S 9- 5["R$:nS U[R"U5SU'UU)X- nXxR?5n[AUU5S[AUX85-- Xx'XX8UUR-S S 5--X'UXx- U:nS U[R"U5SU'UR75S:aX:aGM5X4$) a Find the center and radius of the sphere which is tangent to the mesh at the given point and at least one more point with no non-tangential intersections with the mesh. Masatomo Inui, Nobuyuki Umezu & Ryohei Shimane (2016) Shrinking sphere: A parallel algorithm for computing the thickness of 3D objects, Computer-Aided Design and Applications, 13:2, 199-207, DOI: 10.1080/16864360.2015.1084186 Parameters ---------- points : (n, 3) float Points in space. inwards : bool Whether to have the sphere inside or outside the mesh. normals : (n, 3) float or None Normals of the mesh at the given points if is None computed automatically. Returns ---------- centers : (n,3) float Centers of spheres radii : (n,) float Radii of spheres rrrnormals must be (n,3)!.number of points must equal number of normals!r-r0rFrrr.)!rrrrrrr5rRrronesboolroisinfdotrmaxrrrrS nan_to_numrnanrrr'r9rrrPcopyr )r"r#inwardsri thresholdmax_iterrradii not_convergedr< projectionsrcentersDconvergence_thresholdn_itern_pointsn_dists_n_facesdonediff old_radiicvgeds r*max_tangent_spherers>]]6 4F == ) )011--rzz:}}Wg..56 6 v;#g, &MN N '##M$$?$BC(D'2I OEGGCKt4MXXbhhy) *1 -ffT]]VY6 C ?? szz )vvEH$M ]];#5#5#78Fvvfay0&!92DEBFF61I-wz::EH. u}}R/C!DDDG "7GBHHUO t{{1~ A67A%M F     !f&7! &*ll&=&=g>T&U#'8 FF))..!7&:O!OVW.XY jj   ;@ bhh}-a067!66(--/ +D$7 T7#9: : "(!69ORW S '"a.:" E003HH;@ bhh}-a0789     !f&7< >r|cN[R"U[RS9n[R"US5(d [ S5eUbn[R"U[RS9n[R"US5(d [ S5e[ U5[ U5:wa [ S5eOUR[X5SnUS:Xa[XU(+US9upVUS-nU$US :Xa U(a [XU5$[XU*5$[ S 5e) a Find the thickness of the mesh at the given points. Parameters ---------- points : (n, 3) float Points in space exterior : bool Whether to compute the exterior thickness (a.k.a. reach) normals : (n, 3) float Normals of the mesh at the given points If is None computed automatically. method : string One of 'max_sphere' or 'ray' Returns ---------- thickness : (n,) float Thickness at given points. rrrrrr- max_sphere)r"r#rrirrz)Invalid method, use "max_sphere" or "ray") rrrrrrr5rRrrr)r"r#exteriorrimethod_centersradius thicknesss r*rrs ,]]6 4F == ) )011--rzz:}}Wg..56 6 v;#g, &MN N '##M$$?$BC -(lG QJ  5 tW5 5tgX6 6DEEr|)TNgư>d)FNr)rnumpyrr constantsrrgroupingrr1rr7r r scipy.spatialr BaseExceptionE exceptionsr r+rDr{r~rrrrrr|r*rs$6,"%*Z0*f^5BCLQQ$B3B3J,&`HKpf1FM",q!G"sA##B)A<<B