2
* A kd-tree for nearest neighbour search.
6
* ***** BEGIN GPL LICENSE BLOCK *****
8
* This program is free software; you can redistribute it and/or
9
* modify it under the terms of the GNU General Public License
10
* as published by the Free Software Foundation; either version 2
11
* of the License, or (at your option) any later version.
13
* This program is distributed in the hope that it will be useful,
14
* but WITHOUT ANY WARRANTY; without even the implied warranty of
15
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16
* GNU General Public License for more details.
18
* You should have received a copy of the GNU General Public License
19
* along with this program; if not, write to the Free Software Foundation,
20
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
22
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
23
* All rights reserved.
25
* The Original Code is: none of this file.
27
* Contributor(s): Janne Karhu
30
* ***** END GPL LICENSE BLOCK *****
37
typedef struct KDTree KDTree;
39
typedef struct KDTreeNearest {
45
/* Creates or free a kdtree */
46
KDTree* BLI_kdtree_new(int maxsize);
47
void BLI_kdtree_free(KDTree *tree);
49
/* Construction: first insert points, then call balance. Normal is optional. */
50
void BLI_kdtree_insert(KDTree *tree, int index, float *co, float *nor);
51
void BLI_kdtree_balance(KDTree *tree);
53
/* Find nearest returns index, and -1 if no node is found.
54
* Find n nearest returns number of points found, with results in nearest.
55
* Normal is optional. */
56
int BLI_kdtree_find_nearest(KDTree *tree, float *co, float *nor, KDTreeNearest *nearest);
57
int BLI_kdtree_find_n_nearest(KDTree *tree, int n, float *co, float *nor, KDTreeNearest *nearest);