Linear kd-tree library
Library source code, benchmarks, and benchmark results:
| Archive | Notes |
|
2010_05_07
|
interactions are now always reported only once
|
|
2009_08_18
|
last release before DEM conversion
|
|
2009_08_12
|
more i7 benchmarks, added malloc() statistics
|
|
2009_08_10
|
minor bugfix (debugging message removed)
|
|
2009_08_03
|
more customizable index types and additional documentation
|
|
2009_06_09
|
kd-tree-1 (array.h) and kd-tree-2 (pool.h), and additional benchmarks
|
|
2009_06_03
|
kd-tree-1 type only
|
Comparisons with other algorithms
Source code for benchmarks of other algorithms (quadratic sweep,
Sweep and Prune, Delaunay triangulation):
| Archive | Notes |
2009_06_03
|
needs CGAL compiled for Delaunay benchmark. Tested
with CGAL-3.3.1.
|