9,695 research outputs found
Bregman Voronoi Diagrams: Properties, Algorithms and Applications
The Voronoi diagram of a finite set of objects is a fundamental geometric
structure that subdivides the embedding space into regions, each region
consisting of the points that are closer to a given object than to the others.
We may define many variants of Voronoi diagrams depending on the class of
objects, the distance functions and the embedding space. In this paper, we
investigate a framework for defining and building Voronoi diagrams for a broad
class of distance functions called Bregman divergences. Bregman divergences
include not only the traditional (squared) Euclidean distance but also various
divergence measures based on entropic functions. Accordingly, Bregman Voronoi
diagrams allow to define information-theoretic Voronoi diagrams in statistical
parametric spaces based on the relative entropy of distributions. We define
several types of Bregman diagrams, establish correspondences between those
diagrams (using the Legendre transformation), and show how to compute them
efficiently. We also introduce extensions of these diagrams, e.g. k-order and
k-bag Bregman Voronoi diagrams, and introduce Bregman triangulations of a set
of points and their connexion with Bregman Voronoi diagrams. We show that these
triangulations capture many of the properties of the celebrated Delaunay
triangulation. Finally, we give some applications of Bregman Voronoi diagrams
which are of interest in the context of computational geometry and machine
learning.Comment: Extend the proceedings abstract of SODA 2007 (46 pages, 15 figures
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
In the Hausdorff Voronoi diagram of a family of \emph{clusters of points} in
the plane, the distance between a point and a cluster is measured as
the maximum distance between and any point in , and the diagram is
defined in a nearest-neighbor sense for the input clusters. In this paper we
consider %El."non-crossing" \emph{non-crossing} clusters in the plane, for
which the combinatorial complexity of the Hausdorff Voronoi diagram is linear
in the total number of points, , on the convex hulls of all clusters. We
present a randomized incremental construction, based on point location, that
computes this diagram in expected time and expected
space. Our techniques efficiently handle non-standard characteristics of
generalized Voronoi diagrams, such as sites of non-constant complexity, sites
that are not enclosed in their Voronoi regions, and empty Voronoi regions. The
diagram finds direct applications in VLSI computer-aided design.Comment: arXiv admin note: substantial text overlap with arXiv:1306.583
Geodesic-Preserving Polygon Simplification
Polygons are a paramount data structure in computational geometry. While the
complexity of many algorithms on simple polygons or polygons with holes depends
on the size of the input polygon, the intrinsic complexity of the problems
these algorithms solve is often related to the reflex vertices of the polygon.
In this paper, we give an easy-to-describe linear-time method to replace an
input polygon by a polygon such that (1)
contains , (2) has its reflex
vertices at the same positions as , and (3) the number of vertices
of is linear in the number of reflex vertices. Since the
solutions of numerous problems on polygons (including shortest paths, geodesic
hulls, separating point sets, and Voronoi diagrams) are equivalent for both
and , our algorithm can be used as a preprocessing
step for several algorithms and makes their running time dependent on the
number of reflex vertices rather than on the size of
An obstruction to Delaunay triangulations in Riemannian manifolds
Delaunay has shown that the Delaunay complex of a finite set of points of
Euclidean space triangulates the convex hull of , provided
that satisfies a mild genericity property. Voronoi diagrams and Delaunay
complexes can be defined for arbitrary Riemannian manifolds. However,
Delaunay's genericity assumption no longer guarantees that the Delaunay complex
will yield a triangulation; stronger assumptions on are required. A natural
one is to assume that is sufficiently dense. Although results in this
direction have been claimed, we show that sample density alone is insufficient
to ensure that the Delaunay complex triangulates a manifold of dimension
greater than 2.Comment: This is a revision and extension of a note that appeared as an
appendix in the (otherwise unpublished) report arXiv:1303.649
- …