interplex: Coercion Methods for Simplicial Complex Data Structures

Computational topology, which includes topological data analysis (TDA), makes pervasive use of abstract mathematical objects called simplicial complexes; see Edelsbrunner and Harer (2010) <doi:10.1090/mbk/069>. Several R packages and other software libraries used through an R interface construct and use data structures that represent simplicial complexes, including mathematical graphs viewed as 1-dimensional complexes. This package provides coercers (converters) between these data structures. Currently supported structures are complete lists of simplices as used by 'TDA'; the simplex trees of Boissonnat and Maria (2014) <doi:10.1007/s00453-014-9887-3> as implemented in 'simplextree' and in Python GUDHI (by way of 'reticulate'); and the graph classes of 'igraph' and 'network', by way of the 'intergraph' package.

Version: 0.1.0
Suggests: TDA, simplextree (≥ 0.9.1), igraph (≥ 0.6-0), network (≥ 1.4-2), intergraph, reticulate, roxygen2, rmarkdown, testthat
Published: 2022-06-21
Author: Jason Cory Brunson ORCID iD [aut, cre], Yara Skaf [ctb]
Maintainer: Jason Cory Brunson <cornelioid at>
License: GPL (≥ 3)
NeedsCompilation: no
Materials: README NEWS
CRAN checks: interplex results


Reference manual: interplex.pdf


Package source: interplex_0.1.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): interplex_0.1.0.tgz, r-oldrel (arm64): interplex_0.1.0.tgz, r-release (x86_64): interplex_0.1.0.tgz, r-oldrel (x86_64): interplex_0.1.0.tgz


Please use the canonical form to link to this page.