Sébastien Loriot
|
6b941e0c77
|
dependencies
|
2020-07-21 08:38:01 +02:00 |
Sébastien Loriot
|
4614c4fe4c
|
make package appear in overview
|
2020-07-21 08:32:49 +02:00 |
Sébastien Loriot
|
1c133be811
|
license headers
|
2020-07-21 08:32:32 +02:00 |
Jackson Campolattaro
|
8c85d3a3e1
|
Simplify printouts
|
2020-07-20 12:23:50 -04:00 |
Jackson Campolattaro
|
f27fba979e
|
Add timing data to kd_tree/octree comparison test
|
2020-07-20 12:12:28 -04:00 |
Jackson Campolattaro
|
b1a55ed20a
|
Add epsilon as optional argument
|
2020-07-19 23:22:06 -04:00 |
Jackson Campolattaro
|
3be77cd0d6
|
Remove underscore marking new nearest neighbor implementation
|
2020-07-19 23:14:46 -04:00 |
Jackson Campolattaro
|
908f6b8ea3
|
Add nearest_k_neighbours_in_radius, implement nearest_k_neighbours in terms of this function
|
2020-07-19 22:28:20 -04:00 |
Jackson Campolattaro
|
3330d8d7a5
|
Remove old nearest neighbour solution
|
2020-07-19 22:19:02 -04:00 |
Jackson Campolattaro
|
adbd84bf1c
|
Implement streamlined nearest neighbour as drop in replacement for old version
|
2020-07-19 22:18:10 -04:00 |
Jackson Campolattaro
|
29d93de185
|
Outline recursive case
|
2020-07-19 20:16:09 -04:00 |
Jackson Campolattaro
|
5385c84eb4
|
Implement base case of streamlined algorithm
|
2020-07-19 19:57:04 -04:00 |
Jackson Campolattaro
|
707b256386
|
Begin outlining streamlined nearest neighbour implementation
|
2020-07-19 17:04:37 -04:00 |
Jackson Campolattaro
|
15482a52d2
|
Add search benchmarking
|
2020-07-17 15:52:10 -04:00 |
Jackson Campolattaro
|
6c98ab9d52
|
Add number_of_points method to Node
|
2020-07-17 12:39:24 -04:00 |
Jackson Campolattaro
|
c353b6dee5
|
Add is_empty method to Node
|
2020-07-17 12:36:39 -04:00 |
Jackson Campolattaro
|
918bae51fa
|
Rename value accessors to points
|
2020-07-17 12:33:18 -04:00 |
Jackson Campolattaro
|
37dbc2ee20
|
Rename m_value to m_points
|
2020-07-17 12:30:52 -04:00 |
Jackson Campolattaro
|
8d12dc216a
|
Rename Node_range to Point_range
|
2020-07-17 12:29:59 -04:00 |
Jackson Campolattaro
|
48756ab9bb
|
Add Node_range typedef
|
2020-07-17 12:28:34 -04:00 |
Jackson Campolattaro
|
b2ea8c16e8
|
Rename node content type to Node_index
|
2020-07-17 12:27:10 -04:00 |
Jackson Campolattaro
|
de1973c75b
|
Nodes now expect to contain iterator ranges
|
2020-07-17 11:59:41 -04:00 |
Jackson Campolattaro
|
716e60bfab
|
Parametrize K for comparisons
|
2020-07-16 18:47:54 -04:00 |
Jackson Campolattaro
|
4f7b437d72
|
Simplify test printouts
|
2020-07-16 18:47:07 -04:00 |
Jackson Campolattaro
|
5e11120503
|
Remove sorting after using nearest_neighbour algorithm, confirmed to be redundant
|
2020-07-16 18:44:59 -04:00 |
Jackson Campolattaro
|
4c00bf0a92
|
Add inequality operators
|
2020-07-16 17:08:18 -04:00 |
Jackson Campolattaro
|
22792febcd
|
Add short introduction stub
|
2020-07-16 16:02:37 -04:00 |
Jackson Campolattaro
|
3fba6d9574
|
Define User Manual sections
|
2020-07-16 15:51:48 -04:00 |
Jackson Campolattaro
|
919da2662c
|
Simplify names of split criterion
|
2020-07-16 15:29:40 -04:00 |
Jackson Campolattaro
|
6aba4c443e
|
Add Split_criterion namespace
|
2020-07-16 15:28:21 -04:00 |
Jackson Campolattaro
|
243630902b
|
Add brief documentation to split criterion
|
2020-07-16 15:14:28 -04:00 |
Jackson Campolattaro
|
f444709e2e
|
Add assertions for added safety of node functions
|
2020-07-16 15:10:12 -04:00 |
Jackson Campolattaro
|
608f654be4
|
Pass k explicitly, simplifying the logic necessary to add a new point to the output list
|
2020-07-16 14:20:44 -04:00 |
Jackson Campolattaro
|
b494e0cca9
|
Test show an improvement in octree performance
|
2020-07-16 14:03:36 -04:00 |
Jackson Campolattaro
|
b5a26c9f91
|
Find mistake: only update search radius after K points are found
|
2020-07-16 13:58:04 -04:00 |
Jackson Campolattaro
|
ecbf15c274
|
Add more useful printout to the kd_tree comparison test
|
2020-07-16 13:33:08 -04:00 |
Jackson Campolattaro
|
77775f7592
|
Add node ranking for increased nearest neighbour performance, currently failing tests for k > 1
|
2020-07-16 13:22:55 -04:00 |
Jackson Campolattaro
|
5ccb6b1869
|
Add test comparing octree results to kd_tree results for a K value of 16
|
2020-07-16 11:10:14 -04:00 |
Jackson Campolattaro
|
ee6ed5555c
|
Add kd_tree construction
|
2020-07-16 10:57:37 -04:00 |
Jackson Campolattaro
|
6918a288be
|
Add Kd_tree typedefs
|
2020-07-16 10:54:19 -04:00 |
Jackson Campolattaro
|
71d56294d8
|
Octree equality operator is now const
|
2020-07-16 10:50:16 -04:00 |
Jackson Campolattaro
|
4a2bbff45a
|
Add param documentation to all public member functions
|
2020-07-16 10:49:27 -04:00 |
Jackson Campolattaro
|
f0c4b6016d
|
Add brief documentation for bbox and nearest_k_neighbours
|
2020-07-16 10:40:10 -04:00 |
Jackson Campolattaro
|
498ac2fd21
|
Octree now outperforms naive for over 1000 points
|
2020-07-15 21:49:24 -04:00 |
Jackson Campolattaro
|
e82016ee7c
|
Octree now outperforms naive for the largest dataset
|
2020-07-15 21:47:19 -04:00 |
Jackson Campolattaro
|
0005c08ec2
|
Add tests to catch the error just fixed
|
2020-07-15 21:45:57 -04:00 |
Jackson Campolattaro
|
c6e52a6f43
|
Fix error setting location when building a node
|
2020-07-15 21:40:55 -04:00 |
Jackson Campolattaro
|
11174762e2
|
Find presumed cause of error through testing of bbox
|
2020-07-15 21:36:52 -04:00 |
Jackson Campolattaro
|
9f4005252a
|
Fix indentation of octree pretty-print
|
2020-07-15 14:41:00 -04:00 |
Jackson Campolattaro
|
9eccefab9c
|
Prepare for child of child tests
|
2020-07-15 14:40:02 -04:00 |