Arnel C Fajardo
Manuel L. Quezon University

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

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
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 3: September 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i3.pp1629-1636

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.