Package: rmarchingcubes 0.1.3

rmarchingcubes: Calculate 3D Contour Meshes Using the Marching Cubes Algorithm

A port of the C++ routine for applying the marching cubes algorithm written by Thomas Lewiner et al. (2012) <doi:10.1080/10867651.2003.10487582> into an R package. The package supplies the contour3d() function, which takes a 3-dimensional array of voxel data and calculates the vertices, vertex normals, and faces for a 3d mesh representing the contour(s) at a given level.

Authors:S. H. Wilks <[email protected]> [aut, cre], Thomas Lewiner <[email protected]> [aut]

rmarchingcubes_0.1.3.tar.gz
rmarchingcubes_0.1.3.zip(r-4.5)rmarchingcubes_0.1.3.zip(r-4.4)rmarchingcubes_0.1.3.zip(r-4.3)
rmarchingcubes_0.1.3.tgz(r-4.4-x86_64)rmarchingcubes_0.1.3.tgz(r-4.4-arm64)rmarchingcubes_0.1.3.tgz(r-4.3-x86_64)rmarchingcubes_0.1.3.tgz(r-4.3-arm64)
rmarchingcubes_0.1.3.tar.gz(r-4.5-noble)rmarchingcubes_0.1.3.tar.gz(r-4.4-noble)
rmarchingcubes_0.1.3.tgz(r-4.4-emscripten)rmarchingcubes_0.1.3.tgz(r-4.3-emscripten)
rmarchingcubes.pdf |rmarchingcubes.html
rmarchingcubes/json (API)
NEWS

# Install 'rmarchingcubes' in R:
install.packages('rmarchingcubes', repos = c('https://shwilks.r-universe.dev', 'https://cloud.r-project.org'))

Peer review:

Bug tracker:https://github.com/shwilks/rmarchingcubes/issues

Uses libs:
  • openblas– Optimized BLAS
  • c++– GNU Standard C++ Library v3

On CRAN:

5.73 score 8 stars 1 packages 45 scripts 238 downloads 1 exports 2 dependencies

Last updated 3 years agofrom:c68f49ef10. Checks:OK: 1 NOTE: 8. Indexed: yes.

TargetResultDate
Doc / VignettesOKNov 06 2024
R-4.5-win-x86_64NOTENov 06 2024
R-4.5-linux-x86_64NOTENov 06 2024
R-4.4-win-x86_64NOTENov 06 2024
R-4.4-mac-x86_64NOTENov 06 2024
R-4.4-mac-aarch64NOTENov 06 2024
R-4.3-win-x86_64NOTENov 06 2024
R-4.3-mac-x86_64NOTENov 06 2024
R-4.3-mac-aarch64NOTENov 06 2024

Exports:contour3d

Dependencies:RcppRcppArmadillo

Calculating 3d contours

Rendered fromcalculating_3d_contours.Rmdusingknitr::rmarkdownon Nov 06 2024.

Last update: 2021-06-16
Started: 2021-06-12