Related papers: Constructing Two-Dimensional Voronoi Diagrams via …
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…
For the analysis of systems consisting of small, regular objects, the methods of mathematical morphology applied to images of these systems are well-suited. One of these methods is the use of Voronoi polygons. It was found that the Voronoi…
This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which…
This paper introduces a new approach toward characterizing local structural features of two-dimensional particle systems. The approach can accurately identify and characterize defects in high-temperature crystals, distinguish a wide range…
The Voronoi diagrams are an important tool having theoretical and practical applications in a large number of fields. We present a new procedure, implemented as a set of CUDA kernels, which detects, in a general and efficient way,…
In this paper, we study a generalization of the classical Voronoi diagram, called clustering induced Voronoi diagram (CIVD). Different from the traditional model, CIVD takes as its sites the power set $U$ of an input set $P$ of objects. For…
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…
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…
We investigate the problem of image retrieval based on visual queries when the latter comprise arbitrary regions-of-interest (ROI) rather than entire images. Our proposal is a compact image descriptor that combines the state-of-the-art in…
Cellular structures manifest their outstanding mechanical properties in many biological systems. One key challenge for designing and optimizing these geometrically complicated structures lies in devising an effective geometric…
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…
We consider the following variant of the Monge-Kantorovich transportation problem. Let S be a finite set of point sites in d dimensions. A bounded set C in d-dimensional space is to be distributed among the sites p in S such that (i) each p…
We develop a framework for algorithms finding the diameter in graphs of bounded distance Vapnik-Chervonenkis dimension, in (parameterized) subquadratic time complexity. The class of bounded distance VC-dimension graphs is wide, including,…
In this paper, we develop constructive algorithms for generating quasi-uniform point sets and sequences over arbitrary two-dimensional triangular domains. Our proposed method, called the \emph{Voronoi-guided greedy packing} algorithm,…
The use of numerical simulations in science is ever increasing and with it the computational size. In many cases single processors are no longer adequate and simulations are run on multiple core machines or supercomputers. One of the key…
Probing the structure of complex astrophysical objects requires effective three-dimensional (3D) numerical simulation of the relevant radiative transfer (RT) processes. As with any numerical simulation code, the choice of an appropriate…
We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our…
Deep learning has been used as a powerful tool for various tasks in computer vision, such as image segmentation, object recognition and data generation. A key part of end-to-end training is designing the appropriate encoder to extract…
Although Poisson-Voronoi diagrams have interesting mathematical properties, there is still much to discover about the geometrical properties of its grains. Through simulations, many authors were able to obtain numerical approximations of…
We use a simple fragmentation model to describe the statistical behavior of the Voronoi cell patterns generated by a set of points in 1D and in 2D. In particular, we are interested in the distribution of sizes of these Voronoi cells. Our…