Related papers: Orphan-Free Anisotropic Voronoi Diagrams
We study Voronoi cells in the statistical setting by considering preimages of the maximum likelihood estimator that tessellate an open probability simplex. In general, logarithmic Voronoi cells are convex sets. However, for certain…
Higher order anisotropic superspaces are constructed as generalized vector superbundles provided with compatible nonlinear connection, distinguished connection and metric structures.
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
We develop a set of heuristic arguments to explain several results on planar Poisson-Voronoi tessellations that were derived earlier at the cost of considerable mathematical effort. The results concern Voronoi cells having a large number n…
The size distributions of 2D and 3D Voronoi cells and of cells of $V_p(2,3)$,--2D cut of 3D Voronoi diagram--are explored, with the single-parameter (re-scaled) gamma distribution playing a central role in the analytical fitting.…
This paper presents the Voronoi diagram-based evolutionary algorithm (VorEAl). VorEAl partitions input space in abnormal/normal subsets using Voronoi diagrams. Diagrams are evolved using a multi-objective bio-inspired approach in order to…
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…
We describe a new algorithm for computing the Voronoi diagram of a set of $n$ points in constant-dimensional Euclidean space. The running time of our algorithm is $O(f \log n \log \Delta)$ where $f$ is the output complexity of the Voronoi…
This paper uses the definition of complexity for a static spherically symmetric spacetime and extends it to the case of charged distribution. We formulate the Einstein-Maxwell field equations corresponding to the anisotropic interior and…
Voronoi tessellations have been used to model the geometric arrangement of cells in morphogenetic or cancerous tissues, however so far only with flat hypersurfaces as cell-cell contact borders. In order to reproduce the experimentally…
In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination number and independence number. We also study the…
In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…
Necessary and sufficient conditions are obtained for the infinitesimal rigidity of braced grids in the plane with respect to non-Euclidean norms. Component rectangles of the grid may carry 0, 1 or 2 diagonal braces, and the combinatorial…
We develop a graphical calculus of manifold diagrams which generalises string and surface diagrams to arbitrary dimensions. Manifold diagrams are pasting diagrams for $(\infty, n)$-categories that admit a semi-strict composition operation…
The Voronoi diagram-based dual-front active contour models are known as a powerful and efficient way for addressing the image segmentation and domain partitioning problems. In the basic formulation of the dual-front models, the evolving…
Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices $x,y\in\mathbb{Z}^d$ are linked by an edge with probability depending on i.i.d.\ vertex weights and the Euclidean distance…
We study logarithmic Voronoi cells for linear statistical models and partial linear models. The logarithmic Voronoi cells at points on such model are polytopes. To any $d$-dimensional linear model inside the probability simplex…
We present an adaptation of Voronoi theory for imaginary quadratic number fields of class number greater than 1. This includes a characterisation of extreme Hermitian forms which is analogous to the classic characterisation of extreme…
Heteroclinic connections are trajectories that link invariant sets for an autonomous dynamical flow: these connections can robustly form networks between equilibria, for systems with flow-invariant spaces. In this paper we examine the…
Every orthonomic system of partial differential equations is known to possess a finite number of integrability conditions sufficient to ensure the validity of all. Herewith we offer an efficient algorithm to construct a sufficient set of…