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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
|
// K-3D
// Copyright (c) 1995-2004, Timothy M. Shead
//
// Contact: tshead@k-3d.com
//
// 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.
//
// 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
/** \file
\author Timothy M. Shead (tshead@k-3d.com)
\author Bart Janssens (bart.janssens@polytechnic.be)
*/
#include <k3dsdk/imaterial.h>
#include <k3dsdk/object.h>
#include <k3dsdk/persistence.h>
#include <k3dsdk/material.h>
#include <k3dsdk/material_collection.h>
#include <k3dsdk/measurement.h>
#include <k3dsdk/mesh_source.h>
#include <k3dsdk/module.h>
#include <k3dsdk/plugins.h>
#include <k3dsdk/transform.h>
#include <iterator>
namespace libk3dmesh
{
/////////////////////////////////////////////////////////////////////////////
// poly_cube_implementation
class poly_cube_implementation :
public k3d::material_collection<k3d::mesh_source<k3d::persistent<k3d::object> > >
{
typedef k3d::material_collection<k3d::mesh_source<k3d::persistent<k3d::object> > > base;
public:
poly_cube_implementation(k3d::idocument& Document) :
base(Document),
m_columns(k3d::init_name("columns") + k3d::init_description("Columns [integer]") + k3d::init_value(1) + k3d::init_document(Document) + k3d::init_constraint(k3d::constraint::minimum(1UL)) + k3d::init_precision(0) + k3d::init_step_increment(1) + k3d::init_units(typeid(k3d::measurement::scalar))),
m_rows(k3d::init_name("rows") + k3d::init_description("Rows [integer]") + k3d::init_value(1) + k3d::init_document(Document) + k3d::init_constraint(k3d::constraint::minimum(1UL)) + k3d::init_precision(0) + k3d::init_step_increment(1) + k3d::init_units(typeid(k3d::measurement::scalar))),
m_slices(k3d::init_name("slices") + k3d::init_description("Slices [integer]") + k3d::init_value(1) + k3d::init_document(Document) + k3d::init_constraint(k3d::constraint::minimum(1UL)) + k3d::init_precision(0) + k3d::init_step_increment(1) + k3d::init_units(typeid(k3d::measurement::scalar))),
m_width(k3d::init_name("width") + k3d::init_description("Width [number]") + k3d::init_document(Document) + k3d::init_value(5.0) + k3d::init_precision(2) + k3d::init_step_increment(0.1) + k3d::init_units(typeid(k3d::measurement::distance))),
m_height(k3d::init_name("height") + k3d::init_description("Height [number]") + k3d::init_document(Document) + k3d::init_value(5.0) + k3d::init_precision(2) + k3d::init_step_increment(0.1) + k3d::init_units(typeid(k3d::measurement::distance))),
m_depth(k3d::init_name("depth") + k3d::init_description("Depth [number]") + k3d::init_document(Document) + k3d::init_value(5.0) + k3d::init_precision(2) + k3d::init_step_increment(0.1) + k3d::init_units(typeid(k3d::measurement::distance)))
{
enable_serialization(k3d::persistence::proxy(m_rows));
enable_serialization(k3d::persistence::proxy(m_columns));
enable_serialization(k3d::persistence::proxy(m_slices));
enable_serialization(k3d::persistence::proxy(m_width));
enable_serialization(k3d::persistence::proxy(m_height));
enable_serialization(k3d::persistence::proxy(m_depth));
register_property(m_columns);
register_property(m_rows);
register_property(m_slices);
register_property(m_width);
register_property(m_height);
register_property(m_depth);
m_material.changed_signal().connect(SigC::slot(*this, &poly_cube_implementation::on_reset_geometry));
m_rows.changed_signal().connect(SigC::slot(*this, &poly_cube_implementation::on_reset_geometry));
m_columns.changed_signal().connect(SigC::slot(*this, &poly_cube_implementation::on_reset_geometry));
m_slices.changed_signal().connect(SigC::slot(*this, &poly_cube_implementation::on_reset_geometry));
m_width.changed_signal().connect(SigC::slot(*this, &poly_cube_implementation::on_reset_geometry));
m_height.changed_signal().connect(SigC::slot(*this, &poly_cube_implementation::on_reset_geometry));
m_depth.changed_signal().connect(SigC::slot(*this, &poly_cube_implementation::on_reset_geometry));
m_output_mesh.need_data_signal().connect(SigC::slot(*this, &poly_cube_implementation::on_create_geometry));
}
void on_reset_geometry()
{
m_output_mesh.reset();
}
k3d::mesh* on_create_geometry()
{
std::auto_ptr<k3d::mesh> mesh(new k3d::mesh());
mesh->polyhedra.push_back(new k3d::polyhedron());
k3d::polyhedron& polyhedron = *mesh->polyhedra.back();
polyhedron.material = m_material.interface();
const unsigned long rows = m_rows.property_value();
const unsigned long cols = m_columns.property_value();
const unsigned long slices = m_slices.property_value();
const double width = m_width.property_value();
const double height = m_height.property_value();
const double depth = m_depth.property_value();
// First plane
unsigned long point_rows = rows + 1;
unsigned long point_columns = cols + 1;
// Create points ...
boost::multi_array<k3d::point*, 2> points(boost::extents[point_rows][point_columns]);
for(unsigned long column = 0; column <= cols; ++column)
for(unsigned long row = 0; row <= rows; ++row)
{
double x = width * (static_cast<double>(column) / static_cast<double>(cols) - 0.5);
double y = height * (static_cast<double>(row) / static_cast<double>(rows) - 0.5);
double z = depth / 2;
points[row][column] = new k3d::point(x, y, z);
mesh->points.push_back(points[row][column]);
}
// Create edges ...
boost::multi_array<k3d::split_edge*, 3> edges(boost::extents[rows][cols][4]);
for(unsigned long row = 0; row != rows; ++row)
for(unsigned long column = 0; column != cols; ++column)
{
edges[row][column][0] = new k3d::split_edge(points[row][column]);
edges[row][column][1] = new k3d::split_edge(points[row][(column+1) % point_columns]);
edges[row][column][2] = new k3d::split_edge(points[(row+1) % point_rows][(column+1) % point_columns]);
edges[row][column][3] = new k3d::split_edge(points[(row+1) % point_rows][column]);
// Add face
k3d::face* const new_face = new k3d::face(edges[row][column][0]);
polyhedron.faces.push_back(new_face);
for(unsigned long i = 0; i < 4; ++i)
edges[row][column][i]->face_clockwise = edges[row][column][(i+1)%4];
for(unsigned long i = 0; i < 4; ++i)
polyhedron.edges.push_back(edges[row][column][i]);
}
// Join edges ...
const unsigned long edge_rows = rows - 1;
const unsigned long edge_columns = cols - 1;
for(unsigned long row = 0; row != edge_rows; ++row)
for(unsigned long column = 0; column != cols; ++column)
k3d::join_edges(*edges[row][column][2], *edges[(row+1) % rows][column][0]);
for(unsigned long column = 0; column != edge_columns; ++column)
for(unsigned long row = 0; row != rows; ++row)
k3d::join_edges(*edges[row][column][1], *edges[row][(column+1) % cols][3]);
std::vector<k3d::split_edge*> boundary_edges;
// Top row boundary edges
for(unsigned long column = 0; column != cols; ++column)
boundary_edges.push_back(edges[0][column][0]);
// Right row
for(unsigned long row = 0; row != rows; ++row)
boundary_edges.push_back(edges[row][cols-1][1]);
// Bottom row
for(unsigned long column = 0; column != cols; ++column)
boundary_edges.push_back(edges[rows-1][cols-column-1][2]);
// Left row
for(unsigned long row = 0; row != rows; ++row)
boundary_edges.push_back(edges[rows-row-1][0][3]);
for(unsigned long slice = 1; slice <= slices; ++slice)
{
std::vector<k3d::split_edge*> up_edges;
std::vector<k3d::split_edge*> down_edges;
std::vector<k3d::split_edge*> companion_edges;
std::vector<k3d::split_edge*> new_boundary_edges;
for(unsigned long i = 0; i < boundary_edges.size(); ++i)
{
k3d::vector3 offset(0, 0, -depth/slices);
k3d::point* new_point = new k3d::point(boundary_edges[i]->vertex->position + offset);
mesh->points.push_back(new_point);
// New boundary edge:
k3d::split_edge* new_edge = new k3d::split_edge(new_point);
polyhedron.edges.push_back(new_edge);
new_boundary_edges.push_back(new_edge);
// "down" edge:
k3d::split_edge* up_edge = new k3d::split_edge(boundary_edges[i]->vertex);
up_edges.push_back(up_edge);
polyhedron.edges.push_back(up_edge);
// "up" edge:
k3d::split_edge* down_edge = new k3d::split_edge(new_point);
down_edges.push_back(down_edge);
polyhedron.edges.push_back(down_edge);
// Join up- and down edges:
k3d::join_edges(*up_edge, *down_edge);
// New companion edge:
k3d::split_edge* companion_edge = new k3d::split_edge(boundary_edges[i]->vertex);
companion_edges.push_back(companion_edge);
polyhedron.edges.push_back(companion_edge);
// Add face:
k3d::face* const new_face = new k3d::face(companion_edge);
polyhedron.faces.push_back(new_face);
}
// Connect first face
companion_edges[0]->face_clockwise = up_edges[boundary_edges.size()-1];
up_edges[0]->face_clockwise = new_boundary_edges[0];
new_boundary_edges[boundary_edges.size()-1]->face_clockwise = down_edges[0];
down_edges[0]->face_clockwise = companion_edges[0];
k3d::join_edges(*companion_edges[0], *boundary_edges[boundary_edges.size()-1]);
for(unsigned long i = 1; i < boundary_edges.size(); ++i)
{
// Set the clockwise edges
companion_edges[i]->face_clockwise = up_edges[i-1];
up_edges[i]->face_clockwise = new_boundary_edges[i];
new_boundary_edges[i-1]->face_clockwise = down_edges[i];
down_edges[i]->face_clockwise = companion_edges[i];
// Join with the original edge
k3d::join_edges(*companion_edges[i], *boundary_edges[i-1]);
}
boundary_edges = new_boundary_edges;
}
// Last plane
// Create points ...
boost::multi_array<k3d::point*, 2> last_points(boost::extents[point_rows][point_columns]);
for(unsigned long column = 1; column <= cols-1; ++column)
for(unsigned long row = 1; row <= rows-1; ++row)
{
double x = width * (static_cast<double>(column) / static_cast<double>(cols) - 0.5);
double y = height * (static_cast<double>(row) / static_cast<double>(rows) - 0.5);
double z = - depth / 2;
last_points[row][column] = new k3d::point(x, y, z);
mesh->points.push_back(last_points[row][column]);
}
// Top row boundary points
//last_points[0][0] = boundary_edges[2*cols+2*rows-1]->vertex;
for(unsigned long column = 0; column != cols; ++column)
last_points[0][column] = boundary_edges[column]->vertex;
// Right row
for(unsigned long row = 0; row != rows; ++row)
last_points[row][cols] = boundary_edges[cols+row]->vertex;
// Bottom row
for(unsigned long column = 0; column != cols; ++column)
last_points[rows][cols-column] = boundary_edges[rows+cols+column]->vertex;
// Left row
for(unsigned long row = 0; row != rows; ++row)
last_points[rows-row][0] = boundary_edges[2*cols+rows+row]->vertex;
// Create edges ...
boost::multi_array<k3d::split_edge*, 3> last_edges(boost::extents[rows][cols][4]);
for(unsigned long row = 0; row != rows; ++row)
for(unsigned long column = 0; column != cols; ++column) {
last_edges[row][column][3] = new k3d::split_edge(last_points[row][column]);
last_edges[row][column][0] = new k3d::split_edge(last_points[row][(column+1) % point_columns]);
last_edges[row][column][1] = new k3d::split_edge(last_points[(row+1) % point_rows][(column+1) % point_columns]);
last_edges[row][column][2] = new k3d::split_edge(last_points[(row+1) % point_rows][column]);
for(unsigned long i = 0; i < 4; ++i)
polyhedron.edges.push_back(last_edges[row][column][i]);
for(unsigned long i = 0; i < 4; ++i)
last_edges[row][column][(i+1)%4]->face_clockwise = last_edges[row][column][i];
// Add face
k3d::face* const new_face = new k3d::face(last_edges[row][column][0]);
polyhedron.faces.push_back(new_face);
}
// Join edges ...
for(unsigned long row = 0; row != edge_rows; ++row)
for(unsigned long column = 0; column != cols; ++column)
k3d::join_edges(*last_edges[row][column][2], *last_edges[(row+1) % rows][column][0]);
for(unsigned long column = 0; column != edge_columns; ++column)
for(unsigned long row = 0; row != rows; ++row)
k3d::join_edges(*last_edges[row][column][1], *last_edges[row][(column+1) % cols][3]);
// Join the last boundary edges, obtained from the extrusion process, to the back plane
// Top row boundary edges
for(unsigned long column = 0; column != cols; ++column)
k3d::join_edges(*last_edges[0][column][0], *boundary_edges[column]);
// Right row
for(unsigned long row = 0; row != rows; ++row)
k3d::join_edges(*last_edges[row][cols-1][1], *boundary_edges[cols+row]);
// Bottom row
for(unsigned long column = 0; column != cols; ++column)
k3d::join_edges(*last_edges[rows-1][cols-column-1][2], *boundary_edges[rows+cols+column]);
// Left row
for(unsigned long row = 0; row != rows; ++row)
k3d::join_edges(*last_edges[rows-row-1][0][3], *boundary_edges[2*cols+rows+row]);
return_val_if_fail(is_valid(polyhedron), 0);
assert_warning(is_solid(polyhedron));
return mesh.release();
}
k3d::iplugin_factory& factory()
{
return get_factory();
}
static k3d::iplugin_factory& get_factory()
{
static k3d::plugin_factory<k3d::document_plugin<poly_cube_implementation>, k3d::interface_list<k3d::imesh_source > > factory(
k3d::uuid(0x7ec966d1, 0xd78a445c, 0x8806b8a3, 0x5593f241),
"PolyCube",
"Generates a polygonal cube",
"Objects",
k3d::iplugin_factory::STABLE);
return factory;
}
private:
k3d_measurement_property(unsigned long, k3d::immutable_name, k3d::change_signal, k3d::with_undo, k3d::local_storage, k3d::with_constraint) m_columns;
k3d_measurement_property(unsigned long, k3d::immutable_name, k3d::change_signal, k3d::with_undo, k3d::local_storage, k3d::with_constraint) m_rows;
k3d_measurement_property(unsigned long, k3d::immutable_name, k3d::change_signal, k3d::with_undo, k3d::local_storage, k3d::with_constraint) m_slices;
k3d_measurement_property(double, k3d::immutable_name, k3d::change_signal, k3d::with_undo, k3d::local_storage, k3d::no_constraint) m_width;
k3d_measurement_property(double, k3d::immutable_name, k3d::change_signal, k3d::with_undo, k3d::local_storage, k3d::no_constraint) m_height;
k3d_measurement_property(double, k3d::immutable_name, k3d::change_signal, k3d::with_undo, k3d::local_storage, k3d::no_constraint) m_depth;
};
/////////////////////////////////////////////////////////////////////////////
// poly_cube_factory
k3d::iplugin_factory& poly_cube_factory()
{
return poly_cube_implementation::get_factory();
}
} // namespace libk3dmesh
|
