SearchTree Class Reference

The search tree structure. More...

#include <searchTree.h>

Inheritance diagram for SearchTree:

Public Member Functions
virtual double *	FindClosest (double *_p, double maxdist2, int threadNum=0) const =0
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	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	lock ()
	SearchTree ()
	SearchTree (double **pts, int n)
virtual void	unlock ()
virtual	~SearchTree ()
Public Member Functions inherited from Tree
virtual	~Tree ()

Friends
class	Scan

Detailed Description

The search tree structure.

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

Definition at line 39 of file searchTree.h.

Constructor & Destructor Documentation

SearchTree() [1/2]

SearchTree::SearchTree ( )

inline

Constructor (default)

Definition at line 45 of file searchTree.h.

SearchTree() [2/2]

SearchTree::SearchTree	(	double **	pts,
		int	n
	)

Constructor - Constructs a tree from the input. must be implented by a derived class

Parameters

pts	3D array of points
n	number of points

~SearchTree()

virtual SearchTree::~SearchTree ( )

inlinevirtual

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

Definition at line 59 of file searchTree.h.

Member Function Documentation

FindClosest()

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

pure virtual

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

Implemented in BOctTree< T >, and CachedSearchTree.

getPtPairs() [1/2]

void SearchTree::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

Definition at line 82 of file searchTree.cc.

getPtPairs() [2/2]

void SearchTree::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

Definition at line 20 of file searchTree.cc.

lock()

virtual void SearchTree::lock ( )

inlinevirtual

Aquire a lock on this tree, signaling that its resources are in use. Neccessary for cached data in the scanserver.

Definition at line 64 of file searchTree.h.

unlock()

virtual void SearchTree::unlock ( )

inlinevirtual

Release the lock on this tree, signaling that its resources are aren't in use anymore. Neccessary for cached data in the scanserver.

Definition at line 69 of file searchTree.h.

Friends And Related Function Documentation

Scan

friend class Scan

friend

Definition at line 40 of file searchTree.h.

---

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

• searchTree.h
• searchTree.cc