Related papers: On 2-Site Voronoi Diagrams under Geometric Distanc…
Recent years have witnessed a tremendous growth using topological summaries, especially the persistence diagrams (encoding the so-called persistent homology) for analyzing complex shapes. Intuitively, persistent homology maps a potentially…
In quantum information theory, a geometric approach, known as "quantum information geometry," has been considered as a powerful method. In this thesis, we give a computational geometric interpretation to the geometric structure of a quantum…
In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…
Graph embeddings have emerged as a powerful tool for representing complex network structures in a low-dimensional space, enabling the use of efficient methods that employ the metric structure in the embedding space as a proxy for the…
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…
The study of the topological structure of complex networks has fascinated researchers for several decades, and today we have a fairly good understanding of the types and reoccurring characteristics of many different complex networks.…
The transition from ordered to disordered structures in Voronoi tessellation is obtained by perturbing the seeds that were originally identified with two types of lattice in 2D and one type in 3D. The area in 2D and the volume in 3D are…
A {\em faithful (unit) distance graph} in $\mathbb{R}^d$ is a graph whose set of vertices is a finite subset of the $d$-dimensional Euclidean space, where two vertices are adjacent if and only if the Euclidean distance between them is…
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in any number of dimensions. These conditions are natural for…
The Voronoi diagrams technique was introduced by Cabello to compute the diameter of planar graphs in subquadratic time. We present novel applications of this technique in static, fault-tolerant, and partially-dynamic undirected unweighted…
In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem.…
This paper considers several approximate operators used in a particle method based on a Voronoi diagram. We introduce and study our approximate operators on gradient and Laplace operators. We derive error estimates for these approximate…
We calculate the Gromov-Hausdorff distance between vertex sets of regular polygons endowed with the round metric. We give a full answer for the case of n- and m-gons with m divisible by n. Also, we calculate all distances to 2-gons and…
Given strong local Dirichlet forms and $\mathbb{R}^N$-valued functions on a metrizable space, we introduce the concepts of geodesic distance and intrinsic distance on the basis of these objects. They are defined in a geometric and an…
We present an explicit and efficient construction of additively weighted Voronoi diagrams on planar graphs. Let $G$ be a planar graph with $n$ vertices and $b$ sites that lie on a constant number of faces. We show how to preprocess $G$ in…
This study proposes an innovative approach to analyze spatial patterns of behavior by integrating information in weighted Voronoi diagrams. The objective of the research is to analyze the temporal distribution of an experimental subject in…
We present an edge labeling of order-$k$ Voronoi diagrams, $V_k(S)$, of point sets $S$ in the plane, and study properties of the regions defined by them. Among them, we show that $V_k(S)$ has a small orientable cycle and path double cover,…
The format of graphing algorithms for genomic data has been a debate in recent biotechnology. In this paper, we discuss the construction of population graphs using said genomic data. We first examine the GENPOFAD distance measurement,…
Comparison of graph structure is a ubiquitous task in data analysis and machine learning, with diverse applications in fields such as neuroscience, cyber security, social network analysis, and bioinformatics, among others. Discovery and…
In this article, we propose a numerical method to solve semi-discrete optimal transport problems for gigantic pointsets (108 points and more). By pushing the limits by several orders of magnitude, it opens the path to new applications in…