Nodal edge directions are computed by simple averaging of direction vectors of edges a node is contained in. Edges are assumed to be straight and a node must be on a single edge (a border node) or shared by exactly two edges.
Nodal normals are computed by simple averaging of element normals of elements every node is contained in.
Extend cell data defined in a region to the whole domain.
Parameters: | data : array
domain : FEDomain instance
rname : str
val : float, optional
is_surface : bool
average_surface : bool
|
---|---|
Returns: | edata : array
|
Get all edge paths in a graph with non-masked vertices. The mask is updated.
Get a reasonable minimal value of DOFs suitable for extending over a whole domain.
Return the inverse of remap, i.e. a mapping from a sub-range indices to a full range, see prepare_remap().
Prepare vector for remapping range [0, n_full] to its subset given by indices.
Prepare vector for translating old_indices to new_indices.
Returns: | translate : array
|
---|
Uniformly refine level-times a mesh given by filename.
The refined mesh is saved to a file with name constructed from base name of filename and level-times appended ‘_r’ suffix.
Parameters: | filename : str
level : int
|
---|