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
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
|
// K-3D
// Copyright (c) 2005-2008 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 Romain Behar (romainbehar@yahoo.com)
\author Bart Janssens (bart.janssens@lid.kviv.be)
\author Evan Lezar (evanlezar@gmail.com)
*/
#include <k3dsdk/table_copier.h>
#include <k3dsdk/basic_math.h>
#include <k3dsdk/document_plugin_factory.h>
#include <k3dsdk/imaterial.h>
#include <k3dsdk/ipipeline_profiler.h>
#include <k3dsdk/measurement.h>
#include <k3dsdk/mesh_modifier.h>
#include <k3dsdk/mesh_selection_sink.h>
#include <k3dsdk/node.h>
#include <k3dsdk/polyhedron.h>
#include <k3dsdk/selection.h>
#include <k3dsdk/utility.h>
#include <k3dsdk/vectors.h>
#include <k3d-platform-config.h>
#include "cuda_device_mesh.h"
#include "cuda_mesh_topology_data.h"
#include <boost/scoped_ptr.hpp>
namespace module
{
namespace cuda
{
namespace detail
{
typedef std::vector<k3d::uint32_t> indices_t;
/// Copies and interpolates the varying data as needed (serial usage only)
class varying_data_copier
{
public:
varying_data_copier(const k3d::mesh::points_t Points,
const k3d::mesh::indices_t& EdgePoints,
const k3d::mesh::indices_t& ClockwiseEdges,
const indices_t& Companions,
const k3d::mesh::bools_t& BoundaryEdges,
const k3d::mesh::bools_t& HasMidpoint,
const k3d::uint_t SplitPointCount,
k3d::table_copier& Copier) :
m_points(Points),
m_edge_points(EdgePoints),
m_clockwise_edges(ClockwiseEdges),
m_companions(Companions),
m_boundary_edges(BoundaryEdges),
m_has_midpoint(HasMidpoint),
m_split_point_count(SplitPointCount),
m_copier(Copier)
{}
void operator()(const k3d::uint_t Edge)
{
m_copier.push_back(Edge);
if(m_has_midpoint[Edge] || (!m_boundary_edges[Edge] && m_has_midpoint[m_companions[Edge]]))
{
const k3d::uint_t clockwise = m_clockwise_edges[Edge];
const k3d::uint_t indices[] = {Edge, clockwise};
const k3d::point3& start_point = m_points[m_edge_points[Edge]];
const k3d::point3& end_point = m_points[m_edge_points[Edge]];
const k3d::double_t weight_step = 1.0 / static_cast<double>(m_split_point_count + 1);
for(k3d::uint_t i = 1; i <= m_split_point_count; ++i)
{
const k3d::double_t last_weight = weight_step * static_cast<k3d::double_t>(i);
const k3d::double_t weights[] = {1 - last_weight, last_weight};
m_copier.push_back(2, indices, weights);
}
}
}
private:
const k3d::mesh::points_t m_points;
const k3d::mesh::indices_t& m_edge_points;
const k3d::mesh::indices_t& m_clockwise_edges;
const indices_t& m_companions;
const k3d::mesh::bools_t& m_boundary_edges;
const k3d::mesh::bools_t& m_has_midpoint;
const k3d::uint_t m_split_point_count;
k3d::table_copier& m_copier;
};
} // namespace detail
/////////////////////////////////////////////////////////////////////////////
// cuda_mesh_subdivide_edges
class cuda_mesh_subdivide_edges :
public k3d::mesh_selection_sink<k3d::mesh_modifier<k3d::node > >
{
typedef k3d::mesh_selection_sink<k3d::mesh_modifier<k3d::node > > base;
public:
cuda_mesh_subdivide_edges(k3d::iplugin_factory& Factory, k3d::idocument& Document) :
base(Factory, Document),
m_vertices(init_owner(*this) + init_name("vertices") + init_label(_("Vertices")) + init_description(_("Number of vertices to insert in each selected edge")) + init_value(1L) + init_step_increment(1) + init_units(typeid(k3d::measurement::scalar)) + init_constraint(constraint::minimum<k3d::int32_t>(1))),
m_p_output_device_mesh(),
m_p_input_device_mesh(),
m_pdev_first_midpoint(0),
m_pdev_has_midpoint(0),
m_pdev_companions(0),
m_pdev_boundary_edges(0),
m_pdev_edge_faces(0),
m_pdev_input_edge_selection(0)
{
m_vertices.changed_signal().connect(make_reset_mesh_slot());
m_mesh_selection.changed_signal().connect(make_reset_mesh_slot());
}
~cuda_mesh_subdivide_edges()
{
if ( m_pdev_first_midpoint )
{
free_device_memory ( (void*) m_pdev_first_midpoint );
free_device_memory((void*) m_pdev_has_midpoint);
free_device_memory((void*) m_pdev_companions);
free_device_memory((void*) m_pdev_boundary_edges);
free_device_memory((void*) m_pdev_edge_faces);
free_device_memory((void*) m_pdev_input_edge_selection);
}
}
void on_create_mesh(const k3d::mesh& Input, k3d::mesh& Output)
{
if ( m_pdev_first_midpoint )
{
free_device_memory ( (void*) m_pdev_first_midpoint );
free_device_memory((void*) m_pdev_has_midpoint);
free_device_memory((void*) m_pdev_companions);
free_device_memory((void*) m_pdev_boundary_edges);
free_device_memory((void*) m_pdev_edge_faces);
free_device_memory((void*) m_pdev_input_edge_selection);
synchronize_threads();
}
// If there are no valid polyhedra, we give up
document().pipeline_profiler().start_execution(*this, "Create:Validate input");
boost::scoped_ptr<k3d::polyhedron::const_primitive> polyhedron(k3d::polyhedron::validate(Input));
if(!polyhedron)
{
document().pipeline_profiler().finish_execution(*this, "Create:Validate input");
return;
}
// should move up
m_p_input_device_mesh.reset ( new cuda_device_mesh ( Input) );
m_p_input_device_mesh->copy_to_device( ); // TODO: Selectively copy parts of mesh
document().pipeline_profiler().finish_execution(*this, "Create:Validate input");
// Shallow copy of the input (no data is copied, only shared pointers are)
document().pipeline_profiler().start_execution(*this, "Merge selection");
Output = Input;
k3d::geometry::selection::merge(m_mesh_selection.pipeline_value(), Output); // Merges the current document selection with the mesh
document().pipeline_profiler().finish_execution(*this, "Merge selection");
k3d::mesh::polyhedra_t& polyhedra = Output.polyhedra.writable();
document().pipeline_profiler().start_execution(*this, "Calculate companions");
const k3d::uint_t split_point_count = m_vertices.pipeline_value();
const k3d::uint_t old_edge_count = Input.polyhedra->edge_points->size();
allocate_device_memory((void**)&m_pdev_companions, old_edge_count*sizeof(k3d::uint32_t));
allocate_device_memory((void**)&m_pdev_boundary_edges, old_edge_count*sizeof(unsigned char));
k3d::cuda_create_edge_adjacency_lookup(m_p_input_device_mesh->get_polyhedra_edge_point_indices_pointer(), m_p_input_device_mesh->get_device_polyhedra().get_per_edge_clockwise_edges_pointer(), m_pdev_boundary_edges, m_pdev_companions, old_edge_count, Input.points->size());
document().pipeline_profiler().finish_execution(*this, "Calculate companions");
document().pipeline_profiler().start_execution(*this, "Calculate indices");
k3d::uint32_t* pdev_index_map;
// allocate the device memory
allocate_device_memory((void**)&pdev_index_map, old_edge_count*sizeof(k3d::uint32_t));
allocate_device_memory((void**)&m_pdev_edge_faces, old_edge_count*sizeof(k3d::uint32_t));
allocate_device_memory((void**)&m_pdev_first_midpoint, old_edge_count*sizeof(k3d::uint32_t));
allocate_device_memory((void**)&m_pdev_has_midpoint, old_edge_count*sizeof(unsigned char));
allocate_device_memory((void**)&m_pdev_input_edge_selection, old_edge_count*sizeof(float));
set_device_memory((void*)m_pdev_has_midpoint, 0, old_edge_count*sizeof(unsigned char));
m_p_output_device_mesh.reset( new cuda_device_mesh ( Output ) );
m_p_output_device_mesh->copy_to_device(POLYHEDRA_ALL_EDGES+MESH_POINTS+MESH_SELECTION+POLYHEDRA_ALL_LOOPS);
k3d::uint32_t new_edge_count;
k3d::uint32_t new_point_count;
edge_index_calculator_entry (
(unsigned int*) m_pdev_first_midpoint,
m_pdev_has_midpoint,
pdev_index_map,
m_pdev_edge_faces,
(const unsigned int*)m_p_input_device_mesh->get_device_polyhedra().get_per_face_first_loops_pointer(),
(const unsigned int*)m_p_input_device_mesh->get_device_polyhedra().get_per_face_loop_counts_pointer(),
(const unsigned int*)m_p_input_device_mesh->get_device_polyhedra().get_per_loop_first_edges_pointer(),
(const unsigned int*)m_p_input_device_mesh->get_device_polyhedra().get_per_edge_clockwise_edges_pointer(),
m_p_output_device_mesh->get_device_polyhedra().get_per_edge_selection_pointer(),
(const unsigned int*) m_pdev_companions,
(const unsigned char*) m_pdev_boundary_edges,
split_point_count,
Input.polyhedra->face_first_loops->size(),
Input.points->size(),
&new_point_count,
&new_edge_count
);
document().pipeline_profiler().finish_execution(*this, "Calculate indices");
document().pipeline_profiler().start_execution(*this, "Allocate memory");
// Store a copy of the original selection
copy_from_device_to_device(m_pdev_input_edge_selection, m_p_output_device_mesh->get_device_polyhedra().get_per_edge_selection_pointer(), old_edge_count * sizeof(float));
m_p_output_device_mesh->get_device_polyhedra().resize_edges(new_edge_count, true);
document().pipeline_profiler().finish_execution(*this, "Allocate memory");
document().pipeline_profiler().start_execution(*this, "Update indices");
m_p_output_device_mesh->resize_points_and_selection ( new_point_count + Input.points->size(), 1.0 );
subdivide_edges_update_indices_entry ((unsigned int*)m_p_input_device_mesh->get_polyhedra_edge_point_indices_pointer(),
(unsigned int*)m_p_input_device_mesh->get_polyhedra_clockwise_edge_point_indices_pointer(),
(unsigned int) Input.polyhedra->edge_points->size(),
(unsigned int*)(m_p_output_device_mesh->get_polyhedra_edge_point_indices_pointer()),
(unsigned int*)(m_p_output_device_mesh->get_polyhedra_clockwise_edge_point_indices_pointer()),
pdev_index_map,
old_edge_count);// index_map.size = old_edge_count
subdivide_edges_update_loop_first_edges_entry ((unsigned int*)m_p_output_device_mesh->get_polyhedra_loop_first_edges_pointer(),
(unsigned int)Input.polyhedra->loop_first_edges->size(),
pdev_index_map,
old_edge_count);// index_map.size = old_edge_count
document().pipeline_profiler().finish_execution(*this, "Update indices");
document().pipeline_profiler().start_execution(*this, "Split edges");
subdivide_edges_split_edges_entry ((unsigned int*)(m_p_output_device_mesh->get_polyhedra_edge_point_indices_pointer()),
(unsigned int*)(m_p_output_device_mesh->get_polyhedra_clockwise_edge_point_indices_pointer()),
(unsigned int*)m_p_input_device_mesh->get_polyhedra_clockwise_edge_point_indices_pointer(),
m_pdev_input_edge_selection,
pdev_index_map,
m_pdev_first_midpoint,
m_pdev_has_midpoint,
(unsigned int)m_vertices.pipeline_value(),
m_pdev_companions,
m_pdev_boundary_edges,
Input.polyhedra->edge_points->size(),
m_pdev_edge_faces
);
synchronize_threads();
polyhedra.clockwise_edges.reset();
polyhedra.edge_points.reset();
polyhedra.edge_selection.reset();
polyhedra.loop_first_edges.reset();
m_p_output_device_mesh->copy_from_device( Output, POLYHEDRA_ALL_EDGES + POLYHEDRA_ALL_LOOPS);
free_device_memory ( pdev_index_map );
document().pipeline_profiler().finish_execution(*this, "Split edges");
polyhedra.constant_data = Input.polyhedra->constant_data;
polyhedra.uniform_data = Input.polyhedra->uniform_data;
}
void on_update_mesh(const k3d::mesh& Input, k3d::mesh& Output)
{
document().pipeline_profiler().start_execution(*this, "Update:Validate input");
boost::scoped_ptr<k3d::polyhedron::const_primitive> polyhedron(k3d::polyhedron::validate(Input));
if(!polyhedron)
{
document().pipeline_profiler().finish_execution(*this, "Update:Validate input");
return;
}
document().pipeline_profiler().finish_execution(*this, "Update:Validate input");
document().pipeline_profiler().start_execution(*this, "Calculate positions");
subdivide_edges_split_point_calculator ( m_pdev_first_midpoint,
m_pdev_has_midpoint,
m_p_output_device_mesh->get_points_and_selection_pointer(),
(unsigned int)Input.points->size(),
m_p_input_device_mesh->get_device_polyhedra().get_per_edge_points_pointer(),
m_p_input_device_mesh->get_device_polyhedra().get_per_edge_clockwise_edges_pointer(),
m_pdev_input_edge_selection,
m_pdev_companions,
m_pdev_boundary_edges,
m_pdev_edge_faces,
(unsigned int)m_vertices.pipeline_value(),
Input.polyhedra->edge_points->size());
document().pipeline_profiler().finish_execution(*this, "Calculate positions");
document().pipeline_profiler().start_execution(*this, "Update:Copy");
Output.points.reset();
Output.point_selection.reset();
m_p_output_device_mesh->copy_from_device ( Output, MESH_POINTS + MESH_SELECTION );
document().pipeline_profiler().finish_execution(*this, "Update:Copy");
}
static k3d::iplugin_factory& get_factory()
{
static k3d::document_plugin_factory<cuda_mesh_subdivide_edges,
k3d::interface_list<k3d::imesh_source,
k3d::interface_list<k3d::imesh_sink > > > factory(
k3d::uuid(0x7cf6b6b8, 0x154c3103, 0x2db817b2, 0x1319509a),
"CUDASubdivideEdges",
"Subdivides edges by creating one or more vertices along selected edges using CUDA API",
"CUDAMesh",
k3d::iplugin_factory::EXPERIMENTAL);
return factory;
}
private:
k3d_data(k3d::int32_t, immutable_name, change_signal, with_undo, local_storage, with_constraint, measurement_property, with_serialization) m_vertices;
// Cache the midpoints, for fast updating
//detail::indices_t m_edge_list;
k3d::uint32_t* m_pdev_first_midpoint;
unsigned char* m_pdev_has_midpoint;
k3d::uint32_t* m_pdev_companions;
unsigned char* m_pdev_boundary_edges;
k3d::uint32_t* m_pdev_edge_faces; // For each edge, store the face it belongs to. Filled by edge_index_calculator_entry.
float* m_pdev_input_edge_selection;
boost::shared_ptr<cuda_device_mesh> m_p_output_device_mesh;
boost::shared_ptr<cuda_device_mesh> m_p_input_device_mesh;
};
/////////////////////////////////////////////////////////////////////////////
// cuda_mesh_subdivide_edges_factory
k3d::iplugin_factory& cuda_mesh_subdivide_edges_factory()
{
return cuda_mesh_subdivide_edges::get_factory();
}
} // namespace cuda
} // namespace module
|
