Computing Multidimensional Persistence

Authors:
Gunnar Carlsson;Gurjeet Singh;Afra Zomorodian
Affiliations:
Department of Mathematics, Stanford University, USA;Department of Mathematics, Stanford University, USA;Department of Computer Science, Dartmouth College, USA
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 8
Cited 3

Some complexity results for polynomial ideals

Journal of Complexity
Modern Computer Algebra

Modern Computer Algebra
Computing Persistent Homology

Discrete & Computational Geometry
Vines and vineyards by updating persistence in linear time

Proceedings of the twenty-second annual symposium on Computational geometry
On the Local Behavior of Spaces of Natural Images

International Journal of Computer Vision
The Theory of Multidimensional Persistence

Discrete & Computational Geometry - 23rd Annual Symposium on Computational Geometry
A barcode shape descriptor for curve point cloud data

Computers and Graphics
Topological estimation using witness complexes

SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics

A new algorithm for computing the 2-dimensional matching distance between size functions

Pattern Recognition Letters
Stable Comparison of Multidimensional Persistent Homology Groups with Torsion

Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
Comparison of persistent homologies for vector functions: From continuous to discrete and back

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The theory of multidimensional persistence captures the topology of a multifiltration --- a multiparameter family of increasing spaces. Multifiltrations arise naturally in the topological analysis of scientific data. In this paper, we give a polynomial time algorithm for computing multidimensional persistence.