geometry: Mesh Generation and Surface Tesselation

Makes the qhull library (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 2-d, 3-d, 4-d, 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. Currently the package only gives access to Delaunay triangulation and convex hull computation.

Getting started

Package details

AuthorC. B. Barber [cph], Kai Habel [cph, aut], Raoul Grasman [cph, aut], Robert B. Gramacy [cph, aut], Andreas Stahel [cph, aut], David C. Sterratt [cph, aut, cre]
MaintainerDavid C. Sterratt <david.c.sterratt@ed.ac.uk>
LicenseGPL (>= 3) + file LICENSE
Version0.4.0
URL http://geometry.r-forge.r-project.org/
Package repositoryView on R-Forge
Installation Install the latest version of this package by entering the following in R:
install.packages("geometry", repos="http://R-Forge.R-project.org")

Try the geometry package in your browser

Any scripts or data that you put into this service are public.

geometry documentation built on May 2, 2019, 6:09 p.m.