Related papers: Higher signature Delaunay decompositions
A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the…
Delaunay has shown that the Delaunay complex of a finite set of points $P$ of Euclidean space $\mathbb{R}^m$ triangulates the convex hull of $P$, provided that $P$ satisfies a mild genericity property. Voronoi diagrams and Delaunay…
A polytope $D$ whose vertices belong to a lattice of rank $d$ is Delaunay if there is a circumscribing $d$-dimensional ellipsoid, $E$, with interior free of lattice points so that the vertices of $D$ lie on $E$. If in addition, the…
We prove that Delaunay surfaces, except the plane and the catenoid, are the only surfaces in Euclidean space with nonzero constant mean curvature that can be expressed as an implicit equation of type $f(x)+g(y)+h(z)=0$, where $f$, $g$ and…
The discrete Laplacian on Euclidean triangulated surfaces is a well-established notion. We introduce discrete Laplacians on spherical and hyperbolic triangulated surfaces. On the one hand, our definitions are close to the Euclidean one in…
We generalize the classic definition of Delaunay triangulation and prove that for a locally finite and coarsely dense generic point set, $A \subseteq \mathbb{R}^d$, the $d$-simplices whose vertices belong to $A$ and whose circumscribed…
The Hilbert metric is a distance function defined for points lying within the interior of a convex body. It arises in the analysis and processing of convex bodies, machine learning, and quantum information theory. In this paper, we show how…
A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of…
A Delone set in $\mathbb{R}^n$ is a set such that (a) the distance between any two of its points is uniformly bounded below by a strictly positive constant and such that (b) the distance from any point to the remaining points in the set is…
In this paper, we determine the topology of the spaces of convex polyhedra inscribed in the unit $2$-sphere and the spaces of strictly Delaunay geodesic triangulations of the unit $2$-sphere. These spaces can be regarded as discretized…
We present an algorithm that takes as input a finite point set in Euclidean space, and performs a perturbation that guarantees that the Delaunay triangulation of the resulting perturbed point set has quantifiable stability with respect to…
This paper introduces path triangulation of points in a bounded, simply connected surface region, replacing ordinary triangles in a Delaunay triangulation with path triangles from homotopy theory. A {\bf path triangle} has a border that is…
This article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved. To describe…
We show that a strong well-based cylindrical algebraic decomposition P of a bounded semi-algebraic set is a regular cell decomposition, in any dimension and independently of the method by which P is constructed. Being well-based is a global…
Superdeformed nuclei in the 190 mass region exhibit a striking universality in their decay-out profiles. We show that this universality can be explained in the two-level model of superdeformed decay as related to a strong separation of…
Here we introduce the Delaunay Density Estimator Method. Its purpose is rendering a fully volume-covering reconstruction of a density field from a set of discrete data points sampling this field. Reconstructing density or intensity fields…
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 introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result…
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…
A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…