Related papers: On 2-Site Voronoi Diagrams under Geometric Distanc…
Let $P$ be a set of $n$ points and $Q$ a convex $k$-gon in ${\mathbb R}^2$. We analyze in detail the topological (or discrete) changes in the structure of the Voronoi diagram and the Delaunay triangulation of $P$, under the convex distance…
We present an algorithm to compute the geodesic $L_1$ farthest-point Voronoi diagram of $m$ point sites in the presence of $n$ rectangular obstacles in the plane. It takes $O(nm+n \log n + m\log m)$ construction time using $O(nm)$ space.…
Real complex networks are often characterized by spatial constraints such as the relative position and adjacency of nodes. The present work describes how Voronoi tessellations of the space where the network is embedded provide not only a…
We study the Voronoi Diagram of Rotating Rays, a Voronoi structure where the input sites are rays and the distance function between a point and a site/ray, is the counterclockwise angular distance. This novel Voronoi diagram is motivated by…
The Voronoi diagram is a certain geometric data structure which has numerous applications in various scientific and technological fields. The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
Lipman et al. [ACM Transactions on Graphics 29 (3) (2010), 1--11] introduced the concept of biharmonic distance to measure the distances between pairs of points on a 3D surface. Biharmonic distance has some advantages over resistance…
Let $P$ be a planar set of $n$ sites in general position. For $k\in\{1,\dots,n-1\}$, the Voronoi diagram of order $k$ for $P$ is obtained by subdividing the plane into cells such that points in the same cell have the same set of nearest $k$…
Reliable empirical data and proper understanding of pedestrian dynamics are necessary for fire safety design. However, specifications and data in different handbooks as well as experimental studies differ considerably. In this study, series…
We address the problem of replicating a Voronoi diagram $V(S)$ of a planar point set $S$ by making proximity queries, which are of three possible (in decreasing order of information content): 1. the exact location of the nearest site(s) in…
We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted…
We review the model of the Voronoi Diagrams which allows to reproduce the large-scale structures of our universe as given by the astronomical catalogs. The observed number of galaxies in a given solid angle with a chosen flux/magnitude…
Pairwise comparison of graphs is key to many applications in Machine learning ranging from clustering, kernel-based classification/regression and more recently supervised graph prediction. Distances between graphs usually rely on…
The Voronoi diagram is a geometric object which is widely used in many areas. Recently it has been shown that under mild conditions Voronoi diagrams have a certain continuity property: small perturbations of the sites yield small…
Large graphs are difficult to represent, visualize, and understand. In this paper, we introduce "gate graph" - a new approach to perform graph simplification. A gate graph provides a simplified topological view of the original graph.…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbitrary even valence and with two marked points at a fixed geodesic distance. This is done in a purely combinatorial way based on a bijection…
We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…
Many observations of pedestrian dynamics, including various self-organization phenomena, have been reproduced successfully by different models. But the empirical databases for quantitative calibration are still insufficient, e.g. the…
Recently, simple conditions for well-behaved-ness of anisotropic Voronoi diagrams have been proposed. While these conditions ensure well-behaved-ness of two types of practical anisotropic Voronoi diagrams, as well as the geodesic-distance…