Related papers: Sibson's formula for higher order Voronoi diagrams

For various series of complex semi-simple Lie algebras $\fg (t)$ equipped with irreducible representations $V(t)$, we decompose the tensor powers of $V(t)$ into irreducible factors in a uniform manner, using a tool we call {\it diagram…

General models of Gibbs Delaunay-Voronoi tessellations, which can be viewed as extensions of Ord's process, are considered. The interaction may occur on each cell of the tessellation and between neighbour cells. The tessellation may also be…

For a Borel set $A$ and a homogeneous Poisson point process $\eta$ in $\R^d$ of intensity $\lambda >0$, define the Poisson--Voronoi approximation $ A_\eta$ of $A$ as a union of all Voronoi cells with nuclei from $\eta$ lying in $A$. If $A$…

The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…

Every isometry $\sigma$ of a positive-definite even lattice $Q$ can be lifted to an automorphism of the lattice vertex algebra $V_Q$. An important problem in vertex algebra theory and conformal field theory is to classify the…

The Voronoi tessellation is a natural way of space segmentation, which has many applications in various fields of science and technology, as well as in social sciences and visual art. The varieties of the Voronoi tessellation methods are…

A continous map $f: \mathbb{C}^n \rightarrow \mathbb{C}^N$ is $k$-regular if the image of any $k$ points spans a $k$-dimensional subspace. It is an important problem in topology and interpolation theory, going back to Borsuk and Chebyshev,…

Every real algebraic variety determines a Voronoi decomposition of its ambient Euclidean space. Each Voronoi cell is a convex semialgebraic set in the normal space of the variety at a point. We compute the algebraic boundaries of these…

We consider the three-dimensional Poisson-Voronoi tessellation and study the average facedness m_n of a cell known to neighbor an n-faced cell. Whereas Aboav's law states that m_n=A+B/n, theoretical arguments indicate an asymptotic…

A Voronoi diagram is a basic geometric structure that partitions the space into regions associated with a given set of sites, such that all points in a region are closer to the corresponding site than to all other sites. While being…

This article presents an algorithm to compute digital images of Voronoi, Johnson-Mehl or Laguerre diagrams of a set of punctual sites, in a domain of a Euclidean space of any dimension. The principle of the algorithm is, in a first step, to…

A family of interpolating graphs $\calC (S, \xi)$ of complexity $\xi$ is constructed for a surface $S$ and $-2 \leq \xi \leq \xi (S)$. For $\xi = -2, -1, \xi (S) -1$ these specialise to graphs quasi-isometric to the marking graph, the pants…

We use Lie sphere geometry to describe two large categories of generalized Voronoi diagrams that can be encoded in terms of the Lie quadric, the Lie inner product, and polyhedra. The first class consists of diagrams defined in terms of…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Cells of Voronoi diagrams in two dimensions are usually considered as having edges of zero width. However, this is not the case in several experimental situations in which the thickness of the edges of the cells is relatively large. In this…

For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…

Let $P$ be a simple polygon with $n$ vertices. For any two points in $P$, the geodesic distance between them is the length of the shortest path that connects them among all paths contained in $P$. Given a set $S$ of $m$ sites being a subset…

We study algorithms and combinatorial complexity bounds for \emph{stable-matching Voronoi diagrams}, where a set, $S$, of $n$ point sites in the plane determines a stable matching between the points in $\mathbb{R}^2$ and the sites in $S$…

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…

A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and neither its uniqueness nor its existence are obvious in…