简单的八叉树算法的C++实现

admin1

1. 以下是一个简单的八叉树算法的C++实现：
3. ```cpp
4. #include <iostream>
5. #include <vector>
6. using namespace std;
8. class Point {
9. public:
10.     float x, y, z;
11.     Point(float x, float y, float z) : x(x), y(y), z(z) {}
12. };
14. class Bounds {
15. public:
16.     float min采用x, max采用x, min采用y, max采用y, min采用z, max采用z;
17.     Bounds(float min采用x, float max采用x, float min采用y, float max采用y, float min采用z, float max采用z)
18.         : min采用x(min采用x), max采用x(max采用x), min采用y(min采用y), max采用y(max采用y), min采用z(min采用z), max采用z(max采用z) {}
20.     bool contains(const Point& point) const {
21.         return point.x >= min采用x && point.x <= max采用x && point.y >= min采用y && point.y <= max采用y && point.z >= min采用z && point.z <= max采用z;
22.     }
23. };
25. class OctreeNode {
26. public:
27.     vector<Point> data;
28.     Bounds bounds;
29.     int depth;
30.     OctreeNode* children[8];
32.     OctreeNode(const Bounds& bounds, int depth = 0) : bounds(bounds), depth(depth) {
33.         for (int i = 0; i < 8; i++) {
34.             children[i] = nullptr;
35.         }
36.     }
38.     void insert(const Point& point) {
39.         if (!bounds.contains(point)) {
40.             return;
41.         }
43.         if (children[0] == nullptr) {
44.             data.push采用back(point);
45.             if (data.size() > 8 && depth < 3) {
46.                 subdivide();
47.             }
48.             return;
49.         }
51.         for (int i = 0; i < 8; i++) {
52.             children[i]->insert(point);
53.         }
54.     }
56.     void subdivide() {
57.         float mid采用x = (bounds.min采用x + bounds.max采用x) / 2;
58.         float mid采用y = (bounds.min采用y + bounds.max采用y) / 2;
59.         float mid采用z = (bounds.min采用z + bounds.max采用z) / 2;
61.         children[0] = new OctreeNode(Bounds(bounds.min采用x, mid采用x, bounds.min采用y, mid采用y, bounds.min采用z, mid采用z), depth + 1);
62.         children[1] = new OctreeNode(Bounds(mid采用x, bounds.max采用x, bounds.min采用y, mid采用y, bounds.min采用z, mid采用z), depth + 1);
63.         children[2] = new OctreeNode(Bounds(bounds.min采用x, mid采用x, mid采用y, bounds.max采用y, bounds.min采用z, mid采用z), depth + 1);
64.         children[3] = new OctreeNode(Bounds(mid采用x, bounds.max采用x, mid采用y, bounds.max采用y, bounds.min采用z, mid采用z), depth + 1);
65.         children[4] = new OctreeNode(Bounds(bounds.min采用x, mid采用x, bounds.min采用y, mid采用y, mid采用z, bounds.max采用z), depth + 1);
66.         children[5] = new OctreeNode(Bounds(mid采用x, bounds.max采用x, bounds.min采用y, mid采用y, mid采用z, bounds.max采用z), depth + 1);
67.         children[6] = new OctreeNode(Bounds(bounds.min采用x, mid采用x, mid采用y, bounds.max采用y, mid采用z, bounds.max采用z), depth + 1);
68.         children[7] = new OctreeNode(Bounds(mid采用x, bounds.max采用x, mid采用y, bounds.max采用y, mid采用z, bounds.max采用z), depth + 1);
70.         for (const Point& point : data) {
71.             for (int i = 0; i < 8; i++) {
72.                 children[i]->insert(point);
73.             }
74.         }
76.         data.clear();
77.     }
78. };
79. ```

复制代码