The farthest line-segment Voronoi diagram shows properties surprisingly different than the farthest point Voronoi diagram: Voronoi regions may be disconnected and they are not characterized by convexhull properties. In this paper we introduce the farthest line-segment hull, a cyclic structure that relates to the farthest line-segment Voronoi diagram similarly to the way an ordinary convex hull ...

We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram computation are applicable to both static and dynamic environments of fairly high complexity. We compute a discrete Voronoi diagram by rendering a three-dimensional distance mesh for each Voronoi site. The sites can be...

We generate Voronoi meshes over three dimensional domains with prescribed boundaries. Voronoi cells are clipped at one-sided domain boundaries. The seeds of Voronoi cells are generated by maximal Poisson-disk sampling. In contrast to centroidal Voronoi tessellations, our seed locations are unbiased. The exception is some bias near concave features of the boundary to ensure well-shaped cells. Th...

Numerical Vorono tessellation is used to investigate the mechanisms of frustration in some model glass systems. First, random packings of 8192 hard spheres of increasing volume fraction c are built in the at three dimensional space using an eecient computer algorithm. Their Vorono statistics evolves with c as if the system would like to reach a pure icosahe-dral order when extrapolating the vol...

Facial features determination is essential in many applications such as personal identification, 3D face modeling and model based video coding. Fast and accurate facial feature extraction is still a filed to be explored. In this paper, an automatic extracting algorithm is developed to locate “key points” of facial features. The Delaunay Triangulation/Voronoi Diagram technique well known in comp...

To solve the problem of coverage performance assessment, this study proposes an evaluation method based on the trajectory of the target, which is applicable to universal sensor networks, including both heterogeneous and homogeneous sensor networks. Different from the traditional Voronoi algorithm, the proposed Improved Coverage Force Division (ICFD) plans a coverage force division map whichscal...

It is proved that in the Voronoi model for percolation in dimension 2 and 3, the crossing probabilities are asymptotically invariant under conformal change of metric. To deene Voronoi percolation on a manifold M , you need a measure , and a Riemannian metric ds. Points are scattered according to a Poisson point process on (M;), with some density. Each cell in the Voronoi tessellation determined...

We investigate the higher-order Voronoi diagrams of n point sites with respect to the geodesic distance in a simple polygon with h > 0 polygonal holes and c corners. Given a set of n point sites, the korder Voronoi diagram partitions the plane into several regions such that all points in a region share the same k nearest sites. The nearest-site (first-order) geodesic Voronoi diagram has already...

The damage spreading of the Ising model on several two-dimensional trivalent structures, including soap froth, Voronoi, and hierarchical structures, are studied with competing Glauber and Kawasaki dynamics. The damage spreading transition temperature T(d) and the Curie temperature T(C) of these structures are compared. We find that T(d) of the hierarchical lattices decreases sharply as the prob...

A new generalized Voronoi diagram is defined on the surface of a river with unifonn flow; a point belongs to the territory of a site if and only if a boat starting from the site can reach the point faster than a boat starting from any other site. If the river runs slower than the boat, the Voronoi diagram can be obtained from the ordinary Voronoi diagram by a certain transformation, whereas if ...