include/shape/polygonizer2d.hpp

Go to the documentation of this file.

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

# include <shape/list.hpp>
# include <shape/tpl3d.hpp>
# include <shape/polygonizer.hpp>
# include <shape/marching_cube.hpp>

# define TMPL   template<class C, class Input, class Output>
# define TMPL1  template<class V>
# define SELF   polygonizer<C,default_2d,Input,Output>
//====================================================================
namespace mmx { namespace shape {
//====================================================================

template<class C, class Input, class Output >
struct polygonizer<C,default_2d,Input,Output>: public PROCESS_OF(default_2d)
{

    //  typedef Seq<Cell*>                  Input;
    //  typedef tpl3d<C,V>                  Output;
    typedef typename Output::Point      Point;
    typedef typename Output::Edge       Edge;
    typedef typename Output::Face       Face;

    polygonizer();
    polygonizer(Input* in);
    polygonizer(Input* in, Output* out);
    ~polygonizer(void) ;

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

    void    set_output (Output* o)  { m_output = o; }
    Output* get_output (void) const { return m_output; }

    void run();
    void clear(void);

    private:
    Input*       m_input;
    Output*      m_output;
};
//--------------------------------------------------------------------
TMPL SELF::polygonizer() {
    m_output = new Output;
}
//--------------------------------------------------------------------
TMPL SELF::polygonizer(Input* in) {
    m_input = in;
    m_output = new Output;
}
//--------------------------------------------------------------------
TMPL SELF::polygonizer(Input* in, Output* out) {
    m_input = in;
    m_output = out;
}
//--------------------------------------------------------------------
TMPL SELF::~polygonizer(void) {
    delete m_output;
}
//--------------------------------------------------------------------
TMPL void SELF::run() {
    typedef typename Input::value_type  Cell;

    unsigned n=0;

    if(false) for(unsigned i=0; i< this->get_input()->m_vertices.size(); i++) {
        Cell* c=this->get_input()->m_vertices[i];
        if (c->m_center == NULL){
            if(false) {
                Point* p1 = new Point(c->xmin(),c->ymin(),0);
                m_output->insert_vertex(p1);p1->set_index(n);n++;
                Point* p2 = new Point(c->xmax(),c->ymin(),0);
                m_output->insert_vertex(p2);p2->set_index(n);n++;
                Point* p3 = new Point(c->xmax(),c->ymax(),0);
                m_output->insert_vertex(p3);p3->set_index(n);n++;
                Point* p4 = new Point(c->xmin(),c->ymax(),0);
                m_output->insert_vertex(p4);p4->set_index(n);n++;
                m_output->insert_edge(new Edge(p1,p2));
                m_output->insert_edge(new Edge(p2,p3));
                m_output->insert_edge(new Edge(p3,p4));
                m_output->insert_edge(new Edge(p4,p1));
            }
            c->m_center = new Point(c->center());
            m_output->insert_vertex(c->m_center);
            c->m_center->set_index(n); n++;
        }
    }

    if(false) for(unsigned i=0; i< this->get_input()->m_edges.size(); i+=2) {
        if(!this->get_input()->m_edges[i]->m_center) {
            Cell* c=this->get_input()->m_vertices[i];
            c->m_center = new Point(c->center());
            m_output->insert_vertex(c->m_center);
            c->m_center->set_index(n); n++;
        }
        if(!this->get_input()->m_edges[i+1]->m_center) {
            Cell* c=this->get_input()->m_vertices[i];
            c->m_center = new Point(c->center());
            m_output->insert_vertex(c->m_center);
            c->m_center->set_index(n); n++;
        }

        m_output->insert_edge(new Edge(this->get_input()->m_edges[i]->m_center,
                                  this->get_input()->m_edges[i+1]->m_center));
    }

    Point  points[8];
    C      values[8];

    Seq<Cell*> L = this->get_input()->m_faces;

    for(unsigned i=0; i< L.size(); i+=4) {

        for(unsigned j=0; j<4; j++) {
            points[j] = L[i+j]->center();
            values[j] = L[i+j]->center_value();
        }

        marching_square::polygonize(*this->get_output(), points, values, (double)0);

        if(false) {
            Point* p1 = new Point(this->get_input()->m_faces[i]->center());
            m_output->insert_vertex(p1);p1->set_index(n);n++;
            Point* p2 = new Point(this->get_input()->m_faces[i+1]->center());
            m_output->insert_vertex(p2);p2->set_index(n);n++;
            Point* p3 = new Point(this->get_input()->m_faces[i+2]->center());
            m_output->insert_vertex(p3);p3->set_index(n);n++;
            Point* p4 = new Point(this->get_input()->m_faces[i+3]->center());
            m_output->insert_vertex(p4);p4->set_index(n);n++;
            m_output->insert_edge(new Edge(p1,p2));
            m_output->insert_edge(new Edge(p2,p3));
            m_output->insert_edge(new Edge(p3,p4));
            m_output->insert_edge(new Edge(p4,p1));
        }
    }

}
//--------------------------------------------------------------------
TMPL void SELF::clear(void) {  
}

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

---