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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
/*
* OpenSCAD (www.openscad.org)
* Copyright (C) 2009-2011 Clifford Wolf <clifford@clifford.at> and
* Marius Kintel <marius@kintel.net>
*
* 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 2 of the License, or
* (at your option) any later version.
*
* As a special exception, you have permission to link this program
* with the CGAL library and distribute executables, as long as you
* follow the requirements of the GNU GPL in regard to all of the
* software in the executable aside from CGAL.
*
* 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "csgterm.h"
#include "polyset.h"
#include "linalg.h"
#include <sstream>
#include <boost/foreach.hpp>
/*!
\class CSGTerm
A CSGTerm is either a "primitive" or a CSG operation with two
children terms. A primitive in this context is any PolySet, which
may or may not have a subtree which is already evaluated (e.g. using
the render() module).
*/
/*!
\class CSGChain
A CSGChain is just a vector of primitives, each having a CSG type associated with it.
It's created by importing a CSGTerm tree.
*/
shared_ptr<CSGTerm> CSGTerm::createCSGTerm(type_e type, shared_ptr<CSGTerm> left, shared_ptr<CSGTerm> right)
{
if (type != TYPE_PRIMITIVE) {
// In case we're creating a CSG terms from a pruned tree, left/right can be NULL
if (!right) {
if (type == TYPE_UNION || type == TYPE_DIFFERENCE) return left;
else return right;
}
if (!left) {
if (type == TYPE_UNION) return right;
else return left;
}
}
// Pruning the tree. For details, see:
// http://www.cc.gatech.edu/~turk/my_papers/pxpl_csg.pdf
const BoundingBox &leftbox = left->getBoundingBox();
const BoundingBox &rightbox = right->getBoundingBox();
Vector3d newmin, newmax;
if (type == TYPE_INTERSECTION) {
#if EIGEN_WORLD_VERSION == 2
newmin = leftbox.min().cwise().max( rightbox.min() );
newmax = leftbox.max().cwise().min( rightbox.max() );
#else
newmin = leftbox.min().array().cwiseMax( rightbox.min().array() );
newmax = leftbox.max().array().cwiseMin( rightbox.max().array() );
#endif
BoundingBox newbox( newmin, newmax );
if (newbox.isNull()) {
return shared_ptr<CSGTerm>(); // Prune entire product
}
}
else if (type == TYPE_DIFFERENCE) {
#if EIGEN_WORLD_VERSION == 2
newmin = leftbox.min().cwise().max( rightbox.min() );
newmax = leftbox.max().cwise().min( rightbox.max() );
#else
newmin = leftbox.min().array().cwiseMax( rightbox.min().array() );
newmax = leftbox.max().array().cwiseMin( rightbox.max().array() );
#endif
BoundingBox newbox( newmin, newmax );
if (newbox.isNull()) {
return left; // Prune the negative component
}
}
return shared_ptr<CSGTerm>(new CSGTerm(type, left, right));
}
shared_ptr<CSGTerm> CSGTerm::createCSGTerm(type_e type, CSGTerm *left, CSGTerm *right)
{
return createCSGTerm(type, shared_ptr<CSGTerm>(left), shared_ptr<CSGTerm>(right));
}
CSGTerm::CSGTerm(const shared_ptr<PolySet> &polyset, const Transform3d &matrix, const Color4f &color, const std::string &label)
: type(TYPE_PRIMITIVE), polyset(polyset), label(label), flag(CSGTerm::FLAG_NONE), m(matrix), color(color)
{
initBoundingBox();
}
CSGTerm::CSGTerm(type_e type, shared_ptr<CSGTerm> left, shared_ptr<CSGTerm> right)
: type(type), left(left), right(right), flag(CSGTerm::FLAG_NONE), m(Transform3d::Identity())
{
initBoundingBox();
}
CSGTerm::CSGTerm(type_e type, CSGTerm *left, CSGTerm *right)
: type(type), left(left), right(right), flag(CSGTerm::FLAG_NONE), m(Transform3d::Identity())
{
initBoundingBox();
}
CSGTerm::~CSGTerm()
{
}
void CSGTerm::initBoundingBox()
{
if (this->type == TYPE_PRIMITIVE) {
this->bbox = this->m * this->polyset->getBoundingBox();
}
else {
const BoundingBox &leftbox = this->left->getBoundingBox();
const BoundingBox &rightbox = this->right->getBoundingBox();
Vector3d newmin, newmax;
switch (this->type) {
case TYPE_UNION:
#if EIGEN_WORLD_VERSION == 2
newmin = leftbox.min().cwise().min( rightbox.min() );
newmax = leftbox.max().cwise().max( rightbox.max() );
#else
newmin = leftbox.min().array().cwiseMin( rightbox.min().array() );
newmax = leftbox.max().array().cwiseMax( rightbox.max().array() );
#endif
this->bbox = this->m * BoundingBox( newmin, newmax );
break;
case TYPE_INTERSECTION:
#if EIGEN_WORLD_VERSION == 2
newmin = leftbox.min().cwise().max( rightbox.min() );
newmax = leftbox.max().cwise().min( rightbox.max() );
#else
newmin = leftbox.min().array().cwiseMax( rightbox.min().array() );
newmax = leftbox.max().array().cwiseMin( rightbox.max().array() );
#endif
this->bbox = this->m * BoundingBox( newmin, newmax );
break;
case TYPE_DIFFERENCE:
this->bbox = this->m * leftbox;
break;
case TYPE_PRIMITIVE:
break;
default:
assert(false);
}
}
}
std::string CSGTerm::dump()
{
std::stringstream dump;
if (type == TYPE_UNION)
dump << "(" << left->dump() << " + " << right->dump() << ")";
else if (type == TYPE_INTERSECTION)
dump << "(" << left->dump() << " * " << right->dump() << ")";
else if (type == TYPE_DIFFERENCE)
dump << "(" << left->dump() << " - " << right->dump() << ")";
else
dump << this->label;
return dump.str();
}
void CSGChain::import(shared_ptr<CSGTerm> term, CSGTerm::type_e type, CSGTerm::Flag flag)
{
CSGTerm::Flag newflag = (CSGTerm::Flag)(term->flag | flag);
if (term->type == CSGTerm::TYPE_PRIMITIVE) {
this->objects.push_back(CSGChainObject(term->polyset, term->m, term->color, type, term->label, newflag));
} else {
assert(term->left && term->right);
import(term->left, type, newflag);
import(term->right, term->type, newflag);
}
}
std::string CSGChain::dump(bool full)
{
std::stringstream dump;
BOOST_FOREACH(const CSGChainObject &obj, this->objects) {
if (obj.type == CSGTerm::TYPE_UNION) {
if (&obj != &this->objects.front()) dump << "\n";
dump << "+";
}
else if (obj.type == CSGTerm::TYPE_DIFFERENCE)
dump << " -";
else if (obj.type == CSGTerm::TYPE_INTERSECTION)
dump << " *";
dump << obj.label;
if (full) {
dump << " polyset: \n" << obj.polyset->dump() << "\n";
dump << " matrix: \n" << obj.matrix.matrix() << "\n";
dump << " color: \n" << obj.color << "\n";
}
}
dump << "\n";
return dump.str();
}
BoundingBox CSGChain::getBoundingBox() const
{
BoundingBox bbox;
BOOST_FOREACH(const CSGChainObject &obj, this->objects) {
if (obj.type != CSGTerm::TYPE_DIFFERENCE) {
BoundingBox psbox = obj.polyset->getBoundingBox();
if (!psbox.isNull()) {
bbox.extend(obj.matrix * psbox);
}
}
}
return bbox;
}
|
