convhulln
(Package: geometry) :
Compute smallest convex hull that encloses a set of points
Returns an index matrix to the points of simplices (“triangles”) that form the smallest convex simplicial complex of a set of input points in N-dimensional space. This function interfaces the Qhull library.
● Data Source:
CranContrib
● Keywords: dplot, graphs, math
● Alias: convhulln
●
0 images
|
cart2bary
(Package: geometry) :
Conversion of Cartesian to Barycentric coordinates.
Given the Cartesian coordinates of one or more points, compute the barycentric coordinates of these points with respect to a simplex.
● Data Source:
CranContrib
● Keywords:
● Alias: cart2bary
●
0 images
|
trimesh
(Package: geometry) :
Display triangles mesh (2D)
trimesh(T, p) displays the triangles defined in the m-by-3 matrix T and points p as a mesh. Each row of T specifies a triangle by giving the 3 indices of its points in X.
● Data Source:
CranContrib
● Keywords: hplot
● Alias: trimesh
●
0 images
|
extprod3d
(Package: geometry) :
Compute external- or `cross'- product of 3D vectors.
Computes the external product
● Data Source:
CranContrib
● Keywords: arith, array, math
● Alias: extprod3d
●
0 images
|
dot
(Package: geometry) :
Compute the dot product of two vectors
If x and y are matrices, calculate the dot-product along the first non-singleton dimension. If the optional argument d is given, calculate the dot-product along this dimension.
● Data Source:
CranContrib
● Keywords: arith, array, math
● Alias: dot
●
0 images
|
tsearchn
(Package: geometry) :
Search for the enclosing Delaunay convex hull
For t = delaunayn(x), where x is a set of points in d dimensions, tsearchn(x, t, xi) finds the index in t containing the points xi. For points outside the convex hull, idx is NA. tsearchn also returns the barycentric coordinates p of the enclosing triangles.
● Data Source:
CranContrib
● Keywords:
● Alias: tsearchn
●
0 images
|
mesh.hunif
(Package: geometry) :
Uniform desired edge length
Uniform desired edge length function of position to allow easy definition of regions when passed as the fh argument of distmesh2d or distmeshnd.
● Data Source:
CranContrib
● Keywords:
● Alias: mesh.hunif
●
0 images
|
polyarea
(Package: geometry) :
Determines area of a polygon by triangle method.
Determines area of a polygon by triangle method. The variables x and y define the vertex pairs, and must therefore have the same shape. They can be either vectors or arrays. If they are arrays then the columns of x and y are treated separately and an area returned for each.
● Data Source:
CranContrib
● Keywords:
● Alias: polyarea
●
0 images
|
surf.tri
(Package: geometry) :
Find surface triangles from tetrahedra mesh
Find surface triangles from tetrahedron mesh typically obtained with delaunayn.
● Data Source:
CranContrib
● Keywords: dplot, math, optimize
● Alias: surf.tri
●
0 images
|
mesh.diff
(Package: geometry) :
Difference, union and intesection operation on two regions
Compute the signed distances from points p to a region defined by the difference, union or intersection of regions specified by the functions regionA and regionB. regionA and regionB must accept a matrix p with 2 columns as their first argument, and must return a vector of length nrow(p) containing the signed distances of the supplied points in p to their respective regions.
● Data Source:
CranContrib
● Keywords:
● Alias: mesh.diff, mesh.intersect, mesh.union
●
0 images
|
providing 
.