Faces from simplices
Take a list of maximal simplices (by default a triangulation of a cube into 6 tetrahedra) and computes all faces
Parameters : | maximal : sequence of sequences, optional
|
---|---|
Returns : | faces : dict |
Cube in an array of voxels with a given center and strides.
This triangulates a cube with vertices [center[i] + 1].
The dimension of the cube is determined by len(center) which should agree with len(center).
The allowable dimensions are [1,2,3].
Parameters : | center : (d,) sequence of int, optional
strides : (d,) sequence of int, optional
|
---|---|
Returns : | complex : dict
|
Return all (dim-1)-dimensional simplices in a triangulation of a square of a given shape. The vertices in the triangulation are indices in a ‘flattened’ array of the specified shape.
Return all (dim-1)-dimensional simplices in a triangulation of a cube of a given shape. The vertices in the triangulation are indices in a ‘flattened’ array of the specified shape.
Join a sequence of simplicial complexes.
Returns the union of all the particular faces.