Commit Graph

11 Commits

Author SHA1 Message Date
m.overtheil 1e8ca0eb79 Added statistics 2014-12-15 08:55:15 +01:00
m.overtheil 967053e3c7 Added example for orthogonal search with a sphere
Fixed wrong splitter in benchmark
2014-12-12 15:33:45 +01:00
Andreas Fabri a0ccf4aa7a Add benchmark 2014-12-09 12:43:06 +01:00
m.overtheil bf7f340e61 Added loop to benchmark, slightly changed doc 2014-12-09 10:15:16 +01:00
m.overtheil 060c4f208f Removed some output in bench 2014-12-04 12:17:21 +01:00
m.overtheil af343d926e Added new traversal rule and dists vector to Orthogonal search
Functions min_dist_to_rectangle and max... have an overload with
std::vector<FT>& dists now. That is required for ortho searches, so
we have no backwards compatibility.
The values for extended internal nodes have also been changed.
2014-12-02 10:36:36 +01:00
m.overtheil cb4f9c3521 Divided Kd_tree_node into internal and leaf node
The Kd_tree_node now has two derived classes Kd_tree_internal_node
and Kd_tree_leaf_node. This commit is tested under Windows x64
2014-11-27 15:42:18 +01:00
m.overtheil afd47e07ee Started to divide Kd_tree_node in two types
NO WORKING CODE! Commit is just for my own synchronisation
2014-11-26 16:03:57 +01:00
m.overtheil 381fd858ea 2d 2014-11-18 08:43:24 +01:00
m.overtheil f001def817 added statistics 2014-10-24 12:25:48 +02:00
m.overtheil 9246366757 test for bug in kd-tree 2014-10-17 08:23:54 +02:00