bottleneck | R Documentation |
The function bottleneck
computes the bottleneck distance between two persistence diagrams.
bottleneck(Diag1, Diag2, dimension = 1)
Diag1 |
an object of class |
Diag2 |
an object of class |
dimension |
an integer or a vector specifying the dimension of the features used to compute the bottleneck distance. |
The bottleneck distance between two diagrams is the cost of the optimal matching between points of the two diagrams. Note that all the diagonal points are included in the persistence diagrams when computing the optimal matching. When a vector is given for dimension
, then maximum among bottleneck distances using each element in dimension
is returned. The function bottleneck
is an R wrapper of the function "bottleneck_distance" in the C++ library Dionysus. See references.
The function bottleneck
returns the value of the bottleneck distance between the two persistence diagrams.
Jisu Kim and Fabrizio Lecci
Morozov D (2007). "Dionysus, a C++ library for computing persistent homology." https://www.mrzv.org/software/dionysus/
Edelsbrunner H, Harer J (2010). "Computational topology: an introduction." American Mathematical Society.
wasserstein
,
alphaComplexDiag
, alphaComplexDiag
, gridDiag
, ripsDiag
,
plot.diagram
XX1 <- circleUnif(20)
XX2 <- circleUnif(20, r = 0.2)
DiagLim <- 5
maxdimension <- 1
Diag1 <- ripsDiag(XX1, maxdimension, DiagLim, printProgress = FALSE)
Diag2 <- ripsDiag(XX2, maxdimension, DiagLim, printProgress = FALSE)
bottleneckDist <- bottleneck(Diag1[["diagram"]], Diag2[["diagram"]],
dimension = 1)
print(bottleneckDist)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.