Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0705.2835

Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance

Sergey Bereg·Marina Gavrilova·Binhai Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Frèchet distance. In this paper, for the first time, we consider the Voronoi diagram of polygonal chains in $d$-dimension ($d=2,3$) under the discrete Frèchet distance. Given $n$ polygonal chains ${\cal C}$ in $d$-dimension ($d=2,3$), each with at most $k$ vertices, we prove fundamental properties of such a Voronoi diagram {\em VD}$_F({\cal C})$ by presenting the first known upper and lower bounds for {\em VD}$_F({\cal C})$.

Explore related subjects

cs.CGcs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergey Bereg, Marina Gavrilova, Binhai Zhu. 2007-05-19. Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. https://arxiv.org/abs/0705.2835

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Gromov-Wasserstein at Scale, Beyond Squared Norms

A fundamental challenge in data science is to match disparate point sets with each other. While optimal transport efficiently minimizes point displacements under a bijectivity constraint, it is inherently sensitive to rotations. Conversely, minimizing distortions via the Gromov-Wasserstein (GW) framework addresses this limitation but introduces a non-convex, computationally demanding optimization problem. In this work, we identify a broad class of distortion penalties that reduce to a simple alignment problem within a lifted feature space. Leveraging this insight, we introduce an iterative GW solver with a linear memory footprint and quadratic (rather than cubic) time complexity. Our method is differentiable, comes with strong theoretical guarantees, and scales to hundreds of thousands of points in minutes. This efficiency unlocks a wide range of geometric applications and enables the exploration of the GW energy landscape, whose local minima encode the symmetries of the matching problem.

cs.CG↗
arXiv2026

Delaunay-Rips filtration: a study and an algorithm

The Delaunay-Rips filtration is a lighter and faster alternative to the well-known Rips filtration for low-dimensional Euclidean point clouds, making it a promising tool for topological approaches in machine learning. However, it has seldom been studied. In this paper, we address this gap by providing a comprehensive theoretical and empirical analysis of this construction, as well as an evaluation of its practical performance in classification tasks. From a theoretical perspective, we show how the persistence diagrams associated with the Delaunay-Rips filtration approximate those obtained with the Rips filtration and we describe the instabilities of the Delaunay-Rips persistence diagrams when the input point cloud is perturbed. Then, we introduce an algorithm that computes persistence diagrams of Delaunay-Rips filtrations in any dimension. We show that our approach is faster and has a lower memory footprint than traditional approaches in low dimensions. Finally, we evaluate its performance in classification tasks on synthetic and real datasets. Our C++ implementation, which comes with Python bindings, is available at https://github.com/MClemot/GeoPH.

cs.CG↗
arXiv2026

Topologically Relevant Landmark Selection on Point Clouds

Persistent Homology (PH) is an important tool in Topological Data Analysis for point clouds, but can be prohibitively expensive for large datasets. A practical approximation is to compute PH on a smaller subset of representative points, known as landmarks. Existing landmark selection methods mainly address challenges such as outlier contamination rather than restoring the topological features of the full dataset. To select topologically relevant landmarks, we propose a landmark selection method based on Hodge Laplacian. It assigns each point a topological relevance score based on its harmonic participation and selects points with high scores as landmarks. By quantifying each point's participation in global homological structures, our method restores the PH of the original point cloud more accurately than geometric baselines and a method built upon local PH on both synthetic and real-world datasets.

cs.CG↗