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

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…

Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions with respect to a given probability measure. CVT…

We introduce a natural class of multicomponent local Poisson structures $\mathcal P_k + \mathcal P_1$, where $\mathcal P_1$ is a local Poisson bracket of order one and $\mathcal P_k$ is a homogeneous Poisson bracket of odd order $k$ under…

We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…

Spatial statistical analysis of multivariate volumetric data can be challenging due to scale, complexity, and occlusion. Advances in topological segmentation, feature extraction, and statistical summarization have helped overcome the…

The purpose of this work is to illustrate in a family of interesting examples how to study the representation theory of vertex operator superalgebras by combining the theory of vertex algebra extensions and modular forms. Let…

This paper consists of four general parts: convex sets; convex functions; convex optimization; and the interior-point algorithm. I will start by introducing the definition of convex sets and give three common convex set examples which will…

Vector equilibrium problems are a natural generalization to the context of partially ordered spaces of the Ky Fan inequality, where scalar bifunctions are replaced with vector bifunctions. In the present paper, the local geometry of the…

In this paper we associate to any $LS$-sequence of partitions ${\rho_{L,S}^n}$ the corresponding $LS$-sequence of points ${\xi_{L,S}^n}$ obtained reordering the points of each partition with an explicit algorithm. The procedure begins with…

We investigate an interpolation/extrapolation method that, given scattered observations of the Fourier transform, approximates its inverse. The interpolation algorithm takes advantage of modelling the available data via a shape-driven…

Given a finite set of points in general position in the plane or sphere, we count the number of ways to separate those points using two types of circles: circles through three of the points, and circles through none of the points (up to an…

Let d = (d1, d2, ..., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph.…

We generalize Abrahamse's interpolation theorem from the setting of a multiply connected domain to that of a more general Riemann surface. Our main result provides the scalar-valued interpolation theorem for the fixed-point subalgebra of…

Minimization diagrams encompass a large class of diagrams of interest in the literature, such as generalized Voronoi diagrams. We develop an abstract perturbation theory and perform a sensitivity analysis for functions depending on sets…

We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…

We prove that the Palm measure of the Ginibre process is obtained by removing a Gaussian distributed point from the process and adding the origin. We obtain also precise formulas describing the law of the typical cell of Ginibre--Voronoi…

We describe an efficient practical procedure for enumerating and regrouping vacuum Feynman graphs of a given order in perturbation theory. The method is based on a combination of Schwinger-Dyson equations and the two-particle-irreducible…

We discuss a method of finding skyline or non-dominated sites in a set $P$ of $n$ point sites with respect to a set $S$ of $m$ points. A site $p \in P$ is non-dominated if and only if for each $q \in P \setminus \{p\}$, there exists at…

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha)n vertices of degree at least (1+alpha)k contains each tree…

Testing of the disjunction hypothesis is appropriate when each gene or location studied is associated with multiple $p$-values, each of which is of individual interest. This can occur when more than one aspect of an underlying process is…