CGAL users discussion list

[yanyajie <>]

Hi,

 

I have a specific point type, known as surfel. I would like to build a kd-tree for a bunch of surfels and to do range-query specified by a sphere queryitem. How can I extend the kd-tree to achieve my goal?

 

I examined the search() routine in kd_tree_node.h and found kd_tree heavily rely on the query item’s contains() member to do actual query. Does that mean all I have to do is just implement my own extended version of query item, like a sphere, so that it can determine whether or not a surfel is contained in? Or do I have to provide another distance class as exemplified in the example?

 

Really need some help here. Thanks in advance!!!

 

Yan.

 

-------------------------------------------------------------------------------------
* The State Key Labratory of Virtual Reality and Technology
* School of Computer Science and Engineering
* Beijing University Aeronautics and Astronautics (Beihang Univ.)
-------------------------------------------------------------------------------------