/Users/mourrain/Devel/mmx/shape/include/shape/dualize.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_dualize_hpp
# define shape_dualize_hpp

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

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

  typedef node<Shape*,Cell*>         Node;

public:
  Seq<Node*>      m_edges;
  Seq<Node*>      m_faces;
};


template<class C,class V=default_env, class Shape=typename SHAPE_OF(V), class Cell=cell<C,V> >
struct dualize: public PROCESS_OF(V)
{

  typedef node<Shape*,Cell*>                  Node;
  typedef kdtree_cell<Shape,Cell>               Input;
  typedef graph_dual<Shape,Cell>              Output;

  dualize(void);
 ~dualize(void) ;

  void    set_input (Input* i) { m_input = i; }

  Input*  input  (void)     { return m_input; }
  Output* output (void)     { return m_output; }

  void run();

  void get_dual_vertex(Node*);
  void get_dual_edge(Node*, Node*);
  void get_dual_face(Node*, Node*, Node*);
  void get_dual_face(Node*, Node*, Node*, Node*);

  void clear(void);

private:
  Input*       m_input;
  Output*      m_output;
};
//--------------------------------------------------------------------
TMPL SELF::dualize() {
  m_output = new Output;
}
//--------------------------------------------------------------------
TMPL SELF::~dualize(void) {
  delete m_output;
}
//--------------------------------------------------------------------
TMPL void SELF::get_dual_vertex(Node* n) {
  if(!n->get_cell()->is_active()) return;
  if(!n->is_leaf()) {
    this->get_dual_vertex(n->left()); 
    this->get_dual_vertex(n->right()); 
    this->get_dual_edge(n->left(),n->right()); 
  }
  return;
}

//--------------------------------------------------------------------
TMPL void SELF::get_dual_edge(Node* n1, Node* n2) {
  if(!n1->get_cell()->is_active()) return;
  if(!n2->get_cell()->is_active()) return;
  if(!is_adjacentpl3d(n1->get_cell(),n2->get_cell())) return;

  if(!n1->is_leaf()) { 
    get_dual_edge(n1->left(),  n2);
    get_dual_edge(n1->right(), n2);
    get_dual_face(n1->left(), n1->right(), n2);
    return;
  } 

  if(!n2->is_leaf()){
    get_dual_edge(n1,  n2->left());
    get_dual_edge(n1,  n2->right());
    get_dual_face(n1,  n2->left(), n2->right());
    return;
  }

  this->output()->m_edges<<n1<<n2;
  return;
}

//--------------------------------------------------------------------
TMPL void SELF::get_dual_face(Node* n1, Node* n2, Node* n3) {
  if(!n1->get_cell()->is_active()) return;
  if(!n2->get_cell()->is_active()) return;
  if(!n3->get_cell()->is_active()) return;
  if(!is_adjacentpl3d(n1->get_cell(),n2->get_cell()) ||
     !is_adjacentpl3d(n2->get_cell(),n3->get_cell()) ||
     !is_adjacentpl3d(n3->get_cell(),n1->get_cell()) ) return;

  if(!n1->is_leaf()){
    if(is_adjacentpl3d(n1->left()->get_cell(),n2->get_cell())) {
      if(is_adjacentpl3d(n1->left()->get_cell(),n3->get_cell()))
        get_dual_face(n1->left(),n2,n3);
      else
      if(is_adjacentpl3d(n1->right()->get_cell(),n3->get_cell()))
        get_dual_face(n1->right(),n1->left(),n2,n3);
    } 

    if(is_adjacentpl3d(n1->right()->get_cell(),n2->get_cell())) {
      if(is_adjacentpl3d(n1->right()->get_cell(),n3->get_cell()))
        get_dual_face(n1->right(),n2,n3);
      else
      if(is_adjacentpl3d(n1->left()->get_cell(),n3->get_cell()))
        get_dual_face(n1->left(),n1->right(),n2,n3);
    }
    return;
  } 

  if(!n2->is_leaf()){
    if(is_adjacentpl3d(n2->left()->get_cell(),n3->get_cell())) {
      if(is_adjacentpl3d(n2->left()->get_cell(),n1->get_cell()))
        get_dual_face(n1, n2->left(),n3);
      else
      if(is_adjacentpl3d(n2->right()->get_cell(),n1->get_cell()))
        get_dual_face(n1, n2->right(),n2->left(),n3);
    } 

    if(is_adjacentpl3d(n2->right()->get_cell(),n3->get_cell())) {
      if(is_adjacentpl3d(n2->right()->get_cell(),n1->get_cell()))
        get_dual_face(n1, n2->right(),n3);
       else
      if(is_adjacentpl3d(n2->left()->get_cell(),n1->get_cell()))
        get_dual_face(n1,n2->left(),n2->right(),n3);
    }
    return;
  } 

  if(!n3->is_leaf()){
    if(is_adjacentpl3d(n3->left()->get_cell(),n1->get_cell())) {
      if(is_adjacentpl3d(n3->left()->get_cell(),n2->get_cell()))
        get_dual_face(n1,n2,n3->left());
      else
      if(is_adjacentpl3d(n3->right()->get_cell(),n2->get_cell()))
        get_dual_face(n1,n2,n3->right(),n3->left());
    } 

    if(is_adjacentpl3d(n3->right()->get_cell(),n1->get_cell())) {
      if(is_adjacentpl3d(n3->right()->get_cell(),n2->get_cell()))
        get_dual_face(n1,n2,n3->right());
      else
      if(is_adjacentpl3d(n3->left()->get_cell(),n2->get_cell()))
        get_dual_face(n1,n2,n3->left(),n3->right());
    }
    return;
  } 

  this->output()->m_faces<<n1<<n2<<n3;
  return;
}

//--------------------------------------------------------------------
TMPL void SELF::get_dual_face(Node* n1, Node* n2, Node* n3, Node* n4) {
  if(!n1->get_cell()->is_active()) return;
  if(!n2->get_cell()->is_active()) return;
  if(!n3->get_cell()->is_active()) return;
  if(!n4->get_cell()->is_active()) return;
  if(!is_adjacentpl3d(n1->get_cell(),n2->get_cell()) ||
     !is_adjacentpl3d(n2->get_cell(),n3->get_cell()) ||
     !is_adjacentpl3d(n3->get_cell(),n4->get_cell()) ||
     !is_adjacentpl3d(n4->get_cell(),n1->get_cell()) ) return;

  if(!n1->is_leaf()){
    get_dual_face(n1->left(), n2,n3,n4);
    get_dual_face(n1->right(),n2,n3,n4);
    return;
  }

  if(!n2->is_leaf()){
    get_dual_face(n1,n2->left(), n3,n4);
    get_dual_face(n1,n2->right(),n3,n4);
    return;
  }

  if(!n3->is_leaf()){
    get_dual_face(n1,n2,n3->left(), n4);
    get_dual_face(n1,n2,n3->right(),n4);
    return;
  }

  if(!n4->is_leaf()){
    get_dual_face(n1,n2,n3,n4->left());
    get_dual_face(n1,n2,n3,n4->right());
    return;
  }
        
  this->output()->m_faces<<n1<<n2<<n3;
  this->output()->m_faces<<n1<<n4<<n3;
  return;
}
//--------------------------------------------------------------------
TMPL void SELF::run() {
  this->get_dual_vertex(m_input->root());
}
//--------------------------------------------------------------------
TMPL void SELF::clear(void) {
  
}

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