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
|
// This file is part of ff3d - http://www.freefem.org/ff3d
// Copyright (C) 2001, 2002, 2003 Stphane Del Pino
// 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, 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.
// $Id: EdgesBuilder.hpp,v 1.3 2007/05/20 23:02:47 delpinux Exp $
#ifndef EDGES_BUILDER_HPP
#define EDGES_BUILDER_HPP
#include <map>
#include <set>
#include <TinyVector.hpp>
/**
* @file EdgesBuilder.hpp
* @author Stephane Del Pino
* @date Sun Oct 16 16:34:36 2005
*
* @brief Builds edges of given meshes.
* @todo Should use elements sets and not meshes to build edges sets
*/
template <typename MeshType>
class EdgesBuilder
{
private:
typedef typename MeshType::CellType CellType;
typedef TinyVector<Edge::NumberOfVertices, size_t> EdgeVertices;
std::map<EdgeVertices, EdgeVertices> __edgesIdSet;
ReferenceCounting<EdgesSet> __edgesSet;
public:
ReferenceCounting<EdgesSet>
edgesSet()
{
return __edgesSet;
}
EdgesBuilder(MeshType& mesh)
{
ffout(3) << "- EdgesBuilder: building...\n";
for (typename MeshType::const_iterator i(mesh); not(i.end()); ++i) {
const CellType& cell = *i;
for (size_t j=0; j<CellType::NumberOfEdges; ++j) {
std::set<size_t> vertices;
EdgeVertices edge;
for (size_t k=0; k<Edge::NumberOfVertices ;++k) {
edge[k] = mesh.vertexNumber(cell(CellType::edges[j][k]));
vertices.insert(edge[k]);
}
ASSERT(vertices.size() == Edge::NumberOfVertices);
EdgeVertices edgeId;
size_t k=0;
for (std::set<size_t>::const_iterator iv = vertices.begin();
iv != vertices.end(); ++iv,++k) {
edgeId[k] = *iv;
}
if (__edgesIdSet.find(edgeId) == __edgesIdSet.end()) {
__edgesIdSet.insert(__edgesIdSet.end(),
std::make_pair(edgeId, edge));
}
}
}
__edgesSet = new EdgesSet(__edgesIdSet.size());
EdgesSet& edgesSet = *__edgesSet;
size_t i=0;
for (typename std::map<EdgeVertices, EdgeVertices>::const_iterator
f = __edgesIdSet.begin(); f != __edgesIdSet.end(); ++f, ++i) {
TinyVector<Edge::NumberOfVertices, Vertex*> newEdge;
for (size_t k=0; k<Edge::NumberOfVertices; ++k) {
const size_t vertexNumber = f->second[k];
newEdge[k] = &mesh.vertex(vertexNumber);
}
edgesSet[i] = Edge(*newEdge[0], *newEdge[1]);
}
ffout(3) << "- EdgesBuilder: done\n";
}
~EdgesBuilder()
{
;
}
};
#endif // EDGES_BUILDER_HPP
|
