delaunay_info.h

Go to the documentation of this file.

/*
 * Copyright (c) 2015:  G-CSC, Goethe University Frankfurt
 * Author: Sebastian Reiter
 * 
 * This file is part of UG4.
 * 
 * UG4 is free software: you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License version 3 (as published by the
 * Free Software Foundation) with the following additional attribution
 * requirements (according to LGPL/GPL v3 §7):
 * 
 * (1) The following notice must be displayed in the Appropriate Legal Notices
 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (2) The following notice must be displayed at a prominent place in the
 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (3) The following bibliography is recommended for citation and must be
 * preserved in all covered files:
 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
 *   parallel geometric multigrid solver on hierarchically distributed grids.
 *   Computing and visualization in science 16, 4 (2013), 151-164"
 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
 *   flexible software system for simulating pde based models on high performance
 *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
 * 
 * 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.
 */
 
#ifndef __H__UG_delaunay_info
#define __H__UG_delaunay_info
 
#include <queue>
#include <vector>
#include <sstream>
#include "common/ug_config.h"
#include "lib_grid/lg_base.h"
#include "lib_grid/algorithms/attachment_util.h"
 
namespace ug{
 
template <class TAAPos>
class UG_API DelaunayInfo : public GridObserver
{
  typedef TAAPos  AAPos;
  typedef typename TAAPos::ValueType  vector_t;
 
  public:
    enum Mark{
      NONE,
      INNER,
      NEW_INNER,
      SEGMENT,
      NEW_SEGMENT,
      DART,
      SHELL
    };
 
    DelaunayInfo(Grid& g, TAAPos& aaPos,
           Grid::edge_traits::callback cbConstrainedEdge);
 
    ~DelaunayInfo();
 
    Grid& grid()        {return m_grid;}
    AAPos& position_accessor()  {return m_aaPos;}
 
 
    template <class TIter>
    void init_marks(TIter trisBegin, TIter trisEnd, bool pushFlipCandidates);
 
  //  MARKS
    void set_mark(Vertex* v, Mark m)    {m_aaMark[v] = m;}
    Mark mark(Vertex* v) const        {return static_cast<Mark>(m_aaMark[v]);}
 
    void set_mark(Edge* e, Mark m)      {m_aaMark[e] = m;}
    Mark mark(Edge* e) const        {return static_cast<Mark>(m_aaMark[e]);}
 
    void set_mark(Face* f, Mark m);
    Mark mark(Face* f) const        {return static_cast<Mark>(m_aaMark[f]);}
 
    template <class TIter>
    void set_mark(TIter begin, TIter end, Mark m)
    {
      while(begin != end) {set_mark(*begin, m); ++begin;}
    }
 
    template <class TElem>
    bool is_inner(TElem* e);
 
    template <class TElem>
    bool is_segment(TElem* e);
 
    bool is_dart_segment(Edge* e);
 
    bool is_new_dart_segment(Edge* e);
 
    bool is_dart_shell_segment(Edge* e);
 
 
    bool is_classifiable(Face* f);
 
  //  CANDIDATES
    bool is_candidate(Edge* e)    {return m_aaCandidateEDGE[e];}
    void push_candidate(Edge* e);
    Edge* pop_candidate();
    bool candidates_left()      {return !m_qEdgeCandidates.empty();}
 
    void start_candidate_recording();
 
    void stop_candidate_recording();
 
 
  //  FACE-CLASSIFICATION
    bool classified_faces_left();
    Face* pop_classified_face();
    bool face_classification_enabled()    {return m_aaFaceInfo.valid();}
    void enable_face_classification(number minAngle);
 
    number min_angle() const        {return m_minAngle;}
    number max_dot() const          {return m_maxDot;}
  //  GRID-OBERSERVER CALLBACKS
    virtual void vertex_created(Grid* grid, Vertex* vrt,
                  GridObject* pParent,
                  bool replacesParent);
 
    virtual void edge_created(Grid* grid, Edge* e,
                  GridObject* pParent,
                  bool replacesParent);
 
    virtual void face_created(Grid* grid, Face* f,
                  GridObject* pParent,
                  bool replacesParent);
 
    
    virtual void edge_to_be_erased(Grid* grid, Edge* e, Edge* replacedBy);
 
    virtual void face_to_be_erased(Grid* grid, Face* f, Face* replacedBy);
 
  private:
    struct FaceInfo{
      FaceInfo() : f(NULL), priority(0), classified(false)  {}
      Face* f;
      number priority;
      bool classified;
    };
 
    struct CompareFaceInfo{
      bool operator()(const FaceInfo* fi1, const FaceInfo* fi2) const
      {
        return fi1->priority < fi2->priority;
      }
    };
 
    typedef Attachment<FaceInfo*> AFaceInfo;
 
    typedef std::priority_queue<FaceInfo*, std::vector<FaceInfo*>,
                  CompareFaceInfo>
      FacePriorityQueue;
 
 
    bool is_classified(Face* f);
    bool classify_face(Face* f);
 
  private:
    Grid&   m_grid;
    AAPos m_aaPos;
 
    AByte   m_aMark;
    MultiElementAttachmentAccessor<AByte>   m_aaMark;
 
    AFaceInfo m_aFaceInfo;
    Grid::AttachmentAccessor<Face, AFaceInfo> m_aaFaceInfo;
    FacePriorityQueue m_faceQueue;
 
    number              m_minAngle;
    number              m_maxDot;
    Grid::edge_traits::callback   m_cbConstrainedEdge;
 
  //  candidate edges
    ABool                 m_aCandidate;
    Grid::AttachmentAccessor<Edge, ABool> m_aaCandidateEDGE;
    std::queue<Edge*>           m_qEdgeCandidates;
 
  //  helper vector used during start/stop_candidate_recording
    bool  m_candidateRecordingEnabled;
    std::vector<Edge*>  m_recordedCandidates;
};
 
}// end of namespace
 
 
//  include implementation
#include "delaunay_info_impl.h"
 
 
#endif  //__H__UG_delaunay_info