Learn R Programming

simplextree (version 1.0.1)

Provides Tools for Working with General Simplicial Complexes

Description

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 Clment Maria (2014) .

Copy Link

Version

Install

install.packages('simplextree')

Monthly Downloads

132

Version

1.0.1

License

MIT + file LICENSE

Issues

Pull Requests

Stars

Forks

Maintainer

Matt Piekenbrock

Last Published

September 12th, 2020

Functions in simplextree (1.0.1)

clone

Clones the given simplex tree.
deserialize

Deserializes the simplex tree.
insert

Insert simplices
remove

Remove simplices
plot.simplextree

Plots the simplex tree
reindex

reindexes vertex ids
generate_ids

Generates vertex ids.
%>%

Pipe operator
enclosing_radius

enclosing_radius
maximal

Generates a traversal on the maximal of the simplex tree.
inverse.choose

inverse.choose
empty_face

empty_face
flag

flag
find

Find simplices
expand

k-expansion.
faces

Generates a face traversal on the simplex tree.
k_skeleton

Generates a k-skeleton traversal on the simplex tree.
sub_to_nat

sub_to_nat
link

Generates a traversal on the link of a given simplex in the simplex tree.
is_tree

Checks if the simplicial complex is a tree.
k_simplices

Generates a traversal on the k-simplices of the simplex tree.
is_face

Is face
nat_to_sub

nat_to_sub
threshold

threshold
serialize

Serializes the simplex tree.
rips

rips
simplex_tree

Simplex Tree
nerve

nerve
simplextree-package

simplextree package
plot.Rcpp_Filtration

plot.Rcpp_Filtration
preorder

Generates a preorder traversal on the simplex tree.
level_order

Generates a level order traversal on the simplex tree.
print.st_traversal

print.st_traversal
print_simplices

Print simplices to the console
traverse

traverse
union_find

UnionFind
coface_roots

Generates a coface roots traversal on the simplex tree.
adjacent

Adjacent vertices.
degree

The vertex degree.
clear

Clears the simplex tree
collapse

Elementary collapse
cofaces

Generates a coface traversal on the simplex tree.
contract

Edge contraction
as.list.st_traversal

as.list.st_traversal