AF2DfltTriangleMeshOp.hpp

Go to the documentation of this file.

/*
 * AF2DfltTriangleMeshOp.hpp
 *
 * An AF2DfltTriangleMeshOp is a meshing operation that applies a
 * two-dimensional advancing front algorithm.  The algorithm uses a
 * set of rules that add only triangular faces.
 * 
 * Like any advancing front algorithm, it requires at least one
 * mesh edge to start the algorithm.  Thus surfaces like spheres and
 * tori that have no one-dimensional boundary should have an artificial
 * one-dimensional boundary introduced.  If not, the algorithm will fail.
 */
#ifndef AF2DFLTTRIANGLEMESHOP_HPP
#define AF2DFLTTRIANGLEMESHOP_HPP

// C++
#include <list>

// MeshKit
#include "meshkit/MeshScheme.hpp"

namespace MeshKit
{

class AF2DfltTriangleMeshOp : public MeshScheme
{
  private:

    static moab::EntityType meshTypes[];

    int getSFIndex() const;

  public:

    static bool can_mesh(iBase_EntityType dimension);

    static bool can_mesh(ModelEnt *me);

    static const char* name();

    static const moab::EntityType* output_types();

    AF2DfltTriangleMeshOp(MKCore *meshkitCore, const MEntVector &meshEntVec);

    virtual ~AF2DfltTriangleMeshOp();

    AF2DfltTriangleMeshOp(const AF2DfltTriangleMeshOp& toCopy);

    AF2DfltTriangleMeshOp& operator=(const AF2DfltTriangleMeshOp& rhs);

    virtual void execute_this();

    virtual const moab::EntityType* mesh_types_arr() const;

    virtual void setup_this();
};

} // end namespace MeshKit

#endif