include/shape/dualize2d.hpp

Go to the documentation of this file.

/*****************************************************************************
 * M a t h e m a g i x
 *****************************************************************************
 * 2011-04-26
 * Bernard Mourrain
 *****************************************************************************
 *               Copyright (C) 2011 INRIA Sophia-Antipolis
 *****************************************************************************
 * Comments :
 ****************************************************************************/
# ifndef shape_dualize2d_hpp
# define shape_dualize2d_hpp

# include <shape/list.hpp>
# include <shape/kdtree_cell.hpp>
# include <shape/dualize.hpp>

# define TMPL   template<class C,class V, class Cell>
# define TMPL1  template<class V>
# define SELF   dualize<C,V,Cell>
//====================================================================
namespace mmx { namespace shape {
//====================================================================

struct default_2d {};

template<class C>
struct use<dualize_def,C,default_2d> {

    template<class Cell>
    struct graph {

        typedef Cell          value_type;
        typedef node<Cell*>   Node;

    public:
        Seq<Cell*>      m_vertices;
        Seq<Cell*>      m_edges;
        Seq<Cell*>      m_faces;
        Seq<Cell*>      m_cells;
    };

    template <class Tree, class Node>
    static void insert_vertex(Tree* t, Node* n){
        t->get_output()->m_vertices<<n->get_cell();
    }

    template <class Tree, class Node>
    static void insert_edge(Tree* t, Node* n1, Node* n2){
        t->get_output()->m_edges<<n1->get_cell()<<n2->get_cell();
    }

    template <class Tree, class Node>
    static void insert_face(Tree* t, Node* n1, Node* n2, Node* n3, Node* n4){
        t->get_output()->m_faces<<n1->get_cell()<<n2->get_cell()<<n3->get_cell()<<n4->get_cell();
    }


    template <class Tree, class Node>
    static void insert_cell(Tree* t,
                            Node* n1, Node* n2, Node* n3, Node* n4,
                            Node* n5, Node* n6, Node* n7, Node* n8) {
        //        this->output()->m_cells<<n1->get_cell()<<n2->get_cell()<<n3->get_cell()<<n4->get_cell()
        //                              <<n5->get_cell()<<n6->get_cell()<<n7->get_cell()<<n8->get_cell();
    }

    template <class Tree, class Node>
    static void dual_edge(Tree* t, Node* n1, Node* n2) {
        t->get_dual_edge(n1, n2);
    }

    template <class Tree, class Node>
    static void dual_face(Tree* t, Node* n1, Node* n2, Node* n3, Node* n4) {
        if (is_adjacent(n1,n4) && is_adjacent(n2,n3))
            t->get_dual_face(n1, n2, n3, n4);
    }

    template <class Tree, class Node>
    static void dual_cell(Tree* t,
                          Node* n1, Node* n2, Node* n3, Node* n4,
                          Node* n5, Node* n6, Node* n7, Node* n8) {
        //t->get_dual_cell(n1, n2, n3, n4, n5, n6, n7, n8);
    }
};


//====================================================================
} ; // namespace shape
              } ; // namespace mmx
//====================================================================
# undef TMPL
# undef TMPL1
# undef SELF 
# endif

---