Related papers: Voronoi Cells in Metric Algebraic Geometry of Plan…
The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define…
We consider the distance minimization problem to a real algebraic variety $X \subseteq \RR^n$ when the metric is induced by a polyhedral norm. Each point in the variety has a Voronoi cell whose geometry depends on the normal space at the…
The classic Voronoi cells can be generalized to a higher-order version by considering the cells of points for which a given $k$-element subset of the set of sites consists of the $k$ closest sites. We study the structure of the $k$-order…
An important open question in the modeling of biological tissues is how to identify the right scale for coarse-graining, or equivalently, the right number of degrees of freedom. For confluent biological tissues, both vertex and Voronoi…
The restricted Delaunay triangulation of a closed surface $\Sigma$ and a finite point set $V \subset \Sigma$ is a subcomplex of the Delaunay tetrahedralization of $V$ whose triangles approximate $\Sigma$. It is well known that if $V$ is a…
We extend the theory of logarithmic Voronoi cells to Gaussian statistical models. In general, a logarithmic Voronoi cell at a point on a Gaussian model is a convex set contained in its log-normal spectrahedron. We show that for models of ML…
Voronoi cells of a discrete set in Euclidean space are known as generalized polyhedra. We identify polyhedral cells of a discrete set through a direction cone. For an arbitrary set we distinguish polyhedral from non-polyhedral cells using…
We use a simple fragmentation model to describe the statistical behavior of the Voronoi cell patterns generated by a set of points in 1D and in 2D. In particular, we are interested in the distribution of sizes of these Voronoi cells. Our…
We aim to give a strict proof of the existence and uniqueness of the weighted Voronoi decomposition and the dual weighted Delaunay triangulation on Euclidean and hyperbolic polyhedral surface as well as hyperbolic surface with geodesic…
Angular Voronoi diagram was introduced by Asano et al. as fundamental research for a mesh generation. In an angular Voronoi diagram, the edges are curves of degree three. From view of computational robustness we need to treat the curves…
We trace movements of certain points in space-time along their corresponding continuous path. We partition the space at every moment of time using alpha-Complexes, Voronoi medusa is then the collection or union of restricted Voronoi cells…
The Voronoi-based cellular model is highly successful in describing the motion of two-dimensional confluent cell tissues. In the homogeneous version of this model, the energy of each cell is determined solely by its geometric shape and…
The Voronoi tessellation of a homogeneous Poisson point process in the lower half-plane gives rise to a family of vertical elongated cells in the upper half-plane. The set of edges of these cells is ruled by a Markovian branching mechanism…
In this paper, we are interested in the behavior of the typical Poisson-Voronoi cell in the plane when the radius of the largest disk centered at the nucleus and contained in the cell goes to infinity. We prove a law of large numbers for…
Determining the masses of new physics particles appearing in decay chains is an important and longstanding problem in high energy phenomenology. Recently it has been shown that these mass measurements can be improved by utilizing the…
Since the Voronoi diagram appears in many applications, the topic of improving its computational efficiency remains attractive. We propose a novel yet efficient method to compute Voronoi diagrams bounded by a given domain, i.e., the clipped…
We study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms. On the positive side, we show for strictly convex and smooth norms that the geometry of Voronoi cells of lattices in any dimension is similar…
Given two sets of training samples, general method is to estimate the density function and classify the test sample according to higher values of estimated densities. Natural way to estimate the density should be histogram tending to…
Computing offsets of curves on parametric surfaces is a fundamental yet challenging operation in computer aided design and manufacturing. Traditional analytical approaches suffer from time-consuming geodesic distance queries and complex…
We present a paralell approach to discrete geometry: the first one introduces Voronoi cell complexes from statistical tessellations in order to know the mean scalar curvature in term of the mean number of edges of a cell. The second one…