-
Notifications
You must be signed in to change notification settings - Fork 0
/
octree.h
181 lines (139 loc) · 4.25 KB
/
octree.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
/*
* Copyright (C) 2007 Simon Perreault
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef OCTREE_H
#define OCTREE_H
#include "array2d.h"
#include "point3d.h"
#include <algorithm>
#include <cassert>
#include <istream>
#include <ostream>
template< typename T, int AS = 1 >
class Octree
{
public:
Octree( int size, const T& emptyValue = T(0) );
Octree( const Octree<T,AS>& o );
~Octree();
// Accessors
int size() const;
const T& emptyValue() const;
static unsigned long branchBytes();
static unsigned long aggregateBytes();
static unsigned long leafBytes();
unsigned long bytes() const;
int nodes() const;
int nodesAtSize( int size ) const;
// Mutators
void setEmptyValue( const T& emptyValue );
void swap( Octree<T,AS>& o );
Octree<T,AS>& operator= ( Octree<T,AS> o );
// Indexing operators
T& operator() ( int x, int y, int z );
const T& operator() ( int x, int y, int z ) const;
const T& at( int x, int y, int z ) const;
void set( int x, int y, int z, const T& value );
void erase( int x, int y, int z );
Array2D<T> zSlice( int z ) const;
// I/O functions
void writeBinary( std::ostream& out ) const;
void readBinary( std::istream& in );
protected:
// Octree node types
class Node;
class Branch;
class Aggregate;
class Leaf;
enum NodeType { BranchNode, AggregateNode, LeafNode };
Node*& root();
const Node* root() const;
static void deleteNode( Node** node );
private:
// Recursive helper functions
void eraseRecursive( Node** node, int size, int x, int y, int z );
static unsigned long bytesRecursive( const Node* node );
static int nodesRecursive( const Node* node );
static int nodesAtSizeRecursive( int targetSize, int size, Node* node );
void zSliceRecursive( Array2D<T> slice, const Node* node, int size,
int x, int y, int z, int targetZ ) const;
static void writeBinaryRecursive( std::ostream& out, const Node* node );
static void readBinaryRecursive( std::istream& in, Node** node );
protected:
// Node classes
class Node
{
public:
NodeType type() const;
protected:
Node( NodeType type );
~Node() {};
private:
NodeType type_ : 2;
};
class Branch : public Node
{
public:
Branch();
Branch( const Branch& b );
~Branch();
const Node* child( int x, int y, int z ) const;
Node*& child( int x, int y, int z );
const Node* child( int index ) const;
Node*& child( int index );
friend void Octree<T,AS>::deleteNode( Node** node );
private:
Branch& operator= ( Branch b );
private:
Node* children[2][2][2];
};
class Aggregate : public Node
{
public:
Aggregate( const T& v );
const T& value( int x, int y, int z ) const;
T& value( int x, int y, int z );
void setValue( int x, int y, int z, const T& v );
const T& value( int i ) const;
T& value( int i );
void setValue( int i, const T& v );
friend void Octree<T,AS>::deleteNode( Node** node );
private:
~Aggregate() {};
private:
T value_[AS][AS][AS];
};
class Leaf : public Node
{
public:
Leaf( const T& v );
const T& value() const;
T& value();
void setValue( const T& v );
friend void Octree<T,AS>::deleteNode( Node** node );
private:
~Leaf() {};
private:
T value_;
};
static const int aggregateSize_ = AS;
private:
Node* root_;
T emptyValue_;
int size_;
};
#include "octree.tcc"
#endif