Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...
We consider finite sets of oriented spheres in Rk−1 and, by interpreting such spheres as points in Rk , study the Voronoi diagrams they induce for several variants of distance ...
Franz Aurenhammer, Johannes Wallner, Martin Petern...
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predet...
Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. T...
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
The spatial cosmic matter distribution on scales of a few up to more than a hundred Megaparsec1 displays a salient and pervasive foamlike pattern. Voronoi tessellations are a vers...
Galaxy formation models oriented towards a ΛCDM cosmology envision galaxies as being built through the accretion of dwarf galaxies. Such galaxy accretion should appear as tidally...
Three strategies are presented for developing a knowledge-based statistical contact potential from computationally hydrated proteins that may be useful in studies of protein foldi...