Extract Unique Rows
Conversion of Barycentric to Cartesian coordinates
Conversion of Cartesian to Barycentric coordinates.
Compute smallest convex hull that encloses a set of points
Delaunay triangulation in N-dimensions The Delaunay triangulation is a tessellation of the convex hull of the points such that no N-sphere defined by the N-triangles contains any other points from the set.
A simple mesh generator for non-convex regions
A simple mesh generator for non-convex regions in n-D space
Compute the dot product of two vectors
Retrieve or set a list of array element values
Compute external- or 'cross'- product of 3D vectors.
Test if points lie in convex hull
Row-wise matrix functions
Circle distance function
Difference, union and intesection operation on two regions
Rectangle distance function
Sphere distance function
Uniform desired edge length
Determines area of a polygon by triangle method.
Generate various point distributions
Find surface triangles from tetrahedra mesh
Render tetrahedron mesh (3D)
Display triangles mesh (2D)
Search for the enclosing Delaunay convex hull
Search for the enclosing Delaunay convex hull