h>>nUddlmZddlmZmZmZmZmZddlZddl m Z m Z ddl Z ddlmZmZmZmZmZmZmZmZmZddlZgdZdZGdd eZdd ZGd d e ZGd dZ d ddZ d ddZ ddZ!eee"e"e"fefZ#de$d<GddZ%Gdde%Z&Gdde%Z'y)) annotations)IterableTupleIteratorSequenceDictN)Protocol TypeAlias) Vec2Vec3UVecNULLVECintersection_line_line_2d BoundingBox2dintersection_line_line_3d BoundingBoxAbstractBoundingBox)ConstructionPolyline ApproxParamTintersect_polylines_2dintersect_polylines_3dg& .>ceZdZdZdef ddZddZddZdZe ddZ e ddZ dd Z dd Z dd Zdd Zdd ZddZ d ddZy)raConstruction tool for 3D polylines. A polyline construction tool to measure, interpolate and divide anything that can be approximated or flattened into vertices. This is an immutable data structure which supports the :class:`Sequence` interface. Args: vertices: iterable of polyline vertices close: ``True`` to close the polyline (first vertex == last vertex) rel_tol: relative tolerance for floating point comparisons Example to measure or divide a SPLINE entity:: import ezdxf from ezdxf.math import ConstructionPolyline doc = ezdxf.readfile("your.dxf") msp = doc.modelspace() spline = msp.query("SPLINE").first if spline is not None: polyline = ConstructionPolyline(spline.flattening(0.01)) print(f"Entity {spline} has an approximated length of {polyline.length}") # get dividing points with a distance of 1.0 drawing unit to each other points = list(polyline.divide_by_length(1.0)) Fc t||_tj|}||_|rEt |dkDr7|dj |d|js|j|dt||_y)Nrrel_tol) float_rel_tolr list _verticesleniscloseappend _distances)selfverticescloserv3lists 3lib/python3.12/site-packages/ezdxf/math/polyline.py__init__zConstructionPolyline.__init__Fsl g !YYx0%+ S[1_!9$$VBZ$G fQi('1&'9c,t|jS)z len(self))r"r!r&s r*__len__zConstructionPolyline.__len__Us4>>""r,c,t|jS)z iter(self))iterr!r.s r*__iter__zConstructionPolyline.__iter__YsDNN##r,ct|tr|j|S|j|j||jS)zvertex = self[item]r) isinstanceintr! __class__r)r&items r* __getitem__z ConstructionPolyline.__getitem__]s; dC >>$' '>>$.."6 >N Nr,c:|jr|jdSy)z+Returns the overall length of the polyline.r)r%r.s r*lengthzConstructionPolyline.lengthds ????2& &r,ct|jdkDr7|jdj|jd|jSy)zZReturns ``True`` if the polyline is closed (first vertex == last vertex). rrrrF)r"r!r#rr.s r* is_closedzConstructionPolyline.is_closedksM t~~  ">>!$,,r"DMM- r,c|j}|s td|j}|dk(rdd|dfS||dz }||}||}|||z |fS)zReturns the tuple (distance from start, distance from previous vertex, vertex). All distances measured along the polyline. zempty polylinerr:)r! ValueErrorr%)r&indexr' distances prev_distancecurrent_distancevertexs r*datazConstructionPolyline.datavsr>>-. .OO A:Xa[( (!%!), $U+%!1M!A6IIr,c~|dkry||jk\rtdt|dz S|j|S)zReturns the data index of the exact or next data entry for the given `distance`. Returns the index of last entry if `distance` > :attr:`length`. r:rr?)r;maxr" _index_atr&distances r*index_atzConstructionPolyline.index_ats> s? t{{ "q#d)a-( (~~h''r,cBtj|j|SN)bisect bisect_leftr%rJs r*rIzConstructionPolyline._index_ats!!$//8<X 345 5 t~~  "DE Ex((r,c,|j}|j}|j|}|dk(r|dS|dz }||}||}|dkDr||k(r|dz}||}|dkDr||k(r||k(r td||z ||z z }||j |||S)Nrr?zinternal interpolation error)factor)r!r%rIArithmeticErrorlerp) r&rKr'rBindex1index0 distance1 distance0rVs r*rSzConstructionPolyline._vertex_ats>>OO ) Q;A; !f% f% qjY)3 aKF!&)IqjY)3  !!"@A AY&9y+@A$$Xf%5f$EEr,c#K|dkrtd||j}tjd|j|D] }||yw)zReturns `count` interpolated vertices along the polyline. Argument `count` has to be greater than 2 and the start- and end vertices are always included. rzinvalid count: r:N)r@rSnplinspacer;)r&countrTrKs r*dividezConstructionPolyline.dividesP 19ug67 7OO  Ce :  : : :#$O J (=)F( &16%%)-% %r,rcd}g}t}|D]=}|r&||z }||jz }|j|n|j||}?|S)Nr:)r magnituder$)r'current_stationrB prev_vertexrE distant_vecs r*r%r%sc OI&K  ;.K {44 4O   _ -   _ -  r,ceZdZddZy)SupportsPointMethodcyrNrp)r&ts r*pointzSupportsPointMethod.points r,N)ryrrgr )rjrkrlrzrpr,r*rwrws r,rwc^eZdZdZddd d dZed dZed dZddZdd Z y )ra9Approximation tool for parametrized curves. - approximate parameter `t` for a given distance from the start of the curve - approximate the distance for a given parameter `t` from the start of the curve These approximations can be applied to all parametrized curves which provide a :meth:`point` method, like :class:`Bezier4P`, :class:`Bezier3P` and :class:`BSpline`. The approximation is based on equally spaced parameters from 0 to `max_t` for a given segment count. The :meth:`flattening` method can not be used for the curve approximation, because the required parameter `t` is not logged by the flattening process. Args: curve: curve object, requires a method :meth:`point` max_t: the max. parameter value segments: count of approximation segments g?d)max_tsegmentsc tdsJ|dkDsJtfdtjd||dzD|_||_||z |_y)Nrzrc3@K|]}j|ywrN)rz).0rycurves r* z(ApproxParamT.__init__..s. $IqEKKN$Isr:r?)hasattrrr^r_ _polyline_max_t_step)r&rr}r~s ` r*r+zApproxParamT.__init__s`ug&&&!||-. $&KKUHqL$I.   X% r,c|jSrN)rr.s r*r}zApproxParamT.max_ts {{r,c|jSrN)rr.s r*polylinezApproxParamT.polylines ~~r,c|j}||jk\r |jS|j}|j |}|j |\}}}||z}|dkDr||||z z|z z}t |j|S)z^Approximate parameter t for the given `distance` from the start of the curve. g-q=)rr;rrrLrFmin) r&rKpolyt_stepistationd0_rys r*param_tzApproxParamT.param_ts~~ t{{ ";;  MM( #1Q QJ : 7X-.3 3A4;;""r,c|dkry|j}||jk\r |jS|j}t ||z dz}|j |\}}}||||z|z z|z z S)zdApproximate the distance from the start of the curve to the point `t` on the curve. r:r?)rrr;rr5rF)r&ryrsteprArrrs r*rKzApproxParamT.distance-sz 8~~  ;; zzAH !5)Qte|a/04777r,N)rrwr}rr~r5ri)rgr)rKr)ryrrgr) rjrkrlrmr+ror}rrrKrpr,r*rrsb2 &" & &  &# 8r,rcTt|||}|j|jS)aVReturns the intersection points for two polylines as list of :class:`Vec2` objects, the list is empty if no intersection points exist. Does not return self intersection points of `p1` or `p2`. Duplicate intersection points are removed from the result list, but the list does not have a particular order! You can sort the result list by :code:`result.sort()` to introduce an order. Args: p1: first polyline as sequence of :class:`Vec2` objects p2: second polyline as sequence of :class:`Vec2` objects abs_tol: absolute tolerance for comparisons )_PolylineIntersection2dexecute intersectionsp1p2abs_tol intersects r*rr=* (B8I   " ""r,cTt|||}|j|jS)aVReturns the intersection points for two polylines as list of :class:`Vec3` objects, the list is empty if no intersection points exist. Does not return self intersection points of `p1` or `p2`. Duplicate intersection points are removed from the result list, but the list does not have a particular order! You can sort the result list by :code:`result.sort()` to introduce an order. Args: p1: first polyline as sequence of :class:`Vec3` objects p2: second polyline as sequence of :class:`Vec3` objects abs_tol: absolute tolerance for comparisons )_PolylineIntersection3drrrs r*rrRrr,c||zdz}||||fS)Nrrp)abms r*rarags Q1 A aA:r,r TCacheceZdZUded<ded<d dZej d dZej d dZd dZ ddZ d d Z y )_PolylineIntersectionrrrci|_yrN) bbox_cacher.s r*r+z_PolylineIntersection.__init__ss #%r,cyrNrpr&pointss r*bboxz_PolylineIntersection.bboxx r,cyrNrp)r&s1e1s2e2s r*line_intersectionz'_PolylineIntersection.line_intersection|rr,ct|j}t|j}|dks|dkry|jd|dz d|dz y)Nrrr?)r"rrr)r&l1l2s r*rz_PolylineIntersection.executesFdgg,dgg, 6R!V  q"q&!R!V,r,c^|dz }|dz }||z dks||z dkry|j}d||f}|j|}|#|j|j||}|||<d||f}|j|} | #|j|j||} | ||<|j | S)Nr?rF)rgetrrr has_overlap) r&rrrrcachekey1bbox1key2bbox2s r*overlapz_PolylineIntersection.overlaps a a 7Q;"r'A+2r{ $ =IIdggbn-EE$K2r{ $ =IIdggbn-EE$K  ''r,c||kDr||kDsJ||z dk(r||z dk(r|j||||yt||\}}}}t||\} } } } |j||| | r|j||| | |j||| | r|j||| | |j||| | r|j||| | |j||| | r|j||| | yy)Nr?)rrarr) r&rrrrs1_ae1_bs1_ce1_ds2_ae2_bs2_ce2_ds r*rz_PolylineIntersection.intersectsBw27"" 7a.'% :LBAIIb$,,I /:L'*)rrrranyrr$r&rrrrline1line2rs` @r*rz)_PolylineIntersection2d.line_intersection TWWR[( TWWR[( % 5%  =% :>:L:L% "     % %a (" =r,g|=)rSequence[Vec2]rrrrrjrkrlr+rr __classcell__r6s@r*rrs% )r,rc2eZdZddfd ZddZddZxZS)rcZt|||_||_g|_||_yrNrrs r*r+z _PolylineIntersection3d.__init__rr,ct|SrN)rrs r*rz_PolylineIntersection3d.bboxs 6""r,c.j|j|f}j|j|f}t||dj.rr)rrrrrrr$rs` @r*rz)_PolylineIntersection3d.line_intersectionrr,r)rSequence[Vec3]rrrrrrs@r*rrs# )r,r)r'zIterable[Vec3]rgz list[float]r)rrrrrgz list[Vec2])rrrrrgz list[Vec3])rr5rr5rgztuple[int, int, int, int])( __future__rtypingrrrrrrtyping_extensionsr r numpyr^ ezdxf.mathr r r rrrrrrrO__all__rnrr%rwrrrrar5rrrrrrpr,r*rs# 1     o%8o%d   ( J8J8\5:##*##,5:##*##* sC}-/BBC C=3=3@)3).)3)r,