| RipsComplex | R Documentation |
The data structure is a one skeleton graph, or Rips graph, containing edges when the edge length is less or equal to a given threshold. Edge length is computed from a user given point cloud with a given distance function, or a distance matrix.
rgudhi::PythonClass -> RipsComplex
new()RipsComplex constructor.
RipsComplex$new(data, max_edge_length = NULL, sparse = NULL)
dataEither a n x d matrix or a length-n list of
d-dimensional vectors or a distance matrix stored as a
dist object.
max_edge_lengthA numeric value specifying the Rips value.
sparseA numeric value specifying the approximation parameter
epsilon for buidling a sparse Rips complex. Defaults to NULL which
builds an exact Rips complex.
A RipsComplex object storing the Rips complex.
create_simplex_tree()RipsComplex$create_simplex_tree(max_dimension)
max_dimensionAn integer value specifying the maximal dimension which the Rips complex will be expanded to.
A SimplexTree object storing the computed simplex
tree.
clone()The objects of this class are cloneable with this method.
RipsComplex$clone(deep = FALSE)
deepWhether to make a deep clone.
Clément Maria, Pawel Dlotko, Vincent Rouvreau, Marc Glisse, Yuichi Ike
Other filtrations and reconstructions:
AlphaComplex,
TangentialComplex,
WitnessComplex
X <- seq_circle(10)
rc1 <- RipsComplex$new(data = X, max_edge_length = 1)
Xm <- Reduce(rbind, X, init = numeric())
rc2 <- RipsComplex$new(data = Xm, max_edge_length = 1)
D <- dist(Xm)
rc3 <- RipsComplex$new(data = D)
X <- seq_circle(10)
rc <- RipsComplex$new(data = X, max_edge_length = 1)
st <- rc$create_simplex_tree(1)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.