l j!ddlmZddlmZddlmZddlZerddlm Z ddl m Z m Z m Z mZmZGddZGd d ZdddZdS)) annotations) PriorityQueue) TYPE_CHECKINGN)Sequence)Point2D Point2D_Array Point2DLikePoint2DLike_ArrayPoint3DLike_Arrayc:eZdZdZddZdd ZddZddZddZdS)Polygonz Initializes the Polygon with the given rings. Parameters ---------- rings A sequence of points, where each sequence represents the rings of the polygon. Typically, multiple rings indicate holes in the polygon. ringsSequence[Point2DLike_Array]returnNonecd|D}tjd|D}tj|d|_tj|j|dz d|_tj|j||dzd|_tjtj|jd|dddz d|_|jtjd|j|j ddz |_ |jdddf|jdddf}}|jdddf|jdddf}}dtj ||tj ||z z|_ |j rr||z||zz }tj ||z|zd |j zz } tj ||z|zd |j zz } tj| | g|_dSdS) Nc6g|]}tj|Snpasarray.0rings P/home/agentuser/manim-venv/lib/python3.11/site-packages/manim/utils/polylabel.py z$Polygon.__init__..!s"(L(L(LdD)9)9(L(L(Lc(g|]}|jdS)r)shapers rrz$Polygon.__init__..#s===D$*Q-===rraxisij,ij->ig?g@)rcumsum concatenatearraydeletestartstopdiffeinsumreshapenormdotareasumcentroid) selfrnp_ringscsumxyxryrfactorcxcys r__init__zPolygon.__init__ s(L(Le(L(L(Ly==H===>>$&N8!$D$D$D %'Idj$($K$K$K #%9TZRq#Q#Q#Q #%9 GDJQ ' ' 'crcQQ$ $ $  $(9ry  490 0 '"a..$ z!!!Q$AAAqD!11111a4$)AAAqD/B"&B--"&Q--"?@ 9 /Vb1f_FR6)**cDIo>BR6)**cDIo>BHb"X..DMMM  / /rpointr floatc\tjd|j||jz }tj|dddd}tjtj|j|j|zz|z d}| |r|n| S)z9Compute the minimum distance from a point to the polygon.r$rr"r#r ) rr,r.r)clipr-minlinalgr+inside)r3r>scalarsclipsds rcompute_distancezPolygon.compute_distance:s)J 54:3EFFA&&..r1556 INN4: E(99EAN J J  KK&&.qqQB.rx_pointy_pointx0y0x1y1boolc0t|||cxkrt||krlnnit|||cxkrt||kr@nn=||z }||z }|||z z|||z zz } ttj| dSdS)zn Check if a point is on the segment. The segment is defined by (x0, y0) to (x1, y1). gF)rBmaxrOrisclose) r3rIrJrKrLrMrNdxdycrosss r_is_point_on_segmentzPolygon._is_point_on_segmentCs r2;;' 0 0 0 0SR[[ 0 0 0 0 0SR[[G6 6 6 6 s P P 6 6 6 6 6 bBbB'B,'"" *==E 5#..// /urct||k||kkr)||z ||z z }|||z z|z}t||kSdS)z Check if a horizontal ray to the right from point (x_point, y_point) crosses the segment. The segment is defined by (x0, y0) to (x1, y1). F)rO) r3rIrJrKrLrMrNslope x_intersects r_ray_crosses_segmentzPolygon._ray_crosses_segmentZsT Lb7l + +"Wb)E7R<025K+-.. .urc |\}}|jdddf|jdddf}}|jdddf|jdddf}}t|}t|D]7} ||||| || || || rdS8d} t|D]9} ||||| || || || r| dz } :| dzdkS)z Check if a point is inside the polygon. Uses ray casting algorithm and checks boundary points consistently. Nrr"T)r)r*lenrangerVrZ) r3r>point_xpoint_ystart_xstart_ystop_xstop_y segment_counti crossingss rrDzPolygon.insidens7 !:aaad+TZ1-=111a4$)AAAqD/G }%%  A((  q q  tt  }%%  A((  q q  Q 1}!!rN)rrrr)r>r rr?)rIr?rJr?rKr?rLr?rMr?rNr?rrO)r>r rrO) __name__ __module__ __qualname____doc__r=rHrVrZrDrrrr r s////4////.(""""""""""""rr c:eZdZdZdd Zdd ZddZddZddZdS)Cella A square in a mesh covering the :class:`~.Polygon` passed as an argument. Parameters ---------- c Center coordinates of the Cell. h Half-Size of the Cell. polygon :class:`~.Polygon` object for which the distance is computed. cr hr?polygonr rrctj||_||_||j|_|j|jtjdzz|_dSNr\)rrrnrorHrGsqrtp)r3rnrorps rr=z Cell.__init__sP*Q--))$&11$&271::--rotherrOc"|j|jkSNrGr3rus r__lt__z Cell.__lt__vrc"|j|jkSrwrxrys r__gt__z Cell.__gt__r{rc"|j|jkSrwrxrys r__le__z Cell.__le__v  rc"|j|jkSrwrxrys r__ge__z Cell.__ge__rrN)rnr ror?rpr rr)rurmrrO) rhrirjrkr=rzr}rrrrrrmrms  ....         !!!!!!!!!!rrm{Gz?rSequence[Point3DLike_Array] precisionr?rcpd|D}t|}tj|jd}tj|jd}||z }tj|}|dz }t } tjtj|d|d|tj|d|d|\} } tj| | gj D])} | t| |z||*t|j d|} t||dz zd|}|j| jkr|} tjddgddgddgddgg}| s| }|| kr|} |j| jz |kr|jdz }|j||zz}| t|d||| t|d||| t|d||| t|d||| | S) a Finds the pole of inaccessibility (the point that is farthest from the edges of the polygon) using an iterative grid-based approach. Parameters ---------- rings A list of lists, where each list is a sequence of points representing the rings of the polygon. Typically, multiple rings indicate holes in the polygon. precision The precision of the result (default is 0.01). Returns ------- Cell A Cell containing the pole of inaccessibility to a given precision. cNg|]"}tj|ddddf#Srrrrs rrzpolylabel..s3$O$O$ORZ%5%5aaa!e%<$O$O$Orrr g@r"r\r#)r rrBr'rQrmeshgridarangevstackravelTputrmr2rGemptygetrtrorn)rrr4rpminsmaxsdimssroqueuexvyvcornerbestbbox directionscelloffsetss r polylabelrs|&%P$O$O$O$OHhG 6'-a ( ( (D 6'-a ( ( (D $;D t A CA"/E [47DGQ7747DQRGUV9W9W X XFB)RXXZZ455700 $vz1g..////  !W - -D q!1g . .D vB8aWr1g1v>??Jkkmm 4yy{{ $;;D 6DF?Y & & AfzA~-G IId71:q'22 3 3 3 IId71:q'22 3 3 3 IId71:q'22 3 3 3 IId71:q'22 3 3 3kkmm 4 Kr)r)rrrr?rrm) __future__rrrtypingrnumpyrcollections.abcr manim.typingrrr r r r rmrrrrrs$""""""  (((((({"{"{"{"{"{"{"{"|!!!!!!!!B7777777r