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: | , , |
|---|---|
| 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!
|
Internet
Get fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |