geometry
Mesh Generation and Surface Tessellation
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.
- Version0.5.2
- R versionR (≥ 3.5.0)
- LicenseGPL (≥ 3)
- Needs compilation?Yes
- Languageen-GB
- Last release02/08/2025
Documentation
Team
David C. Sterratt
MaintainerShow author detailsJean-Romain Roussel
Show author detailsRolesCopyright holder, ContributorKai Habel
Show author detailsRolesCopyright holder, AuthorRaoul Grasman
Show author detailsRolesCopyright holder, AuthorPavlo Mozharovskyi
Show author detailsRolesCopyright holder, AuthorRobert B. Gramacy
Show author detailsRolesCopyright holder, AuthorC. B. Barber
Show author detailsRolesCopyright holder
Insights
Last 30 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports4 packages
- Suggests5 packages
- Linking To2 packages
- Reverse Depends11 packages
- Reverse Imports50 packages
- Reverse Suggests15 packages