Generate constrained Delaunay triangulation meshes for use with stochastic partial differential equation (SPDE) spatial models (Lindgren, Rue and Lindstroem 2011 <doi:10.1111/j.1467-9868.2011.00777.x>). Provides automatic mesh generation from point coordinates with boundary constraints, Ruppert refinement for mesh quality, finite element method (FEM) matrix assembly (mass, stiffness, projection), barrier models, spherical meshes via icosahedral subdivision, and metric graph meshes for network geometries. Built on the 'CDT' header-only C++ library (Amirkhanov 2024 <https://github.com/artem-ogre/CDT>). Designed as the mesh backend for the 'tulpa' Bayesian hierarchical modelling engine but usable standalone for any spatial triangulation task.
Package details |
|
|---|---|
| Author | Gilles Colling [aut, cre, cph] (ORCID: <https://orcid.org/0000-0003-3070-6066>), Artem Amirkhanov [ctb, cph] (CDT library (src/cdt/, MPL-2.0)), William C. Lenthe [ctb, cph] (Geometric predicates (src/cdt/predicates.h, BSD-3-Clause)) |
| Maintainer | Gilles Colling <gilles.colling051@gmail.com> |
| License | MIT + file LICENSE |
| Version | 0.1.4 |
| URL | https://gillescolling.com/tulpaMesh/ https://github.com/gcol33/tulpaMesh |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.