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 | /* *****************************************************************
MESQUITE -- The Mesh Quality Improvement Toolkit
Copyright 2004 Sandia Corporation and Argonne National
Laboratory. Under the terms of Contract DE-AC04-94AL85000
with Sandia Corporation, the U.S. Government retains certain
rights in this software.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
(lgpl.txt) along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
[email protected], [email protected], [email protected],
[email protected], [email protected], [email protected]
***************************************************************** */
/*! \file LocalSizeQualityMetric.cpp
\author Michael Brewer
\date April 9, 2003
Evaluates the corner volume (or areas) of the element corners
attached to a given vertiex and then averages those values
together.
*/
#include "LocalSizeQualityMetric.hpp"
#include "PatchData.hpp"
using namespace MBMesquite;
//! Calculate the area of the triangle formed by the three vertices.
static inline double compute_corner_area( PatchData& pd, size_t vert_1, size_t vert_2, size_t vert_3, MsqError& err )
{
const MsqVertex* verts = pd.get_vertex_array( err );
Vector3D vec_1 = verts[vert_2] - verts[vert_1];
Vector3D vec_2 = verts[vert_3] - verts[vert_1];
Vector3D cross_vec = vec_1 * vec_2;
return ( cross_vec.length() / 2.0 );
}
//! Calculate the volume of the tetrahedron formed by the four vertices.
static inline double compute_corner_volume( PatchData& pd,
size_t vert_1,
size_t vert_2,
size_t vert_3,
size_t vert_4,
MsqError& err )
{
const MsqVertex* verts = pd.get_vertex_array( err );
Vector3D vec_1 = verts[vert_2] - verts[vert_1];
Vector3D vec_2 = verts[vert_3] - verts[vert_1];
Vector3D vec_3 = verts[vert_4] - verts[vert_1];
return fabs( ( vec_3 % ( vec_1 * vec_2 ) ) / 6.0 );
}
LocalSizeQualityMetric::~LocalSizeQualityMetric() {}
std::string LocalSizeQualityMetric::get_name() const
{
return "Local Size";
}
int LocalSizeQualityMetric::get_negate_flag() const
{
return 1;
}
/*!For the given vertex, vert, with connected elements, e_i for i=1...K,
the LocalSizeQualityMetric computes the corner volumes (or areas) of
each e_i at the corner defined by vert. The corner volume is defined
as the volume of the tet defined by the edges of an element which contain
the common vertex, vert. That volume is then diveded by the average corner
volume of all the element corners connected to this vertex. For
vertices attached to pyramid elements, this metric is undefined.
*/
bool LocalSizeQualityMetric::evaluate( PatchData& pd, size_t this_vert, double& fval, MsqError& err )
{
fval = 0.0;
// get the element array
MsqMeshEntity* elems = pd.get_element_array( err );
MSQ_ERRZERO( err );
// get the vertex to element array and the offset array
// const size_t* elem_offset = pd.get_vertex_to_elem_offset(err); MSQ_ERRZERO(err);
// const size_t* v_to_e_array = pd.get_vertex_to_elem_array(err); MSQ_ERRZERO(err);
// find the offset for this vertex
// size_t this_offset = elem_offset[this_vert];
// get the number of elements attached to this vertex (given by the
// first entry in the vertex to element array)
// size_t num_elems = v_to_e_array[this_offset];
// PRINT_INFO("\nIN LOCAL SIZE CPP, num_elements = %i",num_elems);
size_t num_elems;
const size_t* v_to_e_array = pd.get_vertex_element_adjacencies( this_vert, num_elems, err );
MSQ_ERRZERO( err );
if( num_elems <= 0 )<--- Unsigned less than zero
{
return true;
}
// create an array to store the local metric values before averaging
// Can we remove this dynamic allocatio?
double* met_vals = new double[num_elems];
// vector to hold the other verts which form a corner.
std::vector< size_t > other_vertices;
other_vertices.reserve( 4 );
double total_val = 0.0;
size_t i = 0;
// loop over the elements attached to this vertex
for( i = 0; i < num_elems; ++i )
{
// get the vertices which (with this_vert) form the corner of
// the ith element.
elems[v_to_e_array[i]].get_connected_vertices( this_vert, other_vertices, err );
MSQ_ERRZERO( err );
////PRINT_INFO("\nINSIDE LOCAL SIZE CPP other_vertices size = %i",other_vertices.size());
switch( other_vertices.size() )
{
// if a surface element, compute the corner area
case 2:
met_vals[i] = compute_corner_area( pd, this_vert, other_vertices[0], other_vertices[1], err );
MSQ_ERRZERO( err );
break;
// if a volume element, compute the corner volume
case 3:
met_vals[i] = compute_corner_volume( pd, this_vert, other_vertices[0], other_vertices[1],
other_vertices[2], err );
MSQ_ERRZERO( err );
break;
default:
// otherwise, there is was an error. Either the wrong number
// of vertices were returned fom get_connected_vertices or
// the element does not have the correct number of edges
// connected to this vertex (possibly a pyramid element).
met_vals[i] = 0.0;
MSQ_SETERR( err )
( "Incorrect number of vertices returned from "
"get_connected_vertices.",
MsqError::UNSUPPORTED_ELEMENT );
return false;
};
// keep track of total so that we can compute the linear average
total_val += met_vals[i];
// PRINT_INFO("\nIN LOCAL SIZE CPP, total_val = %f, i = %i",total_val,i);
// clear the vector of other_vertices for re-use.
other_vertices.clear();
// PRINT_INFO("\nIN LOCAL SIZE CPP, after clean size = %f",other_vertices.size());
}
// calculate the linear average... num_elems is non-zero here.
total_val /= (double)num_elems;
// PRINT_INFO("\nIN LOCAL SIZE CPP, average = %f",total_val);
// if the average is non-zero
// divide each entry by the linear average
if( total_val != 0 )
{
for( i = 0; i < num_elems; ++i )
{
met_vals[i] /= total_val;
}
// calculate fval by averaging the corner values
fval = average_metrics( met_vals, num_elems, err );
MSQ_ERRZERO( err );
// PRINT_INFO("\nIN LOCAL SIZE CPP, inside if statement");
}
// PRINT_INFO("\nIN LOCAL SIZE CPP, fval = %f",fval);
// clean up the dynamically allocated array
delete[] met_vals;
// always return true... the vertex position is never invalid
return true;
}
bool LocalSizeQualityMetric::evaluate_with_indices( PatchData& pd,
size_t vertex,
double& value,
std::vector< size_t >& indices,
MsqError& err )
{
indices.clear();
pd.get_adjacent_vertex_indices( vertex, indices, err );
MSQ_ERRZERO( err );
std::vector< size_t >::iterator r, w;
for( r = w = indices.begin(); r != indices.end(); ++r )
{
if( *r < pd.num_free_vertices() )
{
*w = *r;
++w;
}
}
indices.erase( w, indices.end() );
if( vertex < pd.num_free_vertices() ) indices.push_back( vertex );
bool rval = evaluate( pd, vertex, value, err );
return !MSQ_CHKERR( err ) && rval;
}
|