delaunaytriangulator.h

Go to the documentation of this file.

/*
 *
 *                 #####    #####   ######  ######  ###   ###
 *               ##   ##  ##   ##  ##      ##      ## ### ##
 *              ##   ##  ##   ##  ####    ####    ##  #  ##
 *             ##   ##  ##   ##  ##      ##      ##     ##
 *            ##   ##  ##   ##  ##      ##      ##     ##
 *            #####    #####   ##      ######  ##     ##
 *
 *
 *             OOFEM : Object Oriented Finite Element Code
 *
 *               Copyright (C) 1993 - 2013   Borek Patzak
 *
 *
 *
 *       Czech Technical University, Faculty of Civil Engineering,
 *   Department of Structural Mechanics, 166 29 Prague, Czech Republic
 *
 *  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 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
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this library; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 */

//   *******************************
//   *** DELAUNAY MESH GENERATOR ***
//   *******************************

// based on oofemlib/mesherinterface.h


#ifndef delaunaytrinagulator_h
#define delaunaytrinagulator_h

#include <list>
#include "contextioresulttype.h"
#include "timer.h"
#include "octreelocalizert.h"
#include "intarray.h"
#include "edge2d.h"

namespace oofem {
class Domain;
class TimeStep;
class IntArray;
class FloatArray;
class InsertionData;

class DelaunayTriangulator
{
protected:
    Domain *domain;
    // Value of alpha for the boundary recognition via alpha shape algorithm
    double alphaValue;
    // Number of nodes
    int nnode;
    // Option 2: setting bounds for computed Alpha
    //double minAlpha;
    //double maxAlpha;

    Timer meshingTimer;
    Timer searchingTimer;
    Timer polygonTimer;
    Timer creativeTimer;
    std :: list< DelaunayTriangle * >generalTriangleList;
    std :: list< DelaunayTriangle * > :: iterator genIT;

    std :: list< AlphaEdge2D * >alphaShapeEdgeList;

    std :: list< AlphaEdge2D * >edgeList;
    std :: list< AlphaEdge2D * > :: iterator elIT;

    OctreeSpatialLocalizerT< DelaunayTriangle * >triangleOctree;

public:
    DelaunayTriangulator(Domain *d, double setAlpha);
    ~DelaunayTriangulator();

    void generateMesh();

private:
    void addUniqueEdgeToPolygon(Edge2D *edge, std :: list< Edge2D > &polygon);

    void buildInitialBBXMesh(InsertTriangleBasedOnCircumcircle &tInsert);
    void writeMesh();

    void computeAlphaComplex();

    AlphaEdge2D *giveBackEdgeIfAlreadyContainedInList(AlphaEdge2D *alphaEdge);

    void giveAlphaShape();

    void initializeTimers();

    void findNonDelaunayTriangles(int insertedNode, InsertTriangleBasedOnCircumcircle &tInsert, std :: list< Edge2D > &polygon);
    void meshPolygon(int insertedNode, InsertTriangleBasedOnCircumcircle &tInsert, std :: list< Edge2D > &polygon);
    void giveTimeReport();
    void cleanUpTriangleList();

    void computeBBXBasedOnNodeData(BoundingBox &BBX);

};
} // end namespace oofem
#endif // delaunaytrinagulator_h