File: edges_to_blobby.cpp

package info (click to toggle)
k3d 0.8.0.2-6
  • links: PTS, VCS
  • area: main
  • in suites: squeeze
  • size: 40,692 kB
  • ctags: 39,695
  • sloc: cpp: 171,303; ansic: 24,129; xml: 6,995; python: 5,796; makefile: 726; sh: 22
file content (239 lines) | stat: -rw-r--r-- 8,244 bytes parent folder | download | duplicates (5)
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
// K-3D
// Copyright (c) 2004-2005, Romain Behar
//
// Contact: romainbehar@yahoo.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 <k3d-i18n-config.h>
#include <k3dsdk/algebra.h>
#include <k3dsdk/blobby.h>
#include <k3dsdk/document_plugin_factory.h>
#include <k3dsdk/material_sink.h>
#include <k3dsdk/mesh_modifier.h>
#include <k3dsdk/measurement.h>
#include <k3dsdk/node.h>
#include <k3dsdk/polyhedron.h>

#include <boost/scoped_ptr.hpp>

#include <iterator>
#include <set>

namespace module
{

namespace blobby
{

/////////////////////////////////////////////////////////////////////////////
// edges_to_blobby

class edges_to_blobby :
	public k3d::material_sink<k3d::mesh_modifier<k3d::node > >
{
	typedef k3d::material_sink<k3d::mesh_modifier<k3d::node > > base;

public:
	edges_to_blobby(k3d::iplugin_factory& Factory, k3d::idocument& Document) :
		base(Factory, Document),
		m_radius(init_owner(*this) + init_name("radius") + init_label(_("Radius")) + init_description(_("Controls the radius of each blobby segment.")) + init_value(1.0) + init_step_increment(0.1) + init_units(typeid(k3d::measurement::scalar))),
		m_type(init_owner(*this) + init_name("type") + init_label(_("Operator")) + init_description(_("Specify the mathematical operator to merge segments: addition, multiplication, minimum or maximum.")) + init_enumeration(operation_values()) + init_value(MAX))
	{
		m_material.changed_signal().connect(make_reset_mesh_slot());
		m_radius.changed_signal().connect(make_reset_mesh_slot());
		m_type.changed_signal().connect(make_reset_mesh_slot());
	}

	void on_create_mesh(const k3d::mesh& Input, k3d::mesh& Output)
	{
		for(k3d::mesh::primitives_t::const_iterator primitive = Input.primitives.begin(); primitive != Input.primitives.end(); ++primitive)
		{
      boost::scoped_ptr<k3d::polyhedron::const_primitive> polyhedron(k3d::polyhedron::validate(Input, **primitive));
      if(!polyhedron)
        continue;

      const k3d::double_t radius = m_radius.pipeline_value();
      const operation_t type = m_type.pipeline_value();
      k3d::imaterial* const material = m_material.pipeline_value();

      // Build a list of edges, eliminating duplicates (neighbors) as we go ...
      const k3d::mesh::points_t& points = *Input.points;

      typedef std::set<std::pair<k3d::uint_t, k3d::uint_t> > edges_t;
      edges_t edges;

      const k3d::uint_t edge_begin = 0;
      const k3d::uint_t edge_end = edge_begin + polyhedron->clockwise_edges.size();
      for(k3d::uint_t edge = edge_begin; edge != edge_end; ++edge)
      {
        edges.insert(std::make_pair(
          std::min(polyhedron->vertex_points[edge], polyhedron->vertex_points[polyhedron->clockwise_edges[edge]]),
          std::max(polyhedron->vertex_points[edge], polyhedron->vertex_points[polyhedron->clockwise_edges[edge]])));
      }

      // Setup arrays to build a new blobby ...
      boost::scoped_ptr<k3d::blobby::primitive> blobby(k3d::blobby::create(Output));

      blobby->first_primitives.push_back(blobby->primitives.size());
      blobby->primitive_counts.push_back(edges.size());
      blobby->first_operators.push_back(blobby->operators.size());
      blobby->operator_counts.push_back(1);
      blobby->materials.push_back(material);

      // Add a blobby segment for each edge ...
      for(edges_t::const_iterator edge = edges.begin(); edge != edges.end(); ++edge)
      {
        blobby->primitives.push_back(k3d::blobby::SEGMENT);
        blobby->primitive_first_floats.push_back(blobby->floats.size());
        blobby->primitive_float_counts.push_back(23);

        blobby->floats.push_back(points[edge->first][0]);
        blobby->floats.push_back(points[edge->first][1]);
        blobby->floats.push_back(points[edge->first][2]);
        blobby->floats.push_back(points[edge->second][0]);
        blobby->floats.push_back(points[edge->second][1]);
        blobby->floats.push_back(points[edge->second][2]);
        blobby->floats.push_back(radius);

        k3d::matrix4 matrix = k3d::transpose(k3d::identity3());
        blobby->floats.insert(blobby->floats.end(), static_cast<double*>(matrix), static_cast<double*>(matrix) + 16);
      }

      // Merge the edges together ...
      switch(type)
      {
        case ADD:
          blobby->operators.push_back(k3d::blobby::ADD);
          break;
        case MULT:
          blobby->operators.push_back(k3d::blobby::MULTIPLY);
          break;
        case MIN:
          blobby->operators.push_back(k3d::blobby::MINIMUM);
          break;
        case MAX:
          blobby->operators.push_back(k3d::blobby::MAXIMUM);
          break;
      }
      blobby->operator_first_operands.push_back(blobby->operands.size());
      blobby->operator_operand_counts.push_back(edges.size() + 1);
      blobby->operands.push_back(edges.size());
      for(k3d::uint_t i = 0; i != edges.size(); ++i)
        blobby->operands.push_back(i);
    }
	}

	void on_update_mesh(const k3d::mesh& Input, k3d::mesh& Output)
	{
	}

	static k3d::iplugin_factory& get_factory()
	{
		static k3d::document_plugin_factory<edges_to_blobby,
			k3d::interface_list<k3d::imesh_source,
			k3d::interface_list<k3d::imesh_sink> > > factory(
				k3d::uuid(0xc6a00316, 0x72a54b1a, 0xb9ac478e, 0x00fdfc6c),
				"EdgesToBlobby",
				"Converts input edges to segment blobbies",
				"Blobby",
				k3d::iplugin_factory::STABLE);

		return factory;
	}

private:
	typedef enum
	{
		ADD,
		MULT,
		MIN,
		MAX
	} operation_t;

	friend std::ostream& operator << (std::ostream& Stream, const operation_t& Value)
	{
		switch(Value)
		{
			case ADD:
				Stream << "addition";
				break;
			case MULT:
				Stream << "multiplication";
				break;
			case MIN:
				Stream << "minimum";
				break;
			case MAX:
				Stream << "maximum";
				break;
		}

		return Stream;
	}

	friend std::istream& operator >> (std::istream& Stream, operation_t& Value)
	{
		std::string text;
		Stream >> text;

		if(text == "addition")
			Value = ADD;
		else if(text == "multiplication")
			Value = MULT;
		else if(text == "minimum")
			Value = MIN;
		else if(text == "maximum")
			Value = MAX;
		else
			k3d::log() << k3d_file_reference << ": unknown enumeration [" << text << "]"<< std::endl;

		return Stream;
	}

	static const k3d::ienumeration_property::enumeration_values_t& operation_values()
	{
		static k3d::ienumeration_property::enumeration_values_t values;
		if(values.empty())
		{
			values.push_back(k3d::ienumeration_property::enumeration_value_t("Addition", "addition", "Combine blobby segments with BlobbyAdd"));
			values.push_back(k3d::ienumeration_property::enumeration_value_t("Multiplication", "multiplication", "Combine blobby segments with BlobbyMult"));
			values.push_back(k3d::ienumeration_property::enumeration_value_t("Minimum", "minimum", "Combine blobby segments with BlobbyMin"));
			values.push_back(k3d::ienumeration_property::enumeration_value_t("Maximum", "maximum", "Combine blobby segments with BlobbyMax"));
		}

		return values;
	}

	k3d_data(k3d::double_t, immutable_name, change_signal, with_undo, local_storage, no_constraint, measurement_property, with_serialization) m_radius;
	k3d_data(operation_t, immutable_name, change_signal, with_undo, local_storage, no_constraint, enumeration_property, with_serialization) m_type;
};

/////////////////////////////////////////////////////////////////////////////
// edges_to_blobby_factory

k3d::iplugin_factory& edges_to_blobby_factory()
{
	return edges_to_blobby::get_factory();
}

} // namespace blobby

} // namespace module