A KD-Tree template code. More...

#include "imesh_kd_tree.h"
#include <vcl_algorithm.h>
#include <vcl_limits.h>
#include <vcl_cassert.h>

Defines
#define	imesh_kd_tree_txx_
Functions
template<class F >
unsigned int	imesh_closest_index (const vgl_point_3d< double > &query, const vcl_auto_ptr< imesh_kd_tree_node > &kd_root, F dist, vcl_vector< imesh_kd_tree_queue_entry > *dists=0)
	returns the index of the closest leaf node.

Detailed Description

A KD-Tree template code.

    Modifications
     <none yet>

Definition in file imesh_kd_tree.txx.

Define Documentation

#define imesh_kd_tree_txx_

Definition at line 3 of file imesh_kd_tree.txx.

template<class F >

unsigned int imesh_closest_index	(	const vgl_point_3d< double > &	query,
		const vcl_auto_ptr< imesh_kd_tree_node > &	kd_root,
		F	dist,
		vcl_vector< imesh_kd_tree_queue_entry > *	dists = `0`
	)

returns the index of the closest leaf node.

The functor dist computes the distance between a point and leaf index

Parameters:

dists (if specified) returns a vector of all explored nodes and the closest square distance found so far

Definition at line 28 of file imesh_kd_tree.txx.