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
|
// 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 Romain Behar (romainbehar@yahoo.com)
*/
#include <k3dsdk/imaterial.h>
#include <k3dsdk/material.h>
#include <k3dsdk/material_collection.h>
#include <k3dsdk/measurement.h>
#include <k3dsdk/mesh_filter.h>
#include <k3dsdk/module.h>
#include <k3dsdk/object.h>
#include <k3dsdk/persistence.h>
#include <k3dsdk/plugins.h>
#include <k3dsdk/transform.h>
namespace libk3dmesh
{
/////////////////////////////////////////////////////////////////////////////
// polygonize_bicubic_patches_implementation
class polygonize_bicubic_patches_implementation :
public k3d::material_collection<k3d::mesh_filter<k3d::persistent<k3d::object> > >
{
typedef k3d::material_collection<k3d::mesh_filter<k3d::persistent<k3d::object> > > base;
public:
polygonize_bicubic_patches_implementation(k3d::idocument& Document) :
base(Document),
m_subdivisions(k3d::init_name("subdivisions") + k3d::init_description("Subdivision number [integer]") + k3d::init_document(Document) + k3d::init_value(3) + k3d::init_precision(0) + k3d::init_step_increment(1) + k3d::init_constraint(k3d::constraint::minimum(1UL)) + k3d::init_units(typeid(k3d::measurement::scalar)))
{
enable_serialization(k3d::persistence::proxy(m_subdivisions));
register_property(m_subdivisions);
m_input_mesh.changed_signal().connect(SigC::slot(*this, &polygonize_bicubic_patches_implementation::on_reset_geometry));
m_material.changed_signal().connect(SigC::slot(*this, &polygonize_bicubic_patches_implementation::on_reset_geometry));
m_subdivisions.changed_signal().connect(SigC::slot(*this, &polygonize_bicubic_patches_implementation::on_reset_geometry));
m_output_mesh.need_data_signal().connect(SigC::slot(*this, &polygonize_bicubic_patches_implementation::on_create_geometry));
}
void on_reset_geometry()
{
m_output_mesh.reset();
}
k3d::mesh* on_create_geometry()
{
// If we don't have any input mesh, we're done ...
const k3d::mesh* const input = m_input_mesh.property_value();
if(!input)
return 0;
// Otherwise, we polygonize input bicubic patches ...
k3d::mesh* const output = new k3d::mesh();
update_geometry(*input, *output);
return output;
}
void update_geometry(const k3d::mesh& Input, k3d::mesh& Output)
{
const unsigned long subdivisions = m_subdivisions.property_value();
// Polygonize each bicubic patch ...
for(k3d::mesh::bicubic_patches_t::const_iterator patch = Input.bicubic_patches.begin(); patch != Input.bicubic_patches.end(); patch++)
{
Output.polyhedra.push_back(new k3d::polyhedron());
k3d::polyhedron& polyhedron = *Output.polyhedra.back();
polyhedron.material = m_material.interface();
// Polygonize patch
std::vector<k3d::point*> points;
for(unsigned long j = 0; j <= subdivisions; j++)
{
const double u = static_cast<double>(j) / static_cast<double>(subdivisions);
for(unsigned long k = 0; k <= subdivisions; k++)
{
const double v = static_cast<double>(k) / static_cast<double>(subdivisions);
double U[4], V[4];
U[0] = (1-u)*(1-u)*(1-u);
U[1] = 3*u*(1-u)*(1-u);
U[2] = 3*u*u*(1-u);
U[3] = u*u*u;
V[0] = (1-v)*(1-v)*(1-v);
V[1] = 3*v*(1-v)*(1-v);
V[2] = 3*v*v*(1-v);
V[3] = v*v*v;
k3d::vector3 p(0, 0, 0);
for(unsigned long l = 0; l < 4; l++)
for(unsigned long m = 0; m < 4; m++)
{
const k3d::vector3 position = (*patch)->control_points[l*4+m]->position;
p += position * U[l] * V[m];
}
k3d::point* const newpoint = new k3d::point(p);
return_if_fail(newpoint);
points.push_back(newpoint);
Output.points.push_back(newpoint);
}
}
// Save quads
for(unsigned long j = 0; j < subdivisions; j++)
{
for(unsigned long k = 0; k < subdivisions; k++)
{
k3d::polyhedron::edges_t edges;
edges.push_back(new k3d::split_edge(points[j*(subdivisions+1)+k]));
edges.push_back(new k3d::split_edge(points[j*(subdivisions+1)+k+1]));
edges.push_back(new k3d::split_edge(points[(j+1)*(subdivisions+1)+k+1]));
edges.push_back(new k3d::split_edge(points[(j+1)*(subdivisions+1)+k]));
k3d::loop_edges(edges.begin(), edges.end());
//for(unsigned long j = 0; j < 4; ++j)
// edges[j]->face_clockwise = edges[(j+1) % blobby_polygons[i].size()];
polyhedron.edges.insert(polyhedron.edges.end(), edges.begin(), edges.end());
polyhedron.faces.push_back(new k3d::face(edges.front()));
}
}
assert_warning(is_valid(polyhedron));
}
}
k3d::iplugin_factory& factory()
{
return get_factory();
}
static k3d::iplugin_factory& get_factory()
{
static k3d::plugin_factory<
k3d::document_plugin<polygonize_bicubic_patches_implementation>,
k3d::interface_list<k3d::imesh_source,
k3d::interface_list<k3d::imesh_sink> > > factory(
k3d::uuid(0xbd6bdff8, 0xb4374eb1, 0xad39f4ad, 0x87209e59),
"PolygonizeBicubicPatches",
"Polygonizes bicubic patches",
"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_subdivisions;
};
/////////////////////////////////////////////////////////////////////////////
// polygonize_bicubic_patches_factory
k3d::iplugin_factory& polygonize_bicubic_patches_factory()
{
return polygonize_bicubic_patches_implementation::get_factory();
}
} // namespace libk3dmesh
|
