:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Dey, Tamal K., Zhang, Simon
Format:	Preprint
Published:	2021
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2110.14734
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cup Product Persistence and Its Efficient Computation
by: Dey, Tamal K., et al.
Published: (2022)

Computing Generalized Ranks of Persistence Modules via Unfolding to Zigzag Modules
by: Dey, Tamal K., et al.
Published: (2024)

Computing Optimal Persistent Cycles for Levelset Zigzag on Manifold-like Complexes
by: Dey, Tamal K., et al.
Published: (2021)

Efficient Algorithms for Complexes of Persistence Modules with Applications
by: Dey, Tamal K., et al.
Published: (2024)

Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition
by: Dey, Tamal K., et al.
Published: (2025)

Sparsification of the Generalized Persistence Diagrams for Scalability through Gradient Descent
by: Carrière, Mathieu, et al.
Published: (2024)

Edit Distance and Persistence Diagrams Over Lattices
by: McCleary, Alexander, et al.
Published: (2020)

Computing Projective Implicit Representations from Poset Towers
by: Dey, Tamal K., et al.
Published: (2025)

Computing Zigzag Vineyard Efficiently Including Expansions and Contractions
by: Dey, Tamal K., et al.
Published: (2023)

A Stable and Theoretically Grounded Gromov-Wasserstein Distance for Reeb Graph Comparison using Persistence Images
by: Chambers, Erin W., et al.
Published: (2025)

Apex Representatives
by: Dey, Tamal K., et al.
Published: (2025)

A Fast Algorithm for Computing Zigzag Representatives
by: Dey, Tamal K., et al.
Published: (2024)

Continuous Edit Distance, Geodesics and Barycenters of Time-varying Persistence Diagrams
by: Tchitchek, Sebastien, et al.
Published: (2025)

Computing the Bottleneck Distance between Persistent Homology Transforms
by: Kerber, Michael, et al.
Published: (2025)

Robust Barycenters of Persistence Diagrams
by: Sisouk, Keanu, et al.
Published: (2025)

Equivalence of Landscape and Erosion Distances for Persistence Diagrams
by: Ayhan, Cagatay, et al.
Published: (2025)

A Normalized Bottleneck Distance on Persistence Diagrams and Homology Preservation under Dimension Reduction
by: May, Nathan H., et al.
Published: (2023)

Persistent Homology with Path-Representable Distances on Graph Data
by: Heo, Eunwoo, et al.
Published: (2025)

Bottleneck Profiles and Discrete Prokhorov Metrics for Persistence Diagrams
by: Dłotko, Paweł, et al.
Published: (2021)

Neural Approximation of Generalized Voronoi Diagrams
by: Rigas, Panagiotis, et al.
Published: (2026)

Power Diagram Enhanced Adaptive Isosurface Extraction from Signed Distance Fields
by: Wang, Pengfei, et al.
Published: (2025)

Dynamical Persistent Homology via Wasserstein Gradient Flow
by: Wang, Minghua, et al.
Published: (2024)

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

Detecting Spatial Dependence in Transcriptomics Data using Vectorised Persistence Diagrams
by: Limbeck, Katharina, et al.
Published: (2024)

Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformers
by: Haviv, Doron, et al.
Published: (2024)

Super-Polynomial Growth of the Generalized Persistence Diagram
by: Kim, Donghan, et al.
Published: (2024)

Approximating the Directed Hausdorff Distance
by: Chubet, Oliver A., et al.
Published: (2025)

Poincaré Duality for Generalized Persistence Diagrams of (co)Filtrations
by: Patel, Amit, et al.
Published: (2022)

Higher-order Persistence Diagrams
by: Fanning, Charles, et al.
Published: (2026)

Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
by: Draganov, Ondřej, et al.
Published: (2025)

Fused Gromov-Wasserstein Distance with Feature Selection
by: Lee, Harlin, et al.
Published: (2026)

Understanding the Topology and the Geometry of the Space of Persistence Diagrams via Optimal Partial Transport
by: Divol, Vincent, et al.
Published: (2019)

Topological Machine Learning with Unreduced Persistence Diagrams
by: Abreu, Nicole, et al.
Published: (2025)

Distance Approximating Minors for Planar and Minor-Free Graphs
by: Chang, Hsien-Chih, et al.
Published: (2025)

Approximate Algorithms for Chamfer Distance Under Translation
by: Halevi, Gil, et al.
Published: (2026)

GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes
by: Zhang, Simon, et al.
Published: (2020)

Persistent Laplacian Diagrams
by: Jung, Inkee, et al.
Published: (2025)

Approximate Hausdorff Distance for Multi-Vector Databases
by: Zhao, Dongfang
Published: (2025)

Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem
by: Zhao, Lei, et al.
Published: (2024)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
by: Har-Peled, Sariel, et al.
Published: (2024)