Provides Tools for Working with General Simplicial Complexes
Adjacent vertices.
as.list.st_traversal
Clears the simplex tree
Clones the given simplex tree.
Generates a coface roots traversal on the simplex tree.
Generates a coface traversal on the simplex tree.
Elementary collapse
Edge contraction
The vertex degree.
Deserializes the simplex tree.
empty_face
enclosing_radius
k-expansion.
Generates a face traversal on the simplex tree.
Find simplices
flag
Generates vertex ids.
Insert simplices
inverse.choose
Is face
Checks if the simplicial complex is a tree.
Generates a traversal on the k-simplices of the simplex tree.
Generates a k-skeleton traversal on the simplex tree.
Generates a level order traversal on the simplex tree.
Generates a traversal on the link of a given simplex in the simplex tr...
Generates a traversal on the maximal of the simplex tree.
nat_to_sub
nerve
Pipe operator
Plots the simplex tree
plot.Rcpp_Filtration
Generates a preorder traversal on the simplex tree.
print.st_traversal
Print simplices to the console
reindexes vertex ids
Remove simplices
rips
Serializes the simplex tree.
Simplex Tree
simplextree package
sub_to_nat
threshold
traverse
UnionFind
Provides an interface to a Simplex Tree data structure, which is a data structure aimed at enabling efficient manipulation of simplicial complexes of any dimension. The Simplex Tree data structure was originally introduced by Jean-Daniel Boissonnat and Clément Maria (2014) <doi:10.1007/s00453-014-9887-3>.