Spatial C++ Library Code

Library of generic, k-d tree multi-dimensional containers

Brought to you by: bouhdevel

Commit [e22679] sylvain/rtree_height Maximize Restore History

Height of the node is now working as designed. Some improvements are necessary for mapping_iterator and equal_iterator, but its ready to be tested against the weight approach

Authored by: Sylvain Bougerel 2015-02-08

Browse code at this revision

Parent: [4d2ba7]

changed	examples/CMakeLists.txt
changed	examples/performance/mapping_performance.cpp
changed	src/algorithm.hpp
changed	src/bits/spatial_equal.hpp
changed	src/bits/spatial_kdtree.hpp
changed	src/bits/spatial_relaxed_kdtree.hpp
changed	src/spatial.hpp
changed	tests/bits/spatial_test_relaxed_kdtree.hpp

Spatial C++ Library Code

Library of generic, k-d tree multi-dimensional containers

Branches

Tags

Commit [e22679] sylvain/rtree_height Maximize Restore History

examples/CMakeLists.txt Diff Switch to side-by-side view

examples/performance/mapping_performance.cpp Diff Switch to side-by-side view

src/algorithm.hpp Diff Switch to side-by-side view

src/bits/spatial_equal.hpp Diff Switch to side-by-side view

src/bits/spatial_kdtree.hpp Diff Switch to side-by-side view

src/bits/spatial_relaxed_kdtree.hpp Diff Switch to side-by-side view

src/spatial.hpp Diff Switch to side-by-side view

tests/bits/spatial_test_relaxed_kdtree.hpp Diff Switch to side-by-side view