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
/* *****************************************************************
    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: 3; c-tab-always-indent: t; indent-tabs-mode: nil; c-basic-offset: 3
// -*-
//
//   SUMMARY:
//     USAGE:
//
// ORIG-DATE: 19-Feb-02 at 10:57:52
//  LAST-MOD: 23-Jul-03 at 18:09:13 by Thomas Leurent
//
//
// DESCRIPTION:
// ============
/*! \file main.cpp

describe main.cpp here

 */
// DESCRIP-END.
//

#include <iostream>
#include <cstdlib>

#include "Mesquite.hpp"
#include "MeshImpl.hpp"
#include "MsqError.hpp"
#include "Vector3D.hpp"
#include "InstructionQueue.hpp"
#include "PatchData.hpp"
#include "TerminationCriterion.hpp"
#include "QualityAssessor.hpp"

// algorithms
#include "IdealWeightInverseMeanRatio.hpp"
#include "ConditionNumberQualityMetric.hpp"
#include "LPtoPTemplate.hpp"
#include "LInfTemplate.hpp"
#include "SteepestDescent.hpp"
#include "TestUtil.hpp"

using namespace MBMesquite;

int main()
{
    MsqPrintError err( std::cout );
    MBMesquite::MeshImpl mesh;

    std::string file_name = TestDir + "unittest/mesquite/3D/vtk/hexes/untangled/hexes_4by2by2.vtk";
    mesh.read_vtk( file_name.c_str(), err );

    // creates an intruction queue
    InstructionQueue queue1;

    // creates a mean ratio quality metric ...
    IdealWeightInverseMeanRatio mean_ratio( err );
    if( err ) return 1;
    ConditionNumberQualityMetric cond_num;
    mean_ratio.set_averaging_method( QualityMetric::LINEAR );

    // ... and builds an objective function with it
    // LInfTemplate* obj_func = new LInfTemplate(mean_ratio);
    LPtoPTemplate obj_func( &mean_ratio, 2, err );
    if( err ) return 1;<--- If condition 'err' is true, the function will return/exit
    // creates the steepest descent optimization procedures
    SteepestDescent pass1( &obj_func );
    pass1.use_global_patch();
    // if (err) return 1;
    // pass1.set_maximum_iteration(6);

    QualityAssessor stop_qa = QualityAssessor( &mean_ratio );
    if( err ) return 1;<--- Testing identical condition 'err'<--- Assuming that condition 'err' is not redundant
    stop_qa.add_quality_assessment( &cond_num );
    if( err ) return 1;<--- Condition 'err' is always false

    //**************Set stopping criterion****************
    // StoppingCriterion sc1(&stop_qa,1.0,1.8);
    // StoppingCriterion sc2(StoppingCriterion::NUMBER_OF_PASSES,1);
    TerminationCriterion tc2;
    tc2.add_iteration_limit( 1 );
    // CompositeAndStoppingCriterion sc(&sc1,&sc2);
    pass1.set_inner_termination_criterion( &tc2 );

    // adds 1 pass of pass1 to mesh_set1
    //  queue1.add_preconditioner(pass1, err);
    //  if (err) return 1;
    queue1.add_quality_assessor( &stop_qa, err );
    queue1.set_master_quality_improver( &pass1, err );
    if( err ) return 1;
    queue1.add_quality_assessor( &stop_qa, err );
    if( err ) return 1;
    // adds 1 passes of pass2 to mesh_set1
    //  mesh_set1.add_quality_pass(pass2);

    mesh.write_vtk( "original_mesh.vtk", err );
    if( err ) return 1;

    // launches optimization on mesh_set1
    queue1.run_instructions( &mesh, err );
    if( err ) return 1;

    mesh.write_vtk( "smoothed_mesh.vtk", err );
    if( err ) return 1;

    return 0;
}