Related papers: Logarithmic Voronoi cells
We consider offsets of a union of convex objects. We aim for a filtration, a sequence of nested cell complexes, that captures the topological evolution of the offsets for increasing radii. We describe methods to compute a filtration based…
Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…
The traditional approach to mobile phone positioning is based on the assumption that the geographical location of a cell tower recorded in a call details record (CDR) is a proxy for a device's location. A Voronoi tessellation is then…
We discover new Voronoi formulae for automorphic forms on GL($n$) for $n\geq 4$. There are $[n/2]$ different Voronoi formulae on GL($n$), which are Poisson summation formulae weighted by Fourier coefficients of the automorphic form with…
We study certain generic systems of real polynomial equations associated with triangulations of convex polytopes and investigate their number of real solutions. Our main focus is set on pairs of plane algebraic curves which form a so-called…
We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing to encode such structures into labeled maps with a…
In stark contrast to the case of images, finding a concise, learnable discrete representation of 3D surfaces remains a challenge. In particular, while polygon meshes are arguably the most common surface representation used in geometry…
We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is…
Let z be a primitive fifth root of unity and let F be the cyclotomic field F=Q(z). Let O be the ring of integers. We compute the Voronoi polyhedron of binary Hermitian forms over F and classify GL_2(O)-conjugacy classes of perfect forms.…
A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…
The 3D network originated by the faces of irregular Poissonian Voronoi Polyhedrons may represent the backbone on which the galaxies are originated. As a consequence the spatial appearance of the catalogs of galaxies can be reproduced. The…
Motivated by recent new Monte Carlo data we investigate a heuristic asymptotic theory that applies to n-faced 3D Poisson-Voronoi cells in the limit of large n. We show how this theory may be extended to n-edged cell faces. It predicts the…
We study the problem of maximum likelihood (ML) estimation for statistical models defined by reflexive polytopes. Our focus is on the maximum likelihood degree of these models as an algebraic measure of complexity of the corresponding…
We propose a new method for the numerical computation of the cut locus of a compact submanifold of $\mathbb{R}^3$ without boundary. This method is based on a convex variational problem with conic constraints, with proven convergence. We…
We study the problem of decomposing a volume bounded by a smooth surface into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled solution to this problem for generic smooth surfaces remained…
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…
We enumerate the low dimensional cells in the Voronoi cell complexes attached to the modular groups $SL_N(Z)$ and $GL_N(Z)$ for $N=8,9,10,11$, using quotient sublattices techniques for $N=8,9$ and linear programming methods for higher…
We study the problem of computing the Voronoi diagram of a set of $n^2$ points with $O(\log n)$-bit coordinates in the Euclidean plane in a substantially sublinear in $n$ number of rounds in the congested clique model with $n$ nodes.…
In this paper we study general highest weight modules $\mathbb{V}^\lambda$ over a complex finite-dimensional semisimple Lie algebra $\mathfrak{g}$. We present three formulas for the set of weights of a large family of modules…
Let $S$ be a planar $n$-point set. A triangulation for $S$ is a maximal plane straight-line graph with vertex set $S$. The Voronoi diagram for $S$ is the subdivision of the plane into cells such that all points in a cell have the same…