Modified brute force algorithm to solve the closest pair of points problem based on dynamic warping
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 distanc...
Saved in:
Main Authors: | Dellosa, Rhowel M. (Author), Fajardo, Arnel C (Author), Medina, Ruji P. (Author) |
---|---|
Format: | EJournal Article |
Published: |
Institute of Advanced Engineering and Science,
2019-09-01.
|
Subjects: | |
Online Access: | Get fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Modified fingerprinting localization technique of indoor positioning system based on coordinates
by: M. Dellosa, Rhowel, et al.
Published: (2019) -
Brute force algorithm implementation for traveljoy travelling recommendation system
by: Samah, K.A.F.A, et al.
Published: (2019) -
Brutes ou braves gens
by: Antoine Follain
Published: (2015) -
Indonesian sign language recognition using kinect and dynamic time warping
by: Nurul Khotimah, Wijayanti, et al.
Published: (2019) -
Modified Blowfish Algorithm
by: Quilala, Theda Flare Ginoy, et al.
Published: (2018)