-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_nnrtree.cpp
48 lines (43 loc) · 1.51 KB
/
test_nnrtree.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include "NNRTree.h"
#include <iostream>
int main()
{
size_t const dim = 7;
NNRTree n(dim);
double pt0[] = {1, 2, 3, 4, 5, 6, 7};
double pt1[] = {10, 2, 3, 4, 5, 6, 7};
double pt2[] = {2, 2, 3, 4, 5, 6, 7};
double pt3[] = {9, 2, 3, 4, 5, 6, 7};
// Insert points and their corresponding IDs
n.insert_point(pt0, 0);
n.insert_point(pt1, 1);
n.insert_point(pt2, 2);
n.insert_point(pt3, 3);
/***************************************************************************/
// Query k-nearest neighbors
{
double pt_query[] = {8, 2, 3, 4, 5, 6, 7};
// Now, query the 2 nearest neighbors that are close to the pt_query
vector<size_t> IDs = n.query_knn(pt_query, 2);
cout << "Closest IDs are: " << endl;
for (int i = 0; i < IDs.size(); i++)
{
cout << "ID: " << IDs[i] << endl;
}
}
/***************************************************************************/
/***************************************************************************/
// Query range
{
double pt_query[] = {8, 2, 3, 4, 5, 6, 7};
// Now, query a range around pt_query
vector<size_t> IDs = n.query_range(pt_query, 3, NNRTree::QueryType::RANGE_MODE_INF_NORM);
cout << "IDs within range are: " << endl;
for (int i = 0; i < IDs.size(); i++)
{
cout << "ID: " << IDs[i] << endl;
}
}
/***************************************************************************/
return 0;
}