A Sparse Delaunay Filtration

12/03/2020
by   Donald R. Sheehy, et al.
0

We show how a filtration of Delaunay complexes can be used to approximate the persistence diagram of the distance to a point set in R^d. Whereas the full Delaunay complex can be used to compute this persistence diagram exactly, it may have size O(n^⌈ d/2 ⌉). In contrast, our construction uses only O(n) simplices. The central idea is to connect Delaunay complexes on progressively denser subsamples by considering the flips in an incremental construction as simplices in d+1 dimensions. This approach leads to a very simple and straightforward proof of correctness in geometric terms, because the final filtration is dual to a (d+1)-dimensional Voronoi construction similar to the standard Delaunay filtration complex. We also, show how this complex can be efficiently constructed.

READ FULL TEXT

page 2

page 8

research
12/03/2020

Sketching Persistence Diagrams

Given a persistence diagram with n points, we give an algorithm that pro...
research
04/15/2021

Approximation algorithms for 1-Wasserstein distance between persistence diagrams

Recent years have witnessed a tremendous growth using topological summar...
research
05/26/2019

Geodesics in persistence diagram space

It is known that for a variety of choices of metrics, including the stan...
research
10/12/2022

Computing Persistence Diagram Bundles

Persistence diagram (PD) bundles, a generalization of vineyards, were re...
research
10/11/2022

Persistence Diagram Bundles: A Multidimensional Generalization of Vineyards

A persistence diagram (PD) summarizes the persistent homology of a filtr...
research
07/09/2021

Realizable piecewise linear paths of persistence diagrams with Reeb graphs

Reeb graphs are widely used in a range of fields for the purposes of ana...
research
05/17/2021

A Coupled Alpha Complex

The alpha complex is a subset of the Delaunay triangulation and is often...

Please sign up or login with your details

Forgot password? Click here to reset