CachedSearchTree Class Reference

The search tree structure. More...

#include <searchTree.h>

Inheritance diagram for CachedSearchTree:

Public Member Functions
	CachedSearchTree ()
	CachedSearchTree (double **pts, int n, CachedSearchTree *_parent=0)
double *	FindClosest (double *_p, double maxdist2, int threadNum=0) const
virtual SearchTreeCacheItem *	FindClosestCache (double *_p, double maxdist2, int threadNum=0)=0
virtual SearchTreeCacheItem *	FindClosestCacheInit (double *_p, double maxdist2, int threadNum=0)=0
virtual	~CachedSearchTree ()
Public Member Functions inherited from SearchTree
virtual void	getPtPairs (vector< PtPair > *pairs, double *source_alignxf, double *const *q_points, unsigned int startindex, unsigned int endindex, int thread_num, int rnd, double max_dist_match2, double &sum, double *centroid_m, double *centroid_d)
virtual void	getPtPairs (vector< PtPair > *pairs, double *source_alignxf, const DataXYZ &xyz_r, unsigned int startindex, unsigned int endindex, int thread_num, int rnd, double max_dist_match2, double &sum, double *centroid_m, double *centroid_d)
virtual void	lock ()
	SearchTree ()
	SearchTree (double **pts, int n)
virtual void	unlock ()
virtual	~SearchTree ()
Public Member Functions inherited from Tree
virtual	~Tree ()

Detailed Description

The search tree structure.

A search tree holds the pointer to the data. Furthermore, search functionality must be privided

Definition at line 105 of file searchTree.h.

Constructor & Destructor Documentation

CachedSearchTree() [1/2]

CachedSearchTree::CachedSearchTree ( )

inline

Constructor (default)

Definition at line 110 of file searchTree.h.

CachedSearchTree() [2/2]

CachedSearchTree::CachedSearchTree	(	double **	pts,
		int	n,
		CachedSearchTree *	_parent = 0
	)

Constructor - Constructs a tree from the input. pure virtual, i.e., must be implented by a derived class

Parameters

pts	3D array of points
n	number of points

~CachedSearchTree()

virtual CachedSearchTree::~CachedSearchTree ( )

inlinevirtual

Destructor - deletes the tree pure virtual, i.e., must be implented by a derived class

Definition at line 124 of file searchTree.h.

Member Function Documentation

FindClosest()

double* CachedSearchTree::FindClosest ( double *  _p, double  maxdist2, int  threadNum = 0  ) const

inlinevirtual

This Search function returns a pointer to the closest point of the query point within maxdist2. If there if no such point a 0-pointer might be returned.

Parameters

_p	Pointer to query point
maxdist2	Maximal distance for closest points
threadNum	If parallel threads share the search tree the thread num must be given

Returns

Pointer to closest point

Implements SearchTree.

Definition at line 149 of file searchTree.h.

FindClosestCache()

virtual SearchTreeCacheItem* CachedSearchTree::FindClosestCache ( double *  _p, double  maxdist2, int  threadNum = 0  )

pure virtual

This Search function returns a pointer to the closest point of the query point within maxdist2. This function might be started from the leafs.

Parameters

_p	Pointer to query point
maxdist2	Maximal distance for closest points
threadNum	If parallel threads share the search tree the thread num must be given

Returns

A new cach Item

FindClosestCacheInit()

virtual SearchTreeCacheItem* CachedSearchTree::FindClosestCacheInit ( double *  _p, double  maxdist2, int  threadNum = 0  )

pure virtual

This Search function returns a pointer to the closest point of the query point within maxdist2. This function searches from the root to the leafs.

Parameters

_p	Pointer to query point
maxdist2	Maximal distance for closest points
threadNum	If parallel threads share the search tree the thread num must be given

Returns

A new cach Item

---

The documentation for this class was generated from the following file:

• searchTree.h