---

pyramid.hh

Go to the documentation of this file.

#ifndef __PYRAMID_HH__
#define __PYRAMID_HH__

#include <tab_bool.hh>
#include <image.hh>

#include "value_set.hh"
#include "combinatorial_map.hh"

class combi_map_base;
class combi_map_base_exp;
class combi_map_base_imp;
class kernel;


class pyramid
{
private:
  // Pointor on the combinatorial map of the base of the pyramid
  combi_map_base *base;
  // The combinatorial map of the top level of the pyramid
  combi_map_priv map;
  // The level_set of the pyramid
  level_set l_set;
  // Pointor on the value_set of the pyramid
  value_set *value;
  
public:
  typedef enum {implicit_base,explicit_base} construction;
  pyramid(int dimx, int dimy, value_set &val, construction c=explicit_base);
  pyramid(char *, construction c=explicit_base);
  pyramid(ifstream &, construction c=explicit_base);
  ~pyramid();
  void compute_level(kernel &);
  void compute_pyramid(kernel &);
  int save(const char*);
  void give_combinatorial_map(int,combinatorial_map &);
  int give_max_level();
  
  dart give_alpha_base(dart d)
  {
    return base->alpha(d);
  }
  dart give_sigma_base(dart d)
  {
    return base->sigma(d);
  }
  move_type give_move_base(dart d)
  {
    return base->give_move(d);
  }
  int give_level(dart d)
  {
    return l_set.give_level(d);
  }
  void give_pointel(dart d,point &p)
  {
    base->give_pointel(d,p);
  }
  void give_pixel(dart d,point &p)
  {
    base->give_pixel(d,p);
  }

  int compute_index_orientation(dart d1,dart d2)
  {
    return base->compute_index_orientation(d1, d2);
  }
  dart_iterator &first_dart(int l)
  {
    return l_set.first(l);
  }
  dart_iterator &begin_dart(int l)
  {
    return l_set.begin(l);
  }
  dart_iterator &end_dart(int l)
  {
    return l_set.end(l);
  }
  dart_iterator &last_dart(int l)
  {
    return l_set.last(l);
  }
  int give_width()
  {
    return base->give_width();
  }
  int give_height()
  {
    return base->give_height();
  }

  dart give_next_border_dart(dart,int);

private:
  int load(ifstream &, construction);
  // Fonction that will be call to contract the edge marked by the kernel
  void contract_edge(kernel &, list_label &);
  // Fonction that will be call to remove the empty self-loop
  void remove_empty_self_loops(list_label &);
  // Fonction that will be call to remove double edge
  void remove_double_edges(kernel &);
  // Fonction to update the mu and mu_1 array, and the vertex list of the combinatorial map 
  void update_vertex_set(kernel &);
  void update_sigma_double_edge(kernel &,list_label &,tab_sym_bool &,dart);
  dart compute_sigma_successor(kernel &kern, dart b);
  dart update_sigma_alpha(dart, dart &, int, dart &);
  dart update_next_dart(dart, dart &, int, bool &);

  dart extract_update_sigma_alpha(dart,dart&,int,int&,tab_dart&);
  dart extract_update_next_dart(dart,dart&,int,tab_dart&);
};


#endif // __PYRAMID_HH__

---