Interface for tree traversals. More...

#include <UT_KDTree.h>

Inheritance diagram for UT_KDTree::Visitor:

Public Member Functions
virtual	~Visitor ()

virtual void	setNumNodes (int num_nodes)

virtual void	visitLeaf (int nodeid, const int *point_list, int size, const UT_BoundingBox &box)=0

virtual void	postVisitInternal (int nodeid, int leftid, int rightid, const UT_BoundingBox &box, int axis, float split)

Detailed Description

Interface for tree traversals.

Definition at line 663 of file UT_KDTree.h.

Constructor & Destructor Documentation

virtual UT_KDTree::Visitor::~Visitor ( )

inlinevirtual

Definition at line 665 of file UT_KDTree.h.

Member Function Documentation

virtual void UT_KDTree::Visitor::postVisitInternal	(	int	nodeid,
		int	leftid,
		int	rightid,
		const UT_BoundingBox &	box,
		int	axis,
		float	split
	)

inlinevirtual

Post-traverses an internal node (left and right are guaranteed to have been traversed before this method is called)

Definition at line 684 of file UT_KDTree.h.

virtual void UT_KDTree::Visitor::setNumNodes ( int num_nodes )

inlinevirtual

Before traversal, this method is called to indicate the total number of nodes (internal + leaf) that will be traversed. nodeid passed to the visit functions will take on values in the range [0, num_nodes-1].

Definition at line 671 of file UT_KDTree.h.

virtual void UT_KDTree::Visitor::visitLeaf	(	int	nodeid,
		const int *	point_list,
		int	size,
		const UT_BoundingBox &	box
	)

pure virtual

Traverses a leaf node in the tree. Leaf nodes contain a list of points (specified by point_list and size) that is disjoint from other leaf nodes.

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

UT/UT_KDTree.h

Public Member Functions

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation