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 | /* *****************************************************************
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]
***************************************************************** */
// -*- Mode : c++; tab-width: 2; c-tab-always-indent: t; indent-tabs-mode: nil; c-basic-offset: 2
// -*-
//
// SUMMARY:
// USAGE:
//
// ORIG-DATE: 19-Feb-02 at 10:57:52
// LAST-MOD: 23-Jul-03 at 18:08:13 by Thomas Leurent
//
//
// DESCRIPTION:
// ============
/*! \file main.cpp
describe main.cpp here
*/
// DESCRIP-END.
//
#include "MeshImpl.hpp"
#include "MsqTimer.hpp"
#include "Mesquite.hpp"
#include "MsqError.hpp"
#include "Vector3D.hpp"
#include "InstructionQueue.hpp"
#include "PatchData.hpp"
#include "TerminationCriterion.hpp"
#include "QualityAssessor.hpp"
#include "TestUtil.hpp"
// algorithms
#include "Randomize.hpp"
#include "ConditionNumberQualityMetric.hpp"
#include "UntangleBetaQualityMetric.hpp"
#include "LPtoPTemplate.hpp"
#include "LInfTemplate.hpp"
#include "SteepestDescent.hpp"
#include "ConjugateGradient.hpp"
#include "PlanarDomain.hpp"
#include <iostream>
using std::cout;
using std::endl;
#include <cstdlib>
using namespace MBMesquite;
std::string DEFAULT_MESH = TestDir + "unittest/mesquite/2D/vtk/quads/tangled/tangled_quad.vtk";
const bool brief_output = true;
const bool write_output = false;
int main()
{
MBMesquite::MeshImpl mesh;
MsqPrintError err( cout );
mesh.read_vtk( DEFAULT_MESH.c_str(), err );
if( err ) return 1;
// Set Domain Constraint
Vector3D pnt( 0, 0, 5 );
Vector3D s_norm( 0, 0, 1 );
PlanarDomain msq_geom( s_norm, pnt );
// creates an intruction queue
InstructionQueue queue1;
// creates a mean ratio quality metric ...
ConditionNumberQualityMetric shape_metric;
UntangleBetaQualityMetric untangle( 2 );
Randomize pass0( .05 );
// ... and builds an objective function with it
// LInfTemplate* obj_func = new LInfTemplate(shape_metric);
LInfTemplate obj_func( &untangle );
LPtoPTemplate obj_func2( &shape_metric, 2, err );
if( err ) return 1;
// creates the steepest descent optimization procedures
ConjugateGradient pass1( &obj_func, err );
if( err ) return 1;
// SteepestDescent* pass2 = new SteepestDescent( obj_func2 );
ConjugateGradient pass2( &obj_func2, err );
if( err ) return 1;<--- If condition 'err' is true, the function will return/exit
pass2.use_element_on_vertex_patch();
if( err ) return 1;<--- Testing identical condition 'err'<--- Assuming that condition 'err' is not redundant
pass2.use_global_patch();
if( err ) return 1;<--- Condition 'err' is always false
QualityAssessor stop_qa = QualityAssessor( &shape_metric );
QualityAssessor stop_qa2 = QualityAssessor( &shape_metric );
if( brief_output )
{
stop_qa.disable_printing_results();
stop_qa2.disable_printing_results();
}
stop_qa.add_quality_assessment( &untangle );
// **************Set stopping criterion**************
// untangle beta should be 0 when untangled
TerminationCriterion sc1;
sc1.add_relative_quality_improvement( 0.000001 );
TerminationCriterion sc3;
sc3.add_iteration_limit( 10 );
TerminationCriterion sc_rand;
sc_rand.add_iteration_limit( 1 );
// StoppingCriterion sc1(&stop_qa,-1.0,.0000001);
// StoppingCriterion sc3(&stop_qa2,.9,1.00000001);
// StoppingCriterion sc2(StoppingCriterion::NUMBER_OF_PASSES,10);
// StoppingCriterion sc_rand(StoppingCriterion::NUMBER_OF_PASSES,1);
// either until untangled or 10 iterations
pass0.set_outer_termination_criterion( &sc_rand );
pass1.set_outer_termination_criterion( &sc1 );
pass2.set_inner_termination_criterion( &sc3 );
// adds 1 pass of pass1 to mesh_set1
queue1.add_quality_assessor( &stop_qa, err );
if( err ) return 1;
// queue1.add_preconditioner(pass0,err);MSQ_CHKERR(err);
// queue1.add_preconditioner(pass1,err);MSQ_CHKERR(err);
// queue1.set_master_quality_improver(pass2, err); MSQ_CHKERR(err);
queue1.set_master_quality_improver( &pass1, err );
if( err ) return 1;
queue1.add_quality_assessor( &stop_qa2, err );
if( err ) return 1;
if( write_output ) mesh.write_vtk( "original_mesh.vtk", err );
if( err ) return 1;
// launches optimization on mesh_set1
MeshDomainAssoc mesh_and_domain = MeshDomainAssoc( &mesh, &msq_geom );
queue1.run_instructions( &mesh_and_domain, err );
if( err ) return 1;
if( write_output ) mesh.write_vtk( "smoothed_mesh.vtk", err );
if( err ) return 1;
if( !brief_output ) print_timing_diagnostics( cout );
return 0;
}
|