The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Provides a function for fast computation of the connected components of an undirected graph (though not faster than the components() function of the 'igraph' package) from the edges or the adjacency matrix of the graph. Based on this one, a function to compute the connected components of a triangle 'rgl' mesh is also provided.
Version: | 1.0.0 |
Imports: | english, Rcpp (≥ 1.0.8), rgl, Rvcg |
LinkingTo: | BH, Rcpp |
Suggests: | rmarchingcubes |
Published: | 2022-06-15 |
DOI: | 10.32614/CRAN.package.concom |
Author: | Stéphane Laurent [cre, aut] |
Maintainer: | Stéphane Laurent <laurent_step at outlook.fr> |
BugReports: | https://github.com/stla/concom/issues |
License: | GPL-3 |
URL: | https://github.com/stla/concom |
NeedsCompilation: | yes |
Materials: | README NEWS |
CRAN checks: | concom results |
Reference manual: | concom.pdf |
Package source: | concom_1.0.0.tar.gz |
Windows binaries: | r-devel: concom_1.0.0.zip, r-release: concom_1.0.0.zip, r-oldrel: concom_1.0.0.zip |
macOS binaries: | r-release (arm64): concom_1.0.0.tgz, r-oldrel (arm64): concom_1.0.0.tgz, r-release (x86_64): concom_1.0.0.tgz, r-oldrel (x86_64): concom_1.0.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=concom to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.