Statistics
| Branch: | Revision:

root / rgbdslam / gicp / ann_1.1.1 / src / kd_fix_rad_search.h @ 9240aaa3

History | View | Annotate | Download (1.76 KB)

1
//----------------------------------------------------------------------
2
// File:                        kd_fix_rad_search.h
3
// Programmer:                Sunil Arya and David Mount
4
// Description:                Standard kd-tree fixed-radius kNN search
5
// Last modified:        05/03/05 (Version 1.1)
6
//----------------------------------------------------------------------
7
// Copyright (c) 1997-2005 University of Maryland and Sunil Arya and
8
// David Mount.  All Rights Reserved.
9
// 
10
// This software and related documentation is part of the Approximate
11
// Nearest Neighbor Library (ANN).  This software is provided under
12
// the provisions of the Lesser GNU Public License (LGPL).  See the
13
// file ../ReadMe.txt for further information.
14
// 
15
// The University of Maryland (U.M.) and the authors make no
16
// representations about the suitability or fitness of this software for
17
// any purpose.  It is provided "as is" without express or implied
18
// warranty.
19
//----------------------------------------------------------------------
20
// History:
21
//        Revision 1.1  05/03/05
22
//                Initial release
23
//----------------------------------------------------------------------
24

    
25
#ifndef ANN_kd_fix_rad_search_H
26
#define ANN_kd_fix_rad_search_H
27

    
28
#include "kd_tree.h"                                        // kd-tree declarations
29
#include "kd_util.h"                                        // kd-tree utilities
30
#include "pr_queue_k.h"                                        // k-element priority queue
31

    
32
#include <ANN/ANNperf.h>                                // performance evaluation
33

    
34
//----------------------------------------------------------------------
35
//        Global variables
36
//                These are active for the life of each call to
37
//                annRangeSearch().  They are set to save the number of
38
//                variables that need to be passed among the various search
39
//                procedures.
40
//----------------------------------------------------------------------
41

    
42
extern ANNpoint                        ANNkdFRQ;                        // query point (static copy)
43

    
44
#endif