ccolin/pfe
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

wow

Browse Source
This commit is contained in:
CookieKastanie 2022-02-28 23:46:29 +01:00
parent 73b432d0c8
commit 2425729a72
2 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/kd_tree.cc
View File

@ -1,5 +1,6 @@
#include "kd_tree.h" #include "kd_tree.h"
#include <algorithm> #include <algorithm>
#include <limits>
KdTree::Point::Point(): x{0}, y{0}, z{0} {} KdTree::Point::Point(): x{0}, y{0}, z{0} {}
KdTree::Point::Point(double x, double y, double z): x{x}, y{y}, z{z} {} KdTree::Point::Point(double x, double y, double z): x{x}, y{y}, z{z} {}
@ -40,7 +41,7 @@ void KdTree::fill(std::vector<Tuple> &points) {
KdTree::Node *KdTree::fillRec(std::size_t begin, std::size_t end, int axis) { KdTree::Node *KdTree::fillRec(std::size_t begin, std::size_t end, int axis) {
if(end <= begin) return nullptr; if(end <= begin) return nullptr;
size_t n = begin + (end - begin) / 2; std::size_t n = begin + (end - begin) / 2;
auto i = nodes.begin(); auto i = nodes.begin();
std::nth_element(i + begin, i + n, i + end, [&](Node &p1, Node &p2) { std::nth_element(i + begin, i + n, i + end, [&](Node &p1, Node &p2) {
return p1.position[axis] < p2.position[axis]; return p1.position[axis] < p2.position[axis];
@ -54,7 +55,7 @@ KdTree::Node *KdTree::fillRec(std::size_t begin, std::size_t end, int axis) {
} }
KdTree::Point KdTree::query(Point const &point) { KdTree::Point KdTree::query(Point const &point) {
bestDist = 99999.; bestDist = std::numeric_limits<double>::max();
bestNode = nullptr; bestNode = nullptr;
queryRec(root, point, 0); queryRec(root, point, 0);
return bestNode->position; return bestNode->position;