Description: Voronoi Diagram algorithm is mainly using the method of partition and the method of convex hull.
Divide and conquer method:
1) reduced to a certain degree the problem can be easily solved
2) the problem can be broken down into several smaller same problem, that is, the problem is in the nature of optimal substructure.
3) by using the solution of problem into sub-problems can be combined for the solution of the problem
4) the decomposition of the problem each subproblem is independent of each other, between the subproblems do not contain public subproblems.
To Search:
File list (Check if you may need any files):
voronoi\voronoi.cpp
.......\voronoi.h
voronoi
Download