New functions to save the built KDTree on disk
This commit is contained in:
parent
707eaefbe1
commit
f04e7dd41b
3 changed files with 176 additions and 19 deletions
|
@ -1,10 +1,12 @@
|
|||
#define __KD_TREE_SAVE_ON_DISK
|
||||
#include <ctime>
|
||||
#include <cassert>
|
||||
#include <cstdlib>
|
||||
#include <iostream>
|
||||
#include <fstream>
|
||||
#include "mykdtree.hpp"
|
||||
|
||||
#define NTRY 5000000
|
||||
#define NTRY 50000
|
||||
#define ND 2
|
||||
|
||||
using namespace std;
|
||||
|
@ -15,28 +17,29 @@ typedef MyTree::Cell MyCell;
|
|||
|
||||
MyCell *findNearest(MyTree::coords& xc, MyCell *cells, uint32_t Ncells)
|
||||
{
|
||||
MyCell *near2 = 0;
|
||||
double R2 = INFINITY;
|
||||
for (int i = 0; i < Ncells; i++)
|
||||
{
|
||||
double d2 = 0;
|
||||
for (int j = 0; j < ND; j++)
|
||||
{
|
||||
double delta = xc[j]-cells[i].coord[j];
|
||||
d2 += delta*delta;
|
||||
}
|
||||
if (d2 < R2)
|
||||
{
|
||||
near2 = &cells[i];
|
||||
R2 = d2;
|
||||
}
|
||||
}
|
||||
return near2;
|
||||
MyCell *near2 = 0;
|
||||
double R2 = INFINITY;
|
||||
for (int i = 0; i < Ncells; i++)
|
||||
{
|
||||
double d2 = 0;
|
||||
for (int j = 0; j < ND; j++)
|
||||
{
|
||||
double delta = xc[j]-cells[i].coord[j];
|
||||
d2 += delta*delta;
|
||||
}
|
||||
if (d2 < R2)
|
||||
{
|
||||
near2 = &cells[i];
|
||||
near2->val = i;
|
||||
R2 = d2;
|
||||
}
|
||||
}
|
||||
return near2;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
uint32_t Ncells = 100000;
|
||||
uint32_t Ncells = 3000;
|
||||
MyCell *cells = new MyCell[Ncells];
|
||||
|
||||
for (int i = 0; i < Ncells; i++)
|
||||
|
@ -72,6 +75,7 @@ int main()
|
|||
|
||||
for (int k = 0; k < NTRY; k++) {
|
||||
MyCell *near = tree.getNearestNeighbour(xc[k]);
|
||||
near->val = 0;
|
||||
}
|
||||
|
||||
clock_t endTimer = clock();
|
||||
|
@ -89,6 +93,31 @@ int main()
|
|||
myTime = delta*1.0/CLOCKS_PER_SEC * 1000000.0;
|
||||
|
||||
cout << "Direct search/sec = " << myTime/NTRY << " us" << endl;
|
||||
|
||||
{
|
||||
ofstream f("kd.dat");
|
||||
tree.saveTree(f);
|
||||
}
|
||||
|
||||
cout << "Trying to reload the tree" << endl;
|
||||
{
|
||||
ifstream f("kd.dat");
|
||||
MyTree tree2(f, cells, Ncells);
|
||||
cout << "Check timing..." << endl;
|
||||
// Check timing
|
||||
clock_t startTimer = clock();
|
||||
|
||||
for (int k = 0; k < NTRY; k++) {
|
||||
MyCell *near = tree.getNearestNeighbour(xc[k]);
|
||||
}
|
||||
|
||||
clock_t endTimer = clock();
|
||||
clock_t delta = endTimer-startTimer;
|
||||
double myTime = delta*1.0/CLOCKS_PER_SEC * 1000000.0;
|
||||
|
||||
cout << "KDTree search/sec = " << myTime/NTRY << " us" << endl;
|
||||
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue