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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
/*
* main.c
* NearTree
*
* Copyright 2001, 2008 Larry Andrews. All rights reserved
* Revised 12 Dec 2008 for sourceforge release -- H. J. Bernstein
*/
/**********************************************************************
* *
* YOU MAY REDISTRIBUTE NearTree UNDER THE TERMS OF THE LGPL *
* *
**********************************************************************/
/************************* LGPL NOTICES *******************************
* *
* This library is free software; you can redistribute it and/or *
* modify it under the terms of the GNU Lesser General Public *
* License as published by the Free Software Foundation; either *
* version 2.1 of the License, or (at your option) any later version. *
* *
* This library is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
* Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public *
* License along with this library; if not, write to the Free *
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, *
* MA 02110-1301 USA *
* *
**********************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <time.h>
#include <CVector.h>
#ifndef USE_LOCAL_HEADERS
#include <rhrand.h>
#else
#include "rhrand.h"
#endif
CRHrand rhr;
#ifndef USE_LOCAL_HEADERS
#include <CNearTree.h>
#else
#include "CNearTree.h"
#endif
int main ( int argc, char** argv )
{
CNearTreeHandle treehandle;
double v[3],vSearch[3];
double * vBest;
void * vvBest;
CVectorHandle vReturn;
CVectorHandle dDs;
CVectorHandle stIndices;
CVectorHandle oReturn;
double xdist;
long i,j,k;
const long lMaxRow = 10;
double dRad = 0.6;
CNearTreeCreate(&treehandle,3,CNEARTREE_TYPE_DOUBLE);
CVectorCreate(&vReturn,sizeof(void *),10);
CVectorCreate(&oReturn,sizeof(void *),10);
CVectorCreate(&dDs,sizeof(double),10);
CVectorCreate(&stIndices,sizeof(size_t),10);
if (argc <= 1) {
CRHrandSrandom(&rhr, (int)time( NULL ) ); /* use the current time to seed the
random number generator */
} else {
CRHrandSrandom(&rhr, (int)atoi(argv[1]));
}
/*---------------------------------------
build up a library of points to search among
---------------------------------------*/
for ( k=-1; k<=lMaxRow; k++ )
{
for ( j=-1; j<=lMaxRow; j++)
{
for ( i= lMaxRow ; i>=-1; i-- )
{ v[0] = (double)i; v[1] = (double)j; v[2] = (double)k;
CNearTreeInsert(treehandle,&v[0],NULL);
} /* for i */
} /* for j */
} /* for k */
fprintf(stdout,"\n");
/*---------------------------------------
Done building the tree; now try a retrieval
---------------------------------------*/
for ( i=0; i<10; i++ )
{ double x, y, z;
dRad += 0.05;
x = CRHrandUrand(&rhr) * ((double) lMaxRow );
y = x;
z = ( 1.25 * ((double) lMaxRow) - 1.5 * x );
vSearch[0] = x; vSearch[1] = 0.5*(x+y); vSearch[2] = z;
fprintf(stdout,"Trial %ld from probe point [%g, %g, %g]\n",
i, vSearch[0], vSearch[1], vSearch[2]);
/* find the nearest point to vSearch */
if ( !CNearTreeNearestNeighbor(treehandle,dRad,&vvBest,NULL,vSearch))
{ vBest = (double *)vvBest;
fprintf(stdout," Closest distance %g to [%g, %g, %g]\n",
sqrt(CNearTreeDistsq((void *)vSearch,vvBest,3,CNEARTREE_TYPE_DOUBLE)),
vBest[0],vBest[1],vBest[2]);
}
else
{ fprintf(stdout," ***** nothing within %g of [%g, %g, %g]\n",
dRad, vSearch[0], vSearch[1], vSearch[2]);
}
/* find the farthest point from vSearch */
if ( !CNearTreeFarthestNeighbor(treehandle,&vvBest,NULL,vSearch))
{ vBest = (double *)vvBest;
fprintf(stdout," Farthest distance %g to [%g, %g, %g]\n",
sqrt(CNearTreeDistsq(vSearch,vBest,3,CNEARTREE_TYPE_DOUBLE)),
vBest[0],vBest[1],vBest[2]);
}
else
{ fprintf(stdout," No Farthest object found\n");
}
/* search for all points within a "sphere" out to radius dRad */
CVectorClear( dDs );
CVectorClear( stIndices );
CVectorClear( vReturn );
CVectorClear( oReturn );
if ( !CNearTreeFindInSphere( treehandle, dRad, vReturn, oReturn, vSearch,1 ) )
{
size_t index, jndex, kndex, tndex;
void * prevpoint;
void * foundpoint;
void * localmetrics;
void * localindices;
int redo;
fprintf(stdout," Returned %lu items within %g of [%g,%g,%g]\n",
(long unsigned int)vReturn->size, dRad, vSearch[0], vSearch[1], vSearch[2]);
for (index=0; index < CVectorSize(vReturn); index++) {
CVectorGetElement(vReturn,&foundpoint,index);
xdist = CNearTreeDist(treehandle,(void CNEARTREE_FAR *)foundpoint,
(void CNEARTREE_FAR *)vSearch);
CNearTreeSortIn(dDs,stIndices,xdist,index,CVectorSize(vReturn));
}
CVectorGetElementptr(dDs, &localmetrics,0);
CVectorGetElementptr(stIndices, &localindices,0);
redo = 1;
while (redo == 1) {
redo = 0;
for (index=1; index < CVectorSize(stIndices); index++) {
CVectorGetElement(stIndices,&jndex,index-1);
CVectorGetElement(stIndices,&kndex,index);
CVectorGetElement(vReturn,&prevpoint,jndex);
CVectorGetElement(vReturn,&foundpoint,kndex);
if (fabs(((double *)localmetrics)[jndex]-((double *)localmetrics)[kndex])
<=DBL_EPSILON*fabs(((double*)localmetrics)[jndex]+((double*)localmetrics)[kndex])) {
if ( ( ((double *)foundpoint)[0] < ((double *)prevpoint)[0] )
||( ((double *)foundpoint)[0] == ((double *)prevpoint)[0]
&& ((double *)foundpoint)[1] < ((double *)prevpoint)[1])
|| ( ((double *)foundpoint)[0] == ((double *)prevpoint)[0]
&& ((double *)foundpoint)[1] == ((double *)prevpoint)[1]
&& ((double *)foundpoint)[1] < ((double *)prevpoint)[1])
) {
tndex = ((size_t *)localindices)[index-1];
((size_t *)localindices)[index-1] = ((size_t *)localindices)[index];
((size_t *)localindices)[index] = tndex;
CVectorSetFlags(stIndices,0);
redo = 1;
}
}
}
}
for (index=0; index < CVectorSize(stIndices); index++) {
CVectorGetElement(stIndices,&jndex,index);
CVectorGetElement(vReturn,&foundpoint,jndex);
fprintf (stdout,"\t [%g,%g,%g]\n",((double *)foundpoint)[0],
((double *)foundpoint)[1],
((double *)foundpoint)[2]);
}
}
fprintf(stdout," -------------------------------------------------------------\n");
} /* for i */
CNearTreeFree(&treehandle);
return ( EXIT_SUCCESS );
}
|
