geometry v0.4.2


Monthly downloads



Mesh Generation and Surface Tessellation

Makes the 'Qhull' library <> 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.

Functions in geometry

Name Description
delaunayn Delaunay triangulation in N dimensions
bary2cart Conversion of Barycentric to Cartesian coordinates
Unique Extract Unique Rows
feasible.point Find point in intersection of convex hulls
distmesh2d A simple mesh generator for non-convex regions
pol2cart Transform polar or cylindrical coordinates to Cartesian coordinates.
polyarea Determines area of a polygon by triangle method.
halfspacen Compute halfspace intersection about a point
extprod3d Compute external- or `cross'- product of 3D vectors.
entry.value Retrieve or set a list of array element values
surf.tri Find surface triangles from tetrahedral mesh
cart2bary Conversion of Cartesian to Barycentric coordinates.
cart2pol Transform Cartesian coordinates to polar or cylindrical coordinates.
tsearch Search for the enclosing Delaunay convex hull
tetramesh Render tetrahedron mesh (3D)
rbox Generate various point distributions
sph2cart Transform spherical coordinates to Cartesian coordinates
tsearchn Search for the enclosing Delaunay convex hull
mesh.drectangle Rectangle distance function
mesh.hunif Uniform desired edge length
mesh.diff Difference, union and intersection operation on two regions
mesh.dsphere Sphere distance function
distmeshnd A simple mesh generator for non-convex regions in n-D space
dot Compute the dot product of two vectors
matmax Row-wise matrix functions
mesh.dcircle Circle distance function
inhulln Test if points lie in convex hull
cart2sph If called with a single matrix argument then each row of c represents the Cartesian coordinate (x, y, z).
convhulln Compute smallest convex hull that encloses a set of points
intersectn Compute convex hull of intersection of two sets of points
to.mesh3d Convert convhulln object to RGL mesh
trimesh Display triangles mesh (2D)
No Results!

Vignettes of geometry

No Results!

Last month downloads


License GPL (>= 3)
Date 2019-07-05
RoxygenNote 6.1.1
LinkingTo Rcpp, RcppProgress
Encoding UTF-8
Language en-GB
NeedsCompilation yes
Packaged 2019-07-12 13:19:00 UTC; sterratt
Repository CRAN
Date/Publication 2019-07-12 14:50:10 UTC

Include our badge in your README