Related papers: A Sparse Delaunay Filtration
We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…
The application of Voronoi and Delaunay tessellation based methods for reconstructing continuous fields from discretely sampled data sets is discussed. The succesfull operation as ``multidimensional interpolation'' method is corroborated…
Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line…
It is important that a spatial network's construction algorithm reproduces the structural properties of the original physical embedding. Here, we assess the Delaunay triangulation as a spatial network construction algorithm for seven…
A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…
In this paper a new connection between the discrete conformal geometry problem of disk pattern construction and the continuous conformal geometry problem of metric uniformization is presented. In a nutshell, we discuss how to construct disk…
We present a sharp extension of a result of Bourgain on finding configurations of $k+1$ points in general position in measurable subset of $\mathbb{R}^d$ of positive upper density whenever $d\geq k+1$ to all proper $k$-degenerate distance…
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…
The Persistent Homology Transform (PHT) summarizes a shape in $\mathbb{R}^m$ by collecting persistence diagrams obtained from linear height filtrations in all directions on $\mathbb{S}^{m-1}$. It enjoys strong theoretical guarantees,…
We study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets.
For a given point set $S$ in a plane, we develop a distributed algorithm to compute the $\alpha-$shape of $S$. $\alpha-$shapes are well known geometric objects which generalize the idea of a convex hull, and provide a good definition for…
We present DisPerSE, a novel approach to the coherent multi-scale identification of all types of astrophysical structures, and in particular the filaments, in the large scale distribution of matter in the Universe. This method and…
We develop and analyze a new algorithm to find the connected components of a compact set $I$ from a Lie group $G$ endowed with a left-invariant Riemannian distance. For a given $\delta>0$, the algorithm finds the largest cover of $I$ such…
The Delaunay triangulation (DT) is one of the most common and useful triangulations of point sets $P$ in the plane. DT is not unique when $P$ is degenerate, specifically when it contains quadruples of co-circular points. One way to achieve…
This paper investigates how diffusion generative models leverage (unknown) low-dimensional structure to accelerate sampling. Focusing on two mainstream samplers -- the denoising diffusion implicit model (DDIM) and the denoising diffusion…
The aim of this paper is to present a method for computation of persistent homology that performs well at large filtration values. To this end we introduce the concept of filtered covers. We show that the persistent homology of a bounded…
The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from…
We describe a greedy algorithm that approximates the Carleson constant of a collection of general sets. The approximation has a logarithmic loss in a general setting, but is optimal up to a constant with only mild geometric assumptions. The…
Intrinsic Delaunay triangulation (IDT) is a fundamental data structure in computational geometry and computer graphics. However, except for some theoretical results, such as existence and uniqueness, little progress has been made towards…
This work incorporates topological features via persistence diagrams to classify point cloud data arising from materials science. Persistence diagrams are multisets summarizing the connectedness and holes of given data. A new distance on…