CGAL users discussion list

[Johannes Otepka <>]

Thetis,

>  
> accoding to your method, i add a sentence "tree.build();" to codes,but 
> i found another question too:
> the building tree time is too long , it take 30s to build tree.
>  

I don't know - You have to find out by yourself or maybe someone else 
knows the answer.
I can only give you 2 hints:
* compile it in release mode (debug mode is especially slow in the tree 
building process)
* as already mentoined I have no experience with Cartesian_d Kernel. But 
if you only require 2d points, use the "normal" 
Cartesian<double>::Point_2 class. Maybe that's the problem...

Cheers,
  Johannes