e69e1edf817b67e7b4567ac508e88883ea7de52c
[chaz/yoink] / src / Moof / Octree.hh
1
2 /*******************************************************************************
3
4 Copyright (c) 2009, Charles McGarvey
5 All rights reserved.
6
7 Redistribution and use in source and binary forms, with or without
8 modification, are permitted provided that the following conditions are met:
9
10 * Redistributions of source code must retain the above copyright notice,
11 this list of conditions and the following disclaimer.
12 * Redistributions in binary form must reproduce the above copyright notice,
13 this list of conditions and the following disclaimer in the documentation
14 and/or other materials provided with the distribution.
15
16 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
20 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
22 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
23 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
24 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
25 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26
27 *******************************************************************************/
28
29 #ifndef _MOOF_OCTREE_HH_
30 #define _MOOF_OCTREE_HH_
31
32 #include <algorithm>
33 #include <list>
34
35 #include <boost/shared_ptr.hpp>
36
37 #include <stlplus/ntree.hpp>
38
39 #include <Moof/Aabb.hh>
40 #include <Moof/Drawable.hh>
41 #include <Moof/Entity.hh>
42 #include <Moof/Log.hh>
43 #include <Moof/Math.hh>
44 #include <Moof/Sphere.hh>
45
46
47 namespace Mf {
48
49
50 class Frustum;
51
52
53 struct OctreeNode;
54 typedef stlplus::ntree<OctreeNode>::iterator OctreeNodeP;
55
56 class Octree;
57 typedef boost::shared_ptr<Octree> OctreeP;
58
59
60 struct OctreeNode : public Entity
61 {
62 std::list<EntityP> objects;
63
64 OctreeNode()
65 {
66 aabb_.min = Vector3(-1.0, -1.0, -1.0);
67 aabb_.max = Vector3(1.0, 1.0, 1.0);
68 sphere_.init(Vector3(0.0, 0.0, 0.0), 1.41421);
69 }
70
71 OctreeNode(const Aabb& aabb)
72 {
73 aabb_ = aabb;
74 sphere_.point = aabb.getCenter();
75 sphere_.radius = (aabb.min - sphere_.point).length();
76 }
77
78 void draw(Scalar alpha) const
79 {
80 std::list<EntityP>::const_iterator it;
81
82 for (it = objects.begin(); it != objects.end(); ++it)
83 {
84 (*it)->draw(alpha);
85 }
86
87 if (!objects.empty())
88 aabb_.draw(); // temporary
89 }
90
91 void drawIfVisible(Scalar alpha, const Frustum& frustum) const
92 {
93 std::list<EntityP>::const_iterator it;
94
95 for (it = objects.begin(); it != objects.end(); ++it)
96 {
97 (*it)->drawIfVisible(alpha, frustum);
98 }
99
100 if (!objects.empty())
101 {
102 aabb_.draw();
103 sphere_.draw();
104 }
105 }
106
107
108 bool isVisible(const Frustum& frustum) const
109 {
110 if (sphere_.isVisible(frustum))
111 {
112 return aabb_.isVisible(frustum);
113 }
114
115 return false;
116 }
117
118
119 static bool compareZOrder(EntityP a, EntityP b)
120 {
121 return a->getSphere().point[2] < b->getSphere().point[2];
122 }
123
124 void sort()
125 {
126 //std::sort(objects.begin(), objects.end(), compareZOrder);
127 objects.sort(compareZOrder);
128 }
129 };
130
131
132 class Octree
133 {
134 OctreeNodeP insert(EntityP entity, OctreeNodeP node);
135
136 void addChild(OctreeNodeP node, int index);
137
138 void draw(Scalar alpha, OctreeNodeP node);
139 void drawIfVisible(Scalar alpha, const Frustum& frustum, OctreeNodeP node);
140
141 stlplus::ntree<OctreeNode> tree_;
142
143 public:
144
145 void print(OctreeNodeP node)
146 {
147 //logDebug("-----");
148 //logDebug("depth to node: %d", tree_.depth(node));
149 //logDebug("size of node: %d", tree_.size(node));
150 }
151
152 static OctreeP alloc(const OctreeNode& rootNode)
153 {
154 return OctreeP(new Octree(rootNode));
155 }
156
157 explicit Octree(const OctreeNode& rootNode)
158 {
159 tree_.insert(rootNode);
160 }
161
162 OctreeNodeP insert(EntityP entity)
163 {
164 return insert(entity, tree_.root());
165 }
166
167 OctreeNodeP reinsert(EntityP entity, OctreeNodeP node);
168
169 void drawIfVisible(Scalar alpha, const Frustum& frustum)
170 {
171 drawIfVisible(alpha, frustum, tree_.root());
172 }
173
174 void sort();
175 };
176
177
178 } // namespace Mf
179
180 #endif // _MOOF_OCTREE_HH_
181
182 /** vim: set ts=4 sw=4 tw=80: *************************************************/
183
This page took 0.037669 seconds and 3 git commands to generate.