Related papers: Classifying Voronoi graphs of hex spheres
Let $M$ be a convex body and let $K$ be a closed convex surface $K$ both contained in the Euclidean space $\mathbb{E}^3$. What can we say about $M$ if $K$ encloses $M$ and if from all the points in $K$ the body $M$ looks the same? In this…
We classify the topological types of surfaces in the 3-dimensional unit sphere that contain both a great and a small circle through each point. In particular, these surfaces are homeomorphic to one of five normal forms and are either the…
We describe all possible topological structures of codimension one gradient vector fields on the shpere with at most ten singular points. To describe structures, we use a graph whose edges are one-dimensional stable manifolds. The…
We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…
Voronoi constellations (VCs) are finite sets of vectors of a coding lattice enclosed by the translated Voronoi region of a shaping lattice, which is a sublattice of the coding lattice. In conventional VCs, the shaping lattice is a scaled-up…
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 consider the distance minimization problem to a real algebraic variety $X \subseteq \RR^n$ when the metric is induced by a polyhedral norm. Each point in the variety has a Voronoi cell whose geometry depends on the normal space at the…
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
We present an analytically explicit study of optimal discrete quantization on spherical geometries equipped with the geodesic metric, focusing on highly symmetric configurations on the unit sphere $\mathbb S^2$. Three discrete uniform…
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,…
Many physical systems can be studied as collections of particles embedded in space, evolving through deterministic evolution equations. Natural questions arise concerning how to characterize these arrangements - are they ordered or…
Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…
Hexahedral (hex) meshing is a long studied topic in geometry processing with many fascinating and challenging associated problems. Hex meshes vary in complexity from structured to unstructured depending on application or domain of interest.…
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…
In this paper we provide a characterization for a class of convex curves on the 3-sphere. More precisely, using a theorem that decomposes a locally convex curve on the 3-sphere as a pair of curves on the 2-sphere, one of which is locally…
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…
The aim of this paper is to introduce the sublinear Higson corona and show that the sublinear Higson corona of Euclidean cone of P and X is decomposed into the product of P and that of X. Here P is a compact metric space and X is unbounded…
A half-geodesic is a closed geodesic realizing the distance between any pair of its points. All geodesics in a round sphere are half-geodesics. Conversely, this note establishes that Riemannian spheres with all geodesics closed and…
A spherical quadrilateral is a bordered surface homeomorphic to a closed disk, with four distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the…
Given a network, the statistical ensemble of its graph-Voronoi diagrams with randomly chosen cell centers exhibits properties convertible into information on the network's large scale structures. We define a node-pair level measure called…