Related papers: Generalized Voronoi Diagrams and Lie Sphere Geomet…
We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. The framework is sufficiently general to support diagrams embedded on a family of two-dimensional…
For a given set of points $U$ on a sphere $S$, the order $k$ spherical Voronoi diagram $SV_k(U)$ decomposes the surface of $S$ into regions whose points have the same $k$ nearest points of $U$. Hyeon-Suk Na, Chung-Nim Lee, and Otfried…
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…
We describe the development of a new software tool, called "Pomelo", for the calculation of Set Voronoi diagrams. Voronoi diagrams are a spatial partition of the space around the particles into separate Voronoi cells, e.g. applicable to…
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…
A hex sphere is a singular Euclidean sphere with four cones points whose cone angles are (integer) multiples of 2*pi/3 but less than 2*pi. Given a hex sphere M, we consider its Voronoi decomposition centered at the two cone points with…
The Voronoi diagram-based dual-front active contour models are known as a powerful and efficient way for addressing the image segmentation and domain partitioning problems. In the basic formulation of the dual-front models, the evolving…
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…
Voronoi diagrams are a fundamental geometric data structure for obtaining proximity relations. We consider collections of axis-aligned orthogonal polyhedra in two and three-dimensional space under the max-norm, which is a particularly…
Voronoi and related diagrams have technological applications, for example, in motion planning and surface reconstruction, and also find significant use in materials science, molecular biology, and crystallography. Apollonius diagrams…
Surprisingly, the order-$k$ Voronoi diagram of line segments had received no attention in the computational-geometry literature. It illustrates properties surprisingly different from its counterpart for points; for example, a single…
We study Voronoi diagrams of manifolds and varieties with respect to polyhedral norms. We provide upper and lower bounds on the dimensions of Voronoi cells. For algebraic varieties, we count their full-dimensional Voronoi cells. As an…
Classical objects in computational geometry are defined by explicit relations. Several years ago the pioneering works of T. Asano, J. Matousek and T. Tokuyama introduced "implicit computational geometry", in which the geometric objects are…
Voronoi diagrams appear in many areas in science and technology and have numerous applications. They have been the subject of extensive investigation during the last decades. Roughly speaking, they are a certain decomposition of a given…
We show how one can associate to a given class of finite type G-structures a classifying Lie algebroid. The corresponding Lie groupoid gives models for the different geometries that one can find in the class, and encodes also the different…
We introduce VoroFields, a hierarchical neural-field framework for approximating generalized Voronoi diagrams of finite geometric site sets in low-dimensional domains under arbitrary evaluable point-to-site distances. Instead of…
In Lie sphere geometry, a cycle in $\RR^n$ is either a point or an oriented sphere or plane of codimension $1$, and it is represented by a point on a projective surface $\Omega\subset \PP^{n+2}$. The Lie product, a bilinear form on the…
We study Voronoi diagrams for distance functions that add together two convex functions, each taking as its argument the difference between Cartesian coordinates of two planar points. When the functions do not grow too quickly, then the…
The notion of a generalized Lie bialgebroid (a generalization of the notion of a Lie bialgebroid) is introduced in such a way that a Jacobi manifold has associated a canonical generalized Lie bialgebroid. As a kind of converse, we prove…
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point,…