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
|
// K-3D
// Copyright (c) 1995-2009, 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)
*/
#include <k3d-i18n-config.h>
#include <k3dsdk/application_plugin_factory.h>
#include <k3dsdk/geometry.h>
#include <k3dsdk/imesh_selection_algorithm.h>
#include <k3dsdk/polyhedron.h>
#include <boost/scoped_ptr.hpp>
namespace module
{
namespace selection
{
/////////////////////////////////////////////////////////////////////////////
// make_face_selection
class make_face_selection :
public k3d::imesh_selection_algorithm
{
typedef k3d::imesh_selection_algorithm base;
public:
const k3d::selection::set create_mesh_selection(const k3d::mesh& Mesh)
{
k3d::selection::set results;
boost::scoped_ptr<k3d::geometry::primitive_selection::storage> primitive_selection(k3d::geometry::primitive_selection::create(results));
// For each primitive in the mesh ...
k3d::uint_t primitive = 0;
for(k3d::mesh::primitives_t::const_iterator p = Mesh.primitives.begin(); p != Mesh.primitives.end(); ++p, ++primitive)
{
boost::scoped_ptr<k3d::polyhedron::const_primitive> polyhedron(k3d::polyhedron::validate(Mesh, **p));
if(polyhedron)
{
// Convert point and edge selections to face selections ...
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)
{
const k3d::uint_t face_loop_begin = polyhedron->face_first_loops[face];
const k3d::uint_t face_loop_end = face_loop_begin + polyhedron->face_loop_counts[face];
for(k3d::uint_t face_loop = face_loop_begin; face_loop != face_loop_end; ++face_loop)
{
const k3d::uint_t first_edge = polyhedron->loop_first_edges[face_loop];
for(k3d::uint_t edge = first_edge; ; )
{
if(polyhedron->edge_selections[edge])
{
k3d::geometry::primitive_selection::append(*primitive_selection, primitive, primitive+1, k3d::selection::FACE, face, face+1, 1.0);
}
else if((*Mesh.point_selection)[polyhedron->vertex_points[edge]])
{
k3d::geometry::primitive_selection::append(*primitive_selection, primitive, primitive+1, k3d::selection::FACE, face, face+1, 1.0);
}
edge = polyhedron->clockwise_edges[edge];
if(edge == first_edge)
break;
}
}
}
continue;
}
}
return results;
}
static k3d::iplugin_factory& get_factory()
{
static k3d::application_plugin_factory<make_face_selection,
k3d::interface_list<k3d::imesh_selection_algorithm> > factory(
k3d::uuid(0xa9255e35, 0x3547771f, 0x745f0d99, 0xa3cb04fa),
"MakeFaceSelection",
_("Converts primitive selections to face selections."),
"Selection",
k3d::iplugin_factory::STABLE);
return factory;
}
};
/////////////////////////////////////////////////////////////////////////////
// make_face_selection_factory
k3d::iplugin_factory& make_face_selection_factory()
{
return make_face_selection::get_factory();
}
} // namespace selection
} // namespace module
|
