ó m[c@`srddlmZmZmZmZddlZddljZddlj Z ddl Z de fd„ƒYZ dS(i(tabsolute_importtdivisiontprint_functiontunicode_literalsNt TriangulationcB`sweZdZd d d„Zd„Zed„ƒZd„Zd„Z e d„ƒZ d„Z ed„ƒZ d „ZRS( u An unstructured triangular grid consisting of npoints points and ntri triangles. The triangles can either be specified by the user or automatically generated using a Delaunay triangulation. Parameters ---------- x, y : array_like of shape (npoints) Coordinates of grid points. triangles : integer array_like of shape (ntri, 3), optional For each triangle, the indices of the three points that make up the triangle, ordered in an anticlockwise manner. If not specified, the Delaunay triangulation is calculated. mask : boolean array_like of shape (ntri), optional Which triangles are masked out. Attributes ---------- `edges` `neighbors` is_delaunay : bool Whether the Triangulation is a calculated Delaunay triangulation (where `triangles` was not specified) or not. Notes ----- For a Triangulation to be valid it must not have duplicate points, triangles formed from colinear points, or overlapping triangles. cC`sÝtj|dtjƒ|_tj|dtjƒ|_|jj|jjks`|jjdkrotdƒ‚nd|_ d|_ d|_ t |_ |dkrÉtj||ƒ\|_|_ t|_ n©tj|dtjddƒ|_|jjdks|jjddkr!tdƒ‚n|jjƒt|jƒkrNtd ƒ‚n|jjƒd krrtd ƒ‚n|dk rÇtj|dtƒ|_ |j j|jjd fkrÇtd ƒ‚qÇnd|_d|_dS( Ntdtypeiu'x and y must be equal-length 1-D arraystorderuCiiutriangles must be a (?,3) arrayu&triangles max element is out of boundsiu&triangles min element is out of boundsu3mask array must have same length as triangles array(tnptasarraytfloat64txtytshapetndimt ValueErrortNonetmaskt_edgest _neighborstFalset is_delaunayt_qhulltdelaunayt trianglestTruetarraytint32tmaxtlentmintboolt_cpp_triangulationt _trifinder(tselfR R RR((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pyt__init__)s0*      !(  cC`s|jƒj|ƒS(ub Calculate plane equation coefficients for all unmasked triangles from the point (x,y) coordinates and specified z-array of shape (npoints). Returned array has shape (npoints,3) and allows z-value at (x,y) position in triangle tri to be calculated using z = array[tri,0]*x + array[tri,1]*y + array[tri,2]. (tget_cpp_triangulationtcalculate_plane_coefficients(R!tz((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pyR$PscC`s.|jdkr'|jƒjƒ|_n|jS(uñ Return integer array of shape (nedges,2) containing all edges of non-masked triangles. Each edge is the start point index and end point index. Each edge (start,end and end,start) appears only once. N(RRR#t get_edges(R!((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pytedgesZs cC`sS|jdkrLtj|j|j|j|j|j|j |j ƒ|_n|jS(N( RRt_triRR R RRRRR(R!((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pyR#gs cC`s7|jdk r,|jjd|jddƒS|jSdS(uC Return an array of triangles that are not masked. itaxisiN(RRRtcompress(R!((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pytget_masked_trianglespscO`s`t|dtƒr*|d}|d}n)|d}|d}|d}|jddƒ}t}|dkr‘t|ƒdkr‘|d}t}n|dk rÖytj|dtj ƒ}WqÖt k rÒd}qÖXn|dk r |j dks|j ddkr d}n|dk r,|r,|d}n|jddƒ}t||||ƒ}|||fS( uÎ Return a Triangulation object from the args and kwargs, and the remaining args and kwargs with the consumed values removed. There are two alternatives: either the first argument is a Triangulation object, in which case it is returned, or the args and kwargs are sufficient to create a new Triangulation to return. In the latter case, see Triangulation.__init__ for the possible args and kwargs. iiiu trianglesRiumaskN( t isinstanceRtpopRRRRRRRRR R (targstkwargst triangulationR R Rt from_argsR((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pytget_from_args_and_kwargsys0             cC`s8|jdkr1ddlm}||ƒ|_n|jS(uà Return the default :class:`matplotlib.tri.TriFinder` of this triangulation, creating it if necessary. This allows the same TriFinder object to be easily shared. i(tTrapezoidMapTriFinderN(R Rtmatplotlib.tri.trifinderR3(R!R3((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pyt get_trifinder§scC`s.|jdkr'|jƒjƒ|_n|jS(u Return integer array of shape (ntri,3) containing neighbor triangles. For each triangle, the indices of the three triangles that share the same edges, or -1 if there is no such neighboring triangle. neighbors[i,j] is the triangle that is the neighbor to the edge from point index triangles[i,j] to point index triangles[i,(j+1)%3]. N(RRR#t get_neighbors(R!((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pyt neighbors³s cC`s¸|dkrd|_nFtj|dtƒ|_|jj|jjdfkr^tdƒ‚n|jdk rƒ|jj |jƒnd|_ d|_ |j dk r´|j j ƒndS(up Set or clear the mask array. This is either None, or a boolean array of shape (ntri). Riu3mask array must have same length as triangles arrayN(RRRRRR RRRtset_maskRRR t _initialize(R!R((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pyR8Ãs    N(t__name__t __module__t__doc__RR"R$tpropertyR'R#R+t staticmethodR2R5R7R8(((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pyR s'  . (t __future__RRRRtsixtmatplotlib._triR(tmatplotlib._qhullRtnumpyRtobjectR(((s;lib/python2.7/site-packages/matplotlib/tri/triangulation.pyts "