WitnessComplex | R Documentation |
A Witness complex \mathrm{Wit}(W,L)
is a simplicial
complex defined on two sets of points in R^D
. The data structure is
described in \insertCiteboissonnat2014simplex;textualrgudhi.
The class constructs a (weak) witness complex for a given table of nearest landmarks with respect to witnesses.
rgudhi::PythonClass
-> WitnessComplex
new()
The WitnessComplex constructor.
WitnessComplex$new(nearest_landmark_table)
nearest_landmark_table
A list of tibble::tibbles
specifying for each witness w
, the ordered list of nearest
landmarks with id in column nearest_landmark
and distance to w
in
column distance
.
A WitnessComplex
object storing the Witness
complex.
create_simplex_tree()
WitnessComplex$create_simplex_tree(max_alpha_square = Inf)
max_alpha_square
The maximum relaxation parameter. Defaults to
Inf
.
A SimplexTree
object storing the computed simplex
tree created from the Delaunay triangulation.
clone()
The objects of this class are cloneable with this method.
WitnessComplex$clone(deep = FALSE)
deep
Whether to make a deep clone.
Siargey Kachanovich
Other filtrations and reconstructions:
AlphaComplex
,
RipsComplex
,
TangentialComplex
withr::with_seed(1234, {
l <- list(
tibble::tibble(
nearest_landmark = sample.int(10),
distance = sort(rexp(10))
),
tibble::tibble(
nearest_landmark = sample.int(10),
distance = sort(rexp(10))
)
)
})
wc <- WitnessComplex$new(nearest_landmark_table = l)
wc
withr::with_seed(1234, {
l <- list(
tibble::tibble(
nearest_landmark = sample.int(10),
distance = sort(rexp(10))
),
tibble::tibble(
nearest_landmark = sample.int(10),
distance = sort(rexp(10))
)
)
})
wc <- WitnessComplex$new(nearest_landmark_table = l)
st <- wc$create_simplex_tree()
st$num_vertices()
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.