An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

Details An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

2010-10-28

arxiv.org/abs/1010.5908v2

Computer Science

Computational Geometry

13 pages

Scientific paper

We present an engineered version of the divide-and-conquer algorithm for finding the closest pair of points, within a given set of points in the XY-plane. In this version of the algorithm, only two pairwise comparisons are required in the combine step, for each point that lies in the 2 delta-wide vertical slab. The correctness of the algorithm is shown for all Minkowski distances with p>=1. We also show empirically that, although the time complexity of the algorithm is still O(n lg n), the reduction in the total number of comparisons leads to a significant reduction in the total execution time, for inputs with size sufficiently large.

Affiliated with

Also associated with

No associations

Rating

An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583569