Computer Science – Computational Geometry
Scientific paper
2011-11-10
International Journal of Computer Science & Information Technology (IJCSIT) Vol 3, No 5, 2011, 211-219
Computer Science
Computational Geometry
arXiv admin note: substantial text overlap with arXiv:1010.5908
Scientific paper
10.5121/ijcsit.2011.3519
Divide and Conquer is a well known algorithmic procedure for solving many kinds of problem. In this procedure, the problem is partitioned into two parts until the problem is trivially solvable. Finding the distance of the closest pair is an interesting topic in computer science. With divide and conquer algorithm we can solve closest pair problem. Here also the problem is partitioned into two parts until the problem is trivially solvable. But it is theoretically and practically observed that sometimes partitioning the problem space into more than two parts can give better performances. In this paper, a new proposal is given that dividing the problem space into (n) number of parts can give better result while divide and conquer algorithm is used for solving the closest pair of point's problem.
Akter Nargis
Karim Mohammad Zaidul
No associations
LandOfFree
Optimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem 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 Optimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-727786