Cmesh_import_image.h

Go to the documentation of this file.

/**********************************************************************
 * Copyright (C) 2012, The YaDICs Project Developers. 
 * See the COPYRIGHT file at the top-level directory of this distribution ./COPYRIGHT.
 * See ./COPYING file for copying and redistribution conditions.
 * 
 * This file is part of YaDICs.
 * YaDICs is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * YaDICs 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 General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with YaDICs.  If not, see <http://www.gnu.org/licenses/>.
 * 
 * Information about how to use the software are provided at http://yadic.univ-lille1.fr/
 **********************************************************************/


#ifndef CMESH_IMPORT_IMAGE
#define CMESH_IMPORT_IMAGE


#include "Cmesh_import.h"



template<typename T,typename Timg> 
class Cmesh_import_image : public Cmesh_import<T,Timg>
{
  
  public:
    
  CImg<Timg> m_map;
  CImgList<unsigned int> m_list;
  
  
  Cmesh_import_image() : Cmesh_import<T,Timg>()
  {// constructor
    
    this->class_name = "Cmesh_import_image";
  
  }
  
  virtual int exec(const Cimage<Timg> &oImage)
  {//exec

    load(this->m_path);
    
    m_list.assign(m_map.max());

    std::vector<int> set;
    CImg<int> cimg_set;
    CImg<int> permut_map;
    m_map.sort(permut_map,true);  // Sort by ascending order.
    int val(m_map[0]),pos(0);
    
    for (int p=0;p<m_map.size(); p++)
    {

      if (m_map[p] != val)
      {
        cimg_set.assign(set.size(),1,1,1,0);
        cimg_forX(cimg_set,x){cimg_set[x]=set[x];}
        m_list[pos] = cimg_set;
        set.clear();
        val = m_map[p];
        pos++;
      }
      
      set.push_back(permut_map[p]);

    }
    m_list.remove(pos,m_map.max()-1);
    
    
    int error = assign(oImage);
   
// 
//     #pragma omp parallel
//     {
//       set_nodes(oImage, m_node); //generate node table
//       set_connectivity(oImage, m_node, m_connect);// generate connectivity table
//     }
    
    return error;

  }
  
//   void sort(CImg<Timg> &m_map)
//   {
//     
//     CImg<int> permut;
//     m_map.sort(permut,true);
//     
//     #pragma omp for schedule(runtime)
//     for (int p=0; p<m_map.size(); p++)
//     {//domain loops
//       
//       if(tmp[1][m_map[p]] == 0){m_list.pushback}
//       
//     }
//     
//   }
  
  virtual void load(const std::string &path)
  {// init from file

    m_map.load(path.c_str());
    
  }

  virtual int assign(const Cimage<Timg> &oImage)
  {// initialize attribute dimensions

    //degree of freedom
    this->m_dof = m_map.max();
    if (this->m_verbose){printf("\tDegree Of Freedom : %i\n",this->m_dof);}
    
    //node table
    this->m_node.assign(this->num_var(),m_map.max(),1,1,1,0);
    if (this->m_verbose){printf("\tNode table : [%i](%i,%i,%i)\n",this->m_node.size(), this->m_node[0].width(), this->m_node[0].height(), this->m_node[0].depth());}
    
    //connectivity table
    this->m_connect.assign(m_map.max(),1,1,1,1,0);

    if (this->m_verbose){printf("\tElement table : [%i](%i,%i,%i)\n",this->m_connect.size(), this->m_connect[0].width(), this->m_connect[0].height(), this->m_connect[0].depth());}
    
    //number of pixels
    this->m_numPix = oImage.m_curImg[0].size();
    
    return 0;

  }

  virtual void set_nodes(const Cimage<Timg> &oImage, CImgList<T> &nodes)
  {// node table definition

    
    
  }

  virtual void set_connectivity(const Cimage<Timg> &oImage, const CImgList<T> &nodes, CImgList<int> &elements)
  {// element and connectivity table definition

  }

  
  virtual int cropList(const Cimage<Timg> &oImage, const int &elem, CImg<Timg> &list, std::vector<T> &coord0) const
  {//extract sub_box from global image one using node and element table
  
    int msk = 1;
    
//     list.assign(coord1[0]-coord0[0]+1, coord1[1]-coord0[1]+1, coord1[2]-coord0[2]+1, 1, 0);


    return msk;
    
  }
  
  virtual int grid_dims(const int &i) const
  {// return mesh grid dimensions
  
    switch(i)
    {
      case 0: return this->m_node[0].width(); break;
      case 1: return this->m_node[0].height(); break;
      case 2: return this->m_node[0].depth(); break;
      case 3: return 1; break;
      default:
      {
        std::cerr<<this->class_name<<"::"<<__func__<<": error: id="<<i<<" which is over [0-3]\n"<<std::flush;
        return 0;
      }
    }
    
  }

  
};

#endif