B `3@sNdZddlZddlmZddlmZddlZGdddZGdddeZ dS) z' Mesh refinement for triangular grids. N)cbook) Triangulationc@seZdZdZddZdS) TriRefinera{ Abstract base class for classes implementing mesh refinement. A TriRefiner encapsulates a Triangulation object and provides tools for mesh refinement and interpolation. Derived classes must implement: - ``refine_triangulation(return_tri_index=False, **kwargs)`` , where the optional keyword arguments *kwargs* are defined in each TriRefiner concrete implementation, and which returns: - a refined triangulation, - optionally (depending on *return_tri_index*), for each point of the refined triangulation: the index of the initial triangulation triangle to which it belongs. - ``refine_field(z, triinterpolator=None, **kwargs)``, where: - *z* array of field values (to refine) defined at the base triangulation nodes, - *triinterpolator* is an optional `~matplotlib.tri.TriInterpolator`, - the other optional keyword arguments *kwargs* are defined in each TriRefiner concrete implementation; and which returns (as a tuple) a refined triangular mesh and the interpolated values of the field at the refined triangulation nodes. cCstjt|d||_dS)N) triangulation)r_check_isinstancer_triangulation)selfrr G/home/dcms/DCMS/lib/python3.7/site-packages/matplotlib/tri/trirefine.py__init__*szTriRefiner.__init__N)__name__ __module__ __qualname____doc__r r r r r r src@s:eZdZdZddZd ddZdd d Zedd d ZdS)UniformTriRefinerz Uniform mesh refinement by recursive subdivisions. Parameters ---------- triangulation : `~matplotlib.tri.Triangulation` The encapsulated triangulation (to be refined) cCst||dS)N)rr )rrr r r r =szUniformTriRefiner.__init__Fc Cs|j}|jjd}tj|tjd}x t|D]}|||\}}q,W|jjd}|j}|rtj |dtjd} |jj } | dkrt |d dd| |<n\| |} t || d dd| || ddf<t || d dd| || ddf<|| fS|SdS)a Compute an uniformly refined triangulation *refi_triangulation* of the encapsulated :attr:`triangulation`. This function refines the encapsulated triangulation by splitting each father triangle into 4 child sub-triangles built on the edges midside nodes, recursing *subdiv* times. In the end, each triangle is hence divided into ``4**subdiv`` child triangles. Parameters ---------- return_tri_index : bool, default: False Whether an index table indicating the father triangle index of each point is returned. subdiv : int, default: 3 Recursion level for the subdivision. Each triangle is divided into ``4**subdiv`` child triangles; hence, the default results in 64 refined subtriangles for each triangle of the initial triangulation. Returns ------- refi_triangulation : `~matplotlib.tri.Triangulation` The refined triangulation. found_index : int array Index of the initial triangulation containing triangle, for each point of *refi_triangulation*. Returned only if *return_tri_index* is set to True. r)dtypeNr) r trianglesshapenparangeint32range_refine_triangulation_oncexfullmaskrepeatZreshape) rreturn_tri_indexsubdivZrefi_triangulationntri ancestors_ refi_nptsZrefi_triangles found_indexZtri_maskZ ancestor_maskr r r refine_triangulation@s*     z&UniformTriRefiner.refine_triangulationNcCsb|dkrtj|j|}ntjtjj|d|}|j|dd\}}|j|j |j |dd}||fS)a Refine a field defined on the encapsulated triangulation. Parameters ---------- z : 1d-array-like of length ``n_points`` Values of the field to refine, defined at the nodes of the encapsulated triangulation. (``n_points`` is the number of points in the initial triangulation) triinterpolator : `~matplotlib.tri.TriInterpolator`, optional Interpolator used for field interpolation. If not specified, a `~matplotlib.tri.CubicTriInterpolator` will be used. subdiv : int, default: 3 Recursion level for the subdivision. Each triangle is divided into ``4**subdiv`` child triangles. Returns ------- refi_tri : `~matplotlib.tri.Triangulation` The returned refined triangulation. refi_z : 1d array of length: *refi_tri* node count. The returned interpolated field (at *refi_tri* nodes). N)triinterpolatorT)r r)Z tri_indexr) matplotlibZtriZCubicTriInterpolatorrrrZTriInterpolatorr&Z_interpolate_multikeysry)rzr'r ZinterpZrefi_trir%Zrefi_zr r r refine_fields  zUniformTriRefiner.refine_fieldc$ Cs|j}|j}|j}|j}t|d}t|d}|dk rrt|}t||fkrrtdt|t|t |dk}d||d} || } t | } t | } || d|<|| d|<t tj |tj dd} ttj dtj d|}|| |f}| |k}| |}||}||||f||||ddfd }||||f||||ddfd }|| |d<|| |d<|}tj|dgtj d}|}xXtdD]L}||k}t |}||}tj |tj d||dd|f|<||7}qWt|}| |}||}t||ddft|tjdtj d}tj|dd } ||}!||| f|||!f<tj|d dgtj d}"t|dddf|dddf|dddfgj|"ddd ddf<t|dddf|dddf|dddfgj|"ddd ddf<t|dddf|dddf|dddfgj|"ddd ddf<t|dddf|dddf|dddfgj|"ddd ddf<t| | |"}#|jdk r|#t|jd |dkr|#S|#t|d fSdS) a Refine a `.Triangulation` by splitting each triangle into 4 child-masked_triangles built on the edges midside nodes. Masked triangles, if present, are also split, but their children returned masked. If *ancestors* is not provided, returns only a new triangulation: child_triangulation. If the array-like key table *ancestor* is given, it shall be of shape (ntri,) where ntri is the number of *triangulation* masked_triangles. In this case, the function returns (child_triangulation, child_ancestors) child_ancestors is defined so that the 4 child masked_triangles share the same index as their father: child_ancestors.shape = (4 * ntri,). rNzYIncompatible shapes provide for triangulation.masked_triangles and ancestors: {0} and {1}rr)rg?)Zaxis)rr) neighborsrrrZasarray ValueErrorformatsumzerosZtilerrremptyrZ logical_notabsouterZonesZargminZvstackTrrZset_mask)$rr"rr)r/rZnptsr!ZbordersZ added_ptsr$Zrefi_xZrefi_yZ edge_elemsZ edge_apexesZedge_neighborsZ mask_mastersZmastersZ apex_mastersZx_addZy_addZ new_pt_cornerZnew_pt_midsideZcum_sumZimidZ mask_st_locZ n_masters_locZelem_masters_locZ mask_slavesZslavesZslaves_mastersZ diff_tableZslave_masters_apexZ slaves_apexZchild_trianglesZchild_triangulationr r r rs           ((((   z,UniformTriRefiner._refine_triangulation_once)Fr)Nr)N) r r rrr r&r+ staticmethodrr r r r r/s  E &r) rnumpyrr(rZmatplotlib.tri.triangulationrZmatplotlib.tri.triinterpolaterrr r r r s   #