j@ dZddlZddlmZmZmZddlmZddl m Z m Z ddl m Z ddlmZmZmZmZmZmZmZd efd Zd eed ed eefdZ d&d edededeedeej0f dZd'd ededeefdZd(d ededefdZd)d edefdZd*d ededefdZ d+d ededeej*eej*ffdZ d,d eded ed!efd"Z d-d eded#eed$ede!f d%Z"y).z@ segments.py -------------- Deal with (n, 2, 3) line segments. N)geometrytransformationsutil)tol) group_rows unique_rows)union) ArrayLikeIntegerNDArrayNumberOptionalUnionfloat64segmentsctj|tj}tj|dst d|j |dddf}|dddf|z }tj|}||jdz}tj||}||jd| zz}tj|||zf}tj|d \}}||jdz}|||fS) a6 For 3D line segments defined by two points, turn them in to an origin defined as the closest point along the line to the zero origin as well as a direction vector and start and end parameter. Parameters ------------ segments : (n, 2, 3) float Line segments defined by start and end points Returns -------------- origins : (n, 3) float Point on line closest to [0, 0, 0] vectors : (n, 3) float Unit line directions parameters : (n, 2) float Start and end distance pairs for each line dtype)r)rzincorrect segment shape!NrrrT) return_sign) np asanyarrayrris_shape ValueErrorshaperow_normreshape diagonal_dot column_stackvector_hemisphere)rendpointvectors vectors_normoffsetorigins parameterssignss B/DATA/.local/lib/python3.12/site-packages/trimesh/path/segments.pysegments_to_parametersr-s*}}XRZZ8H ==? 33X^^DD1~Hq!tnx'G==)L |##G,,G  x 1F&..1WH<=G&&<*?!@AJ++GFNGU%--((J GZ ''r)r&r*c tj|tj}tj|tj}tj|tj}tj|||ddddfzz|||ddddfzzf}|j dd|j dfS)a Convert a parametric line segment representation to a two point line segment representation Parameters ------------ origins : (n, 3) float Line origin point vectors : (n, 3) float Unit line directions parameters : (n, 2) float Start and end distance pairs for each line Returns -------------- segments : (n, 2, 3) float Line segments defined by start and end points rNrrr)rrrhstackr!r)r)r&r*rs r,parameters_to_segmentsr1>s,mmG2::6GmmG2::6Gz 2F}} VRUU/fcPU1VH XHzz1YY^^ QK<* +hqk!\1:L.M MTU$ #1#+  J/0 Or.digitsc t|\}}}|jdttj||f|}|Dcgc]-}t ||||dddfj d/}}tjt||Dcgc]\}}|dt|c}}} t|| || tj|Scc}wcc}}w) a7 Clean up line segments by unioning the ranges of colinear segments. Parameters ------------ segments : (n, 2, 2) or (n, 2, 3) Line segments in space. digits How many digits to consider. Returns ----------- cleaned : (m, 2, 2) or (m, 2, 3) Where `m <= n` rr>rUNrF)sort)r)r&r*) r-rXrrr#r argsort concatenateziplenr1vstack) rrUr)r&paramgroupsgunionsuindexess r,cleanrds&5X>GWe JJAJ'(:;F KFNT TVeE!HU1Xad^3356UCVF Tnnc&&6IJ6Idaa#a&k6IJKG " ''*:ryyQWGX  UJs 2C!C& pointsr<c tj|tj}tj|tj}|jd|jdf}|dddddf|dddddfz dzj ddz}tj t|t}g}|D]}||z dzj djd dz}tjtj||j d| tj|d | jd} | jstj|| }|| D].} |j|| dg|j|| dg0t|dkDrtj|||fS|S) aK Find any points that lie on a segment (not an endpoint) and then split that segment into two segments. We are basically going to find the distance between point and both segment vertex, and see if it is with tolerance of the segment length. Parameters -------------- segments : (n, 2, (2, 3) float Line segments in space points : (n, (2, 3)) float Points in space atol : float Absolute tolerance for distances Returns ------------- split : (n, 2, (3 | 3) float Line segments in space, split at vertices rrrNrrr>g?rrr;r=)rrrr!rsumonesr\bool logical_andrrEanyappendr]) rrer<seg_flatr4keepnew_segppairon_segsegs r,splitrus0]]6 4F}}XRZZ8HX^^A%6 78H1a 8Aq!G#44: ? ?Q ? G3 NF 773x= -DG A!#((a(088ASH LLq!1 = \\$$ / 3 3 3 ; ;  ::<>>$0D'3q6{+3q6{+(%, 7|ayy(4.'233r.ctj|tj}t|j d|j df|dj d}|j dtjt|t}d|t|d <d ||d d d f|d d dfk(<||}|S) a; Find unique non-zero line segments. Parameters ------------ segments : (n, 2, (2|3)) float Line segments in space digits : int How many digits to consider when merging vertices Returns ----------- unique : (m, 2, (2|3)) float Segments with duplicates merged rrrrWrrgr>TrFN) rrrr r!rrXzerosr\rj)rrUinversemaskuniques r,rzrzs }}XRZZ8H(**Bq0A+BCFS  gg  LLaL 88CM .D$(DW a !+0DA'!Q$- '( d^F Mr.height double_sidedc tj|tj}tj|ds t dtj tj|jddjdtjd|d|gt|f}tjgdt|dftjt|jd d zzjd }|r*tj|tj|f}||fS) a Extrude 2D line segments into 3D triangles. Parameters ------------- segments : (n, 2, 2) float 2D line segments height : float Distance to extrude along Z double_sided : bool If true, return 4 triangles per segment Returns ------------- vertices : (n, 3) float Vertices in space faces : (n, 3) int Indices of vertices forming triangles rrrrzsegments shape incorrectrgrr)rrrrrrrr)rr) rrrrrrr#tiler!r\aranger]fliplr)rr{r|verticesfacess r,extruder5s(}}XRZZ8H ==: .344 GGH$$W-q 1 9 9' B GGQ6*CM : H "S]A$67 ))CM " * *7 3a 7 8 gg  5"))E"234 U?r.summedctj|tj}tj|dddddf|dddddfz }|r|j S|S)a3 Return the lengths of an array of line segments. Parameters ------------- segments : (n, 2, 2) float 2D line segments summed Return the total length, not the per-segment length. Returns ------------- length Either total length or per-segment length. rNrr)rrrrr rh)rrnormss r,r4r4asU$}}XRZZ8H MM(1a7+hq!Qw.?? @E yy{ Lr.maxlen return_index return_countc t|}tj|tj}t |j dk7rt |j d|j d}|dddf}|dddf}||z }tjtj||z jtj}g} g} tj} tjtj|jdz} tj |D]} || k(}||| z }| || dzj#d|f| tj| dzt |j#d z}| ||| dzj#d|f}||zj#d| dz|f}| j%|dd| d| f|rwtj&|dj#d }| j)tj*t || ftj|zj-t.j0sFt3|||D]A\}}tj4|d|dsJtj4|d|drAJtj4tjtj| dz| d| rJtj6| g} t.j0r/tj8t;|t;| dd sJ|r}tj6| } t.j0rGt | t | dk(sJt=| t=t?t |k(sJ| j)| |r| j)|t | dk(r| dS| S) a Resample line segments until no segment is longer than maxlen. Parameters ------------- segments : (n, 2, 2|3) float 2D line segments maxlen : float The maximum length of a line segment return_index : bool Return the index of the source segment return_count : bool Return how many segments each original was split into Returns ------------- resampled : (m, 2, 2|3) float Line segments where no segment is longer than maxlen index : (m,) int [OPTIONAL] The index of segments resampled came from count : (n,) int [OPTIONAL] The count of the original segments rrz != (n, 2, 2|3)rNrrrrgMbP?r;) floatrarrayrr\rrceilrr astypeint64r stack_linesrmaxrzr!extendnonzerormriravelrstrictr[allcloserZrEr4setrange)rrrr dimensionpt1pt2vecsplitsresultindexrstacksrury incrementvopolyindex_originaloriginalrecons r,resamplerzsh>6]Fxx 3H 8>>aHNN+?;<<q!I 1a4.C 1a4.C )C WWT]]3'&0 1 8 8 BFF E 77D   bii q(89 :F6"I% EAI & . .I ?$ IIeai #i.C ''   TEAI & . .I ?AEAIy9:  d1fVen,-. ZZ-a088AN LL#d)U+288<~MTTV  ::$'x~t#<%{{8A;a999{{8B<r;;;$=;;t// %!)0DEvfu~V VVA#FnnV$ %F zzzz&*F6!9,=DIIIu% ::u:VAY/ //u:U3x=%9!:: :: e f 6{aay Mr.matrixmergec tj|d}tj|ds t d|5t j |jd|jd}|r t||}djd d tt|zd z}|t|zj|j}|S) a Convert (n, 2, 2) line segments to an SVG path string. Parameters ------------ segments : (n, 2, 2) float Line segments to convert digits : int Number of digits to include in SVG string matrix : None or (3, 3) float Homogeneous 2D transformation to apply before export Returns ----------- path : str SVG path string with one line per segment IE: 'M 0.1 0.2 L 10 12' T)copyr~zonly for (n, 2, 2) segments!rg)rrWzM_ _L_ __z{:0.zf})rrrrrrtransform_pointsr!rzreplacestrintr\formatr)rrUrrbasers r,to_svgrs0xxt,H ==: .788"33   W %f '*   (62   c6CF ,<#))F)T)FF)rNT)#__doc__numpyrrrr constantsrgroupingrr intervalr typedr r r rrrrr-r1rrTrdrurzrjrr4rrrr.r,rs...QQQ*(Y*(Z7 W 7(17?Fw?O7H# FF F F V  F  RXX FR#I#w#8H#L?I?y??D!Y!!H)i))t)Z)-!% 2::wrzz* *+8 qq qq ql"& ++ + Y +  +  +r.