Modified brute force algorithm to solve the closest pair of points problem based on dynamic warping

Rhowel M. Dellosa, Arnel C Fajardo, Ruji P. Medina

Abstract


This paper introduces an algorithm to solve the closest pair of points problem in a 2D plane based on dynamic warping. The algorithm computes all the distances between the set of points P(x, y) and a reference point R(i, j), records all the result in a grid and finally determines the minimum distance using schematic steps. Results show that the algorithm of finding the closest pair of points has achieved less number of comparisons in determining the closest pair of points compared with the brute force and divide-and-conquer methods of the closest pair of points. 

Keywords


Brute Force, Closest Pair of Points, Divide-and-conquer, Dynamic Warping, Position Estimation

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v15.i3.pp1629-1636

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics