/users/wolffm/guskov/Source/Tile.hh

Go to the documentation of this file.

#ifndef DEF_TILE
#define DEF_TILE


#include "Common.hh"

#include "TableauBiDim.hh"

#include <list>
#include <map>

#include "TileFaceIter.hh"
#include "TileVertexIter.hh"

#include "SparseMatrix.hh"


class Tile
{
private:

  const unsigned int id;
  
  Seed seed;            

  BaseMesh::VertexHandle base_mesh_vertex; 

  bool boundary_neighbours_calculated; 

  std::map< int, std::list< int >* > boundary_neighbours;

  static TableauBiDim<double> tile_boundary_length;
  
  list<Vertex> interior_vertices; 


  list<Vertex> boundary_vertices; 

  
  unsigned int no_vertices_on_mesh_boundary;  

  
  vector< unsigned int > neighbour_tiles;


  void calculate_boundary_neighbours(OriginalMesh const & m );


  

public:

  // ###################################################################################################
  // fonctionalité pour les itérateurs
  // ###################################################################################################
  

  
  std::vector< unsigned int >::const_iterator neighbour_tiles_begin() const ;
  
  std::vector< unsigned int >::const_iterator neighbour_tiles_end() const;

  std::list< Vertex >::const_iterator interior_vertices_begin() const;
  std::list< Vertex >::const_iterator interior_vertices_end() const;
  std::list< Vertex >::const_iterator boundary_vertices_begin() const;
  std::list< Vertex >::const_iterator boundary_vertices_end() const;

  friend class Tile_Vertex_Iter;

  friend class Tile_Face_Iter;

  Tile_Vertex_Iter vertices_begin();

  Tile_Face_Iter faces_begin(OriginalMesh* mesh);


  Tile_Face_Iter faces_begin(OriginalMesh* mesh, OriginalMesh::FaceHandle& fh);

  


  // Constructeurs & Destructeurs

  Tile(const Vertex tile_seed, const unsigned int tile_id);


  ~Tile() { clear(); }


  // fonctions

  Seed get_seed() const
  { return seed;}

  const unsigned int get_id() const
  { return id; }

  BaseMesh::VertexHandle get_base_mesh_vertex() const
  { 
    return base_mesh_vertex; 
  }

  void set_base_mesh_vertex(BaseMesh::VertexHandle const & bm_vertex)
  {
    base_mesh_vertex = bm_vertex;
  }

  void clear();

  
  void add_vertex(Vertex v, bool is_on_tile_boundary, bool is_on_mesh_boundary);


  void change_to_boundary(Vertex v);

  
  Vertex reposition_seed(const OriginalMesh& mesh);

  void boundary_parametrization(OriginalMesh& om, const OriginalMesh& bm, const vector<Tile*>& tiles, map<int, unsigned int>& matrix_pos, SparseMatrix& matrix, double* b_ret_x, double* b_ret_y, OriginalMesh::Point& ret_map_centroid);
  
  
  static void calculate_boundary_lengths(OriginalMesh& m, const vector<Tile*>& tiles);


  // ###################################################################################################
  // Vérification des conditions topologiques
  // ###################################################################################################



  
  bool check_conditions_EB(Vertex& new_seed, const OriginalMesh& mesh);


  bool check_conditions_NZ(Vertex& new_seed, OriginalMesh& mesh);

  bool check_conditions_MB(Vertex& new_seed, OriginalMesh& mesh);

  bool check_conditions_MN(Vertex& new_seed,  OriginalMesh& mesh);

  double calculate_error(OriginalMesh& mesh);


  void find_neighbours_orders(OriginalMesh& m);

  bool connected_neighbours(OriginalMesh& m, unsigned int germe1, unsigned int germe2);
        
};

#endif

---