Related papers: Classifying Voronoi graphs of hex spheres
Perturbed lattices provide simple models for studying many physical systems. In this paper we study the distribution of Voronoi chains, blocks, and clusters with prescribed combinatorial features in the perturbed square lattice,…
The Hilbert metric is a distance function defined for points lying within a convex body. It generalizes the Cayley-Klein model of hyperbolic geometry to any convex set, and it has numerous applications in the analysis and processing of…
Angular Voronoi diagram was introduced by Asano et al. as fundamental research for a mesh generation. In an angular Voronoi diagram, the edges are curves of degree three. From view of computational robustness we need to treat the curves…
In this paper, we construct an algorithm for determining whether a given tessellation on a sphere is a spherical Laguerre Voronoi diagram or not. For spherical Laguerre tessellations, not only the locations of the Voronoi generators, but…
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…
Suppose M is a closed submanifold in a Euclidean ball of sufficiently large dimension. We give an optimal bound on the normal curvatures, guaranteeing that M is a sphere. The border cases consist of Veronese embeddings of the four…
The set of primitive vectors on large spheres in the euclidean space of dimension d>2 equidistribute when projected on the unit sphere. We consider here a refinement of this problem concerning the direction of the vector together with the…
A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…
A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a…
We have developed a novel method of determining 2D radial density profiles for astronomical systems of discrete objects using Voronoi tessellations. This Voronoi-based method was tested against the standard annulus-based method on 5…
Let two distinct $N$-simplexes be given in an Euclidean or pseudo-Euclidean $N+1$ dimensional space as each is defined by the coordinates of its $N+1$ vertexes. We consider the two families of $N$-spheres passing through the vertexes of the…
We introduce a framework for the generation of grid-shell structures that is based on Voronoi diagrams and allows us to design tessellations that achieve excellent static performances. We start from an analysis of stress on the input…
In this paper, we propose to compute Voronoi diagrams over mesh surfaces driven by an arbitrary geodesic distance solver, assuming that the input is a triangle mesh as well as a collection of sites $P=\{p_i\}_{i=1}^m$ on the surface. We…
Given a countable set of points in a continuous space, Voronoi tessellation is an intuitive way of partitioning the space according to the distance to the individual points. As a powerful approach to obtain structural information, it has a…
We classify biharmonic submanifolds with certain geometric properties in Euclidean spheres. For codimension 1, we determine the biharmonic hypersurfaces with at most two distinct principal curvatures and the conformally flat biharmonic…
In this paper we study the most-demanding predicate for computing the Euclidean Voronoi diagram of axes-aligned line segments, namely the Incircle predicate. Our contribution is two-fold: firstly, we describe, in algorithmic terms, how to…
A fullerene graph can be embedded in a piecewise linear 2-manifold with each non-hexagonal carbon ring corresponding to a cone vertex. Adjacent two or three such vertices can be combined as a cluster cut out from a parent cone round a…
We completely classify edge-to-edge tilings of the sphere by congruent quadrilaterals. As part of the classification, we also present a modern version of the classification of edge-to-edge tilings of the sphere by congruent triangles.…
This paper introduces nucleus clustering in Voronoi tessellations of plane surfaces with applications in the geometry of digital images. A \emph{nucleus cluster} is a collection of Voronoi regions that are adjacent to a Voronoi region…
The conchoid of a surface $F$ with respect to given fixed point $O$ is roughly speaking the surface obtained by increasing the radius function with respect to $O$ by a constant. This paper studies {\it conchoid surfaces of spheres} and…