Learn R Programming

⚠️There's a newer version (0.5.1) of this package.Take me there.

geometry (version 0.4.2)

Mesh Generation and Surface Tessellation

Description

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.

Copy Link

Version

Install

install.packages('geometry')

Monthly Downloads

15,255

Version

0.4.2

License

GPL (>= 3)

Maintainer

David Sterratt

Last Published

July 12th, 2019

Functions in geometry (0.4.2)

Delaunay triangulation in N dimensions

Conversion of Barycentric to Cartesian coordinates

Extract Unique Rows

Find point in intersection of convex hulls

A simple mesh generator for non-convex regions

Transform polar or cylindrical coordinates to Cartesian coordinates.

Determines area of a polygon by triangle method.

Compute halfspace intersection about a point

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

Retrieve or set a list of array element values

Find surface triangles from tetrahedral mesh

Conversion of Cartesian to Barycentric coordinates.

Transform Cartesian coordinates to polar or cylindrical coordinates.

Search for the enclosing Delaunay convex hull

Render tetrahedron mesh (3D)

Generate various point distributions

Transform spherical coordinates to Cartesian coordinates

Search for the enclosing Delaunay convex hull

mesh.drectangle

Rectangle distance function

Uniform desired edge length

Difference, union and intersection operation on two regions

Sphere distance function

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

Compute the dot product of two vectors

Row-wise matrix functions

Circle distance function

Test if points lie in convex hull

If called with a single matrix argument then each row of c represents the Cartesian coordinate (x, y, z).

Compute smallest convex hull that encloses a set of points

Compute convex hull of intersection of two sets of points

Convert convhulln object to RGL mesh

Display triangles mesh (2D)