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
|
// 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@lid.kviv.be>
*/
#include "subdiv_algorithms.h"
#include <k3dsdk/basic_math.h>
#include <k3dsdk/object.h>
#include <k3dsdk/persistence.h>
#include <k3dsdk/measurement.h>
#include <k3dsdk/mesh_filter.h>
#include <k3dsdk/module.h>
#include <k3dsdk/plugins.h>
#include <k3dsdk/utility.h>
#include <boost/multi_array.hpp>
#include <iomanip>
#include <iterator>
namespace libk3dmesh
{
/////////////////////////////////////////////////////////////////////////////
// split_faces_parallel_implementation
class split_faces_parallel_implementation :
public k3d::mesh_filter<k3d::persistent<k3d::object> >
{
typedef k3d::mesh_filter<k3d::persistent<k3d::object> > base;
public:
split_faces_parallel_implementation(k3d::idocument& Document) :
base(Document),
m_split_position(k3d::init_name("split_position") + k3d::init_description("Position of the split point [number]") + k3d::init_value(0.5) + k3d::init_constraint(k3d::constraint::minimum(0.0, k3d::constraint::maximum(1.0))) + k3d::init_precision(3) + k3d::init_step_increment(0.01) + k3d::init_units(typeid(k3d::measurement::scalar)) + k3d::init_document(Document))
{
register_property(m_split_position);
m_split_position.changed_signal().connect(SigC::slot(*this, &split_faces_parallel_implementation::on_reset_geometry));
m_input_mesh.changed_signal().connect(SigC::slot(*this, &split_faces_parallel_implementation::on_reset_geometry));
m_output_mesh.need_data_signal().connect(SigC::slot(*this, &split_faces_parallel_implementation::on_create_geometry));
}
void on_reset_geometry()
{
m_output_mesh.reset();
}
/// Returns true iff the given object is selected
struct is_selected
{
bool operator()(k3d::split_edge* const Edge)
{
return Edge->selected;
}
};
k3d::mesh* on_create_geometry()
{
// Get the input geometry ...
k3d::mesh* const input = m_input_mesh.property_value();
if(!input)
return 0;
// Create output geometry ...
k3d::mesh* const output = new k3d::mesh();
k3d::deep_copy(*input, *output);
// For each polyhedron ...
for(k3d::mesh::polyhedra_t::iterator polyhedron = output->polyhedra.begin(); polyhedron != output->polyhedra.end(); ++polyhedron)
{
const bool was_solid = k3d::is_solid(**polyhedron);
std::set<k3d::split_edge*> selected_edges;
k3d::copy_if((*polyhedron)->edges.begin(), (*polyhedron)->edges.end(), std::inserter(selected_edges, selected_edges.end()), is_selected());
if(selected_edges.empty())
selected_edges.insert((*polyhedron)->edges.begin(), (*polyhedron)->edges.end());
// keep track of edges that are added
const double f = m_split_position.property_value();
subdiv::splitter Splitter(**polyhedron, output->points);
while(!selected_edges.empty())
{
k3d::split_edge* const edge = *selected_edges.begin();
Splitter.split_face_along_edge(*edge, f, subdiv::get_centroid(*edge));
selected_edges.erase(edge);
}
assert_warning(is_valid(**polyhedron));
// If the polyhedron was solid when we started, it better be solid when we're done ...
if(was_solid)
assert_warning(is_solid(**polyhedron));
}
return output;
}
k3d::iplugin_factory& factory()
{
return get_factory();
}
static k3d::iplugin_factory& get_factory()
{
static k3d::plugin_factory<
k3d::document_plugin<split_faces_parallel_implementation>,
k3d::interface_list<k3d::imesh_source,
k3d::interface_list<k3d::imesh_sink > > > factory(
k3d::uuid(0x28081462, 0x2ffb4786, 0x8804c6c9, 0x1cc9c319),
"SplitFacesParallel",
"Splits both faces along selected edges by inserting a new edge at a given fraction of the face width",
"Objects",
k3d::iplugin_factory::EXPERIMENTAL);
return factory;
}
private:
k3d_measurement_property(double, k3d::immutable_name, k3d::change_signal, k3d::with_undo, k3d::local_storage, k3d::with_constraint) m_split_position;
};
/////////////////////////////////////////////////////////////////////////////
// split_faces_parallel_factory
k3d::iplugin_factory& split_faces_parallel_factory()
{
return split_faces_parallel_implementation::get_factory();
}
} // namespace libk3dmesh
|
