geometry0.5.1 package

Mesh Generation and Surface Tessellation

bary2cart

Conversion of Barycentric to Cartesian coordinates

cart2bary

Conversion of Cartesian to Barycentric coordinates.

cart2pol

Transform Cartesian coordinates to polar or cylindrical coordinates.

cart2sph

Transform Cartesian to spherical coordinates

convhulln

Compute smallest convex hull that encloses a set of points

delaunayn

Delaunay triangulation in N dimensions

distmesh2d

A simple mesh generator for non-convex regions

distmeshnd

A simple mesh generator for non-convex regions in n-D space

dot

Compute the dot product of two vectors

entry.value

Retrieve or set a list of array element values

extprod3d

Compute external- or cross - product of 3D vectors.

feasible.point

Find point in intersection of convex hulls

halfspacen

Compute halfspace intersection about a point

inhulln

Test if points lie in convex hull

intersectn

Compute convex hull of intersection of two sets of points

matmax

Row-wise matrix functions

mesh.dcircle

Circle distance function

mesh.diff

Difference, union and intersection operation on two regions

mesh.drectangle

Rectangle distance function

mesh.dsphere

Sphere distance function

mesh.hunif

Uniform desired edge length

pol2cart

Transform polar or cylindrical coordinates to Cartesian coordinates.

polyarea

Determines area of a polygon by triangle method.

rbox

Generate various point distributions

sph2cart

Transform spherical coordinates to Cartesian coordinates

surf.tri

Find surface triangles from tetrahedral mesh

tetramesh

Render tetrahedron mesh (3D)

to.mesh3d

Convert convhulln object to RGL mesh

trimesh

Display triangles mesh (2D)

tsearch

Search for the enclosing Delaunay convex hull

tsearchn

Search for the enclosing Delaunay convex hull

Unique

Extract Unique Rows

Makes the 'Qhull' library <http://www.qhull.org> available in R, in a similar manner as in Octave and MATLAB. Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2D, 3D, 4D, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull does not support constrained Delaunay triangulations, or mesh generation of non-convex objects, but the package does include some R functions that allow for this.

  • Maintainer: David C. Sterratt
  • License: GPL (>= 3)
  • Last published: 2025-01-10