
The mergegram of a dendrogram and its stability
This paper extends the key concept of persistence within Topological Dat...
read it

A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
The tree reconstruction problem is to find an embedded straightline tre...
read it

Resolutionindependent meshes of super pixels
The oversegmentation into superpixels is an important preprocessing ste...
read it

Skeletonisation Algorithms with Theoretical Guarantees for Unorganised Point Clouds with High Levels of Noise
Data Science aims to extract meaningful knowledge from unorganised data....
read it

Skeletonisation Algorithms for Unorganised Point Clouds with Theoretical Guarantees
Real datasets often come in the form of an unorganised cloud of points. ...
read it

Book embeddings of Reeb graphs
Let X be a simplicial complex with a piecewise linear function f:X→R. Th...
read it

Approximating persistent homology for a cloud of n points in a subquadratic time
The VietorisRips filtration for an npoint metric space is a sequence o...
read it

A fast and robust algorithm to count topologically persistent holes in noisy clouds
Preprocessing a 2D image often produces a noisy cloud of interest points...
read it
Vitaliy Kurlin
is this you? claim profile