This paper proposes a new method based on DV-Hop algorithm and
Voronoi diagram (VNC-DV-Hop, Voronoi diagram-based NC-DV-Hop).
STRIPACK Fortran 77 software package that employs an incremental algorithm to construct a Delaunay triangulation and, optionally, a
Voronoi diagram of a set of points (nodes) on the surface of the unit sphere.
Recently, Wu and Cao [11] proposed a
Voronoi Diagram based cooperative cache discovery approach to reduce data access cost by limiting the cache information update and query within a single Voronoi Region.
Voronoi diagram is a popular approach in geometric extraction for calculating the skeleton from mesh vertices.
In this section, we will briefly describe a method based on the approximated area
Voronoi diagram for solving the page segmentation task of a layout analysis system [5].
For ease of exposition, consider tessellation of this region by a second order
Voronoi diagram (2-OVD) only.
Caption: Figure 1 Example of a
Voronoi Diagram Partitioning the Euclidean Plane (Where R.
A Voronoi tessellation, or
Voronoi diagram, partitions a space into a set of mutually exclusive regions, with a number of given seeds.
In this method, the cohesive material is replaced by an assemblage of polygonal discrete elements (rigid blocks) by using the
Voronoi diagram. The blocks are bonded by contact interfaces.
Visibility graph [15-17] and
Voronoi diagram [18-20] are two typical road-map approaches, which have achieved better results with dramatically various types of roads.