 Computing either the Delaunay triangulation or the Voronoi diagram takes time.These approaches are not efficient for dimension , while the divide-and-conquer algorithm can be generalized to take time for any constant value of , with exponential dependency in "d".The dynamic version for the closest-pair problem is stated as follows