File: poly_to_bilinear.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 (149 lines) | stat: -rw-r--r-- 4,898 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
// K-3D
// Copyright (c) 1995-2007, 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 Timothy M. Shead (tshead@k-3d.com)
*/

#include <k3d-i18n-config.h>
#include <k3dsdk/bilinear_patch.h>
#include <k3dsdk/document_plugin_factory.h>
#include <k3dsdk/imaterial.h>
#include <k3dsdk/mesh_modifier.h>
#include <k3dsdk/node.h>
#include <k3dsdk/polyhedron.h>
#include <k3dsdk/table_copier.h>

#include <boost/scoped_ptr.hpp>

namespace module
{

namespace bilinear_patch
{

/////////////////////////////////////////////////////////////////////////////
// poly_to_bilinear

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

public:
	poly_to_bilinear(k3d::iplugin_factory& Factory, k3d::idocument& Document) :
		base(Factory, Document)
	{
	}

	void on_create_mesh(const k3d::mesh& Input, k3d::mesh& Output)
	{
		Output.points = Input.points;
		Output.point_selection = Input.point_selection;
		Output.point_attributes = Input.point_attributes;

		// For each polyhedron ...
		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;

			// Create bilinear patches ...
			boost::scoped_ptr<k3d::bilinear_patch::primitive> bilinear_patches(k3d::bilinear_patch::create(Output));

			// Get ready to copy attributes ...
			bilinear_patches->constant_attributes = polyhedron->constant_attributes;
			bilinear_patches->patch_attributes = polyhedron->face_attributes.clone_types();
			bilinear_patches->vertex_attributes = polyhedron->vertex_attributes.clone_types();

			k3d::table_copier patch_attributes(polyhedron->face_attributes, bilinear_patches->patch_attributes);
			k3d::table_copier vertex_attributes(polyhedron->vertex_attributes, bilinear_patches->vertex_attributes);

			// Create a patch for each quadrilateral face in the polyhedron ...
			const k3d::uint_t face_begin = 0;
			const k3d::uint_t face_end = face_begin + polyhedron->face_first_loops.size();
			for(k3d::uint_t face = face_begin; face != face_end; ++face)
			{
				std::vector<k3d::uint_t> edges;

				const k3d::uint_t first_edge = polyhedron->loop_first_edges[polyhedron->face_first_loops[face]];
				for(k3d::uint_t edge = first_edge; ;)
				{
					edges.push_back(edge);

					edge = polyhedron->clockwise_edges[edge];
					if(edge == first_edge)
						break;
				}

				if(edges.size() != 4)
					continue;

				bilinear_patches->patch_selections.push_back(polyhedron->face_selections[face]);
				bilinear_patches->patch_materials.push_back(polyhedron->face_materials[face]);
				patch_attributes.push_back(face);

				// Note: Bilinear patch control points *aren't* in clockwise order!
				bilinear_patches->patch_points.push_back(polyhedron->vertex_points[edges[0]]);
				bilinear_patches->patch_points.push_back(polyhedron->vertex_points[edges[1]]);
				bilinear_patches->patch_points.push_back(polyhedron->vertex_points[edges[3]]); 
				bilinear_patches->patch_points.push_back(polyhedron->vertex_points[edges[2]]);

				vertex_attributes.push_back(edges[0]);
				vertex_attributes.push_back(edges[1]);
				vertex_attributes.push_back(edges[3]);
				vertex_attributes.push_back(edges[2]);
			}
		}
	}

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

	static k3d::iplugin_factory& get_factory()
	{
		static k3d::document_plugin_factory<poly_to_bilinear,
			k3d::interface_list<k3d::imesh_source,
			k3d::interface_list<k3d::imesh_sink> > > factory(
				k3d::uuid(0xe99f3672, 0x6e85457d, 0x9ce1f9dc, 0x6bb71691),
				"PolyToBilinear",
				_("Converts input quadrilaterals to bilinear patches."),
				"BilinearPatch",
				k3d::iplugin_factory::STABLE);

		return factory;
	}
};

/////////////////////////////////////////////////////////////////////////////
// poly_to_bilinear_factory

k3d::iplugin_factory& poly_to_bilinear_factory()
{
	return poly_to_bilinear::get_factory();
}

} // namespace bilinear_patch

} // namespace module