| 1 |
//---------------------------------------------------------------------- |
| 2 |
// File: kd_pr_search.h |
| 3 |
// Programmer: Sunil Arya and David Mount |
| 4 |
// Description: Priority kd-tree search |
| 5 |
// Last modified: 01/04/05 (Version 1.0) |
| 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 0.1 03/04/98 |
| 22 |
// Initial release |
| 23 |
//---------------------------------------------------------------------- |
| 24 |
|
| 25 |
#ifndef ANN_kd_pr_search_H |
| 26 |
#define ANN_kd_pr_search_H |
| 27 |
|
| 28 |
#include "kd_tree.h" // kd-tree declarations |
| 29 |
#include "kd_util.h" // kd-tree utilities |
| 30 |
#include "pr_queue.h" // priority queue declarations |
| 31 |
#include "pr_queue_k.h" // k-element priority queue |
| 32 |
|
| 33 |
#include <ANN/ANNperf.h> // performance evaluation |
| 34 |
|
| 35 |
//---------------------------------------------------------------------- |
| 36 |
// Global variables |
| 37 |
// Active for the life of each call to Appx_Near_Neigh() or |
| 38 |
// Appx_k_Near_Neigh(). |
| 39 |
//---------------------------------------------------------------------- |
| 40 |
|
| 41 |
extern double ANNprEps; // the error bound |
| 42 |
extern int ANNprDim; // dimension of space |
| 43 |
extern ANNpoint ANNprQ; // query point |
| 44 |
extern double ANNprMaxErr; // max tolerable squared error |
| 45 |
extern ANNpointArray ANNprPts; // the points |
| 46 |
extern ANNpr_queue *ANNprBoxPQ; // priority queue for boxes |
| 47 |
extern ANNmin_k *ANNprPointMK; // set of k closest points |
| 48 |
|
| 49 |
#endif |