This is a function for computing the persistence scale space kernel value from two persistence diagrams. The persistence scale space kernel is co

Return the information contained in the header of an OFF file. :param file_desc: An open file in read mode. :type file_desc: file :retur

* Function to compute absolute value of a PL function. The representation of persistence landscapes allow to store * general PL-function. When comp

* Constructs the abstract link of v (without points coordinates). */

* @brief Inserts arrow number in the ordering after a removal. * When the arrow key-1 <- key is backward, key is smaller than any other index

* @brief Inserts arrow number in the ordering after an insertion. * When the arrow key-1 -> key is forward, key is larger than any other index

* Add a blocker to the sub-complex. * It assumes that all vertices of blocker_root are present * in the sub-complex. */

Returns a range over all cells. */

\brief Ambient dimension of the implicit manifold. */

\brief Returns the domain (ambient) dimension. */

Close the current column, the next push_back will be for a new column

* @brief To use when a cell is neither inserted nor removed, but the filtration moves along the identity operator * on homology level. Useful to ke

This function returns the Betti numbers of the complex. :returns: list of int -- The Betti numbers ([B0, B1, ..., Bn]). :note: betti

* @brief Increasing birth order <=b, true iff k1 <b k2. * * @param k1 * @param k2 * @return true if k1 <b k2, false otherwise.

* @brief compute vertices, edges and blockers of the link. * @details If the boolean only_superior_vertices is true, then the link is computed only

Compute Rips persistence diagram associated to a point cloud Parameters: X (TensorFlow variable): point cloud of shape [

Compute lower-star persistence diagram associated to a function defined on the vertices of the simplex tree Parameters:

* @brief Returns a Complex_simplex_coboundary_iterator over the simplices of the coboundary of a simplex. */

\brief Returns the codomain dimension. */

A persistence interval is described by a pair of cells, one that creates the feature and one that kills it. The filtration values of those 2 c

\brief Returns a range of permutahedral representations of cofacets of the simplex. * The dimension of the simplex must be strictly different from

\brief Computes bootstrapped distances distribution. * * @param[in] N number of bootstrap iterations. * */

* Computations of maximum (y) value of landscape. **/

* \private Computations of minimum (y) value of landscape. **/

* Computations of minimum and maximum value of landscape. **/

\brief Computes the p-value, i.e. the opposite of the confidence level of the largest bottleneck * distance preserving the points in the persistenc

* @private * Temporary patch to make the computation of more general FilteredComplex possible * Will be removed when a better solution was agree

Output: "triangulation" is a Regular Triangulation containing at least the star of "center_pt" Returns the handle of the center vertex

* A function that computes the value of a landscape at a given point. The parameters of the function are: unsigned * level and double x. * The p

* @return true iff the simplex contains the simplex a. */

Args: max_alpha_square (float): The maximum alpha square threshold the simplices shall not exceed. Default is set

Exports the complex into a simplex tree. :returns: A simplex tree created from the complex. :rtype: SimplexTree

* only if points have dimension 3 */

Off_reader visitor done implementation - Only points are read