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 Boissonnat and Maria (2014) .
Details
The class constructs a (weak) witness complex for a given table of nearest landmarks with respect to witnesses.
See also
Other filtrations and reconstructions:
AlphaComplex
,
RipsComplex
,
TangentialComplex
Methods
Method new()
The WitnessComplex constructor.
Usage
WitnessComplex$new(nearest_landmark_table)
Arguments
nearest_landmark_table
A list of tibble::tibbles specifying for each witness
w
, the ordered list of nearest landmarks with id in columnnearest_landmark
and distance tow
in columndistance
.
Method create_simplex_tree()
Returns
A SimplexTree
object storing the computed simplex
tree created from the Delaunay triangulation.
Examples
if (FALSE) { # reticulate::py_module_available("gudhi")
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
}
if (FALSE) { # reticulate::py_module_available("gudhi")
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()
}