CGAL 5.6.3 - Combinatorial Maps

Loading...
Searching...
No Matches
Combinatorial_map/map_3_dynamic_onmerge.cpp
#include <CGAL/Combinatorial_map.h>
#include <CGAL/Cell_attribute.h>
#include <iostream>
#include <cstdlib>
// My item class: no functor is associated with Face_attribute.
struct Myitem
{
template<class CMap>
struct Dart_wrapper
{
typedef CGAL::Cell_attribute<CMap, double> Face_attribute; // A weight
typedef std::tuple<void,void,Face_attribute> Attributes;
};
};
// Definition of my combinatorial map.
typedef CGAL::Combinatorial_map<3,Myitem> CMap_3;
typedef CMap_3::Dart_descriptor Dart_descriptor;
typedef CMap_3::Attribute_type<2>::type Face_attribute;
// Functor called when two faces are merged.
struct Merge_functor
{
// operator() automatically called before a merge.
void operator()(Face_attribute& ca1, Face_attribute& ca2)
{
ca1.info()=ca1.info()+ca2.info(); // Update can be done incrementally.
std::cout<<"After on merge faces: info of face1="<<ca1.info()
<<", info of face2="<<ca2.info()<<std::endl;
}
};
// Functor called when one face is split in two.
struct Split_functor
{
Split_functor(CMap_3& amap) : mmap(amap)
{}
// operator() automatically called after a split.
void operator()(Face_attribute& ca1, Face_attribute& ca2)
{
// We need to reinitialize the weight of the two faces
CMap_3::size_type nb1=mmap.darts_of_cell<2>(ca1.dart()).size();
CMap_3::size_type nb2=mmap.darts_of_cell<2>(ca2.dart()).size();
mmap.info<2>(ca1.dart())*=(double(nb1)/(nb1+nb2));
mmap.info<2>(ca2.dart())*=(double(nb2)/(nb1+nb2));
std::cout<<"After on split faces: info of face1="<<ca1.info()
<<", info of face2="<<ca2.info()<<std::endl;
}
private:
CMap_3& mmap;
};
// Function allowing to display all the 2-attributes, and the characteristics
// of a given combinatorial map.
void display_map_and_2attributes(CMap_3& cm)
{
for (CMap_3::Attribute_range<2>::type::iterator
it=cm.attributes<2>().begin(), itend=cm.attributes<2>().end();
it!=itend; ++it)
{ std::cout<<cm.info_of_attribute<2>(it)<<"; "; }
std::cout<<std::endl;
cm.display_characteristics(std::cout);
std::cout<<", valid="<<cm.is_valid()<<std::endl;
}
int main()
{
CMap_3 cm;
// 0) Create 2 hexahedra.
Dart_descriptor d1 = cm.make_combinatorial_hexahedron();
Dart_descriptor d2 = cm.make_combinatorial_hexahedron();
// 1) Create and initialize 2-attributes.
for (CMap_3::One_dart_per_cell_range<2>::iterator
it=cm.one_dart_per_cell<2>().begin(),
itend=cm.one_dart_per_cell<2>().end(); it!=itend; ++it)
{ cm.set_attribute<2>(it, cm.create_attribute<2>(1)); }
// 2) Set the onsplit and onmerge functors.
cm.onsplit_functor<2>()=Split_functor(cm);
cm.onmerge_functor<2>()=Merge_functor();
// 3) 3-Sew the two hexahedra along one face. This calls 1 onmerge.
cm.sew<3>(d1, d2);
// 4) Display all the values of 2-attributes.
display_map_and_2attributes(cm);
// 5) Insert a vertex in the face between the two hexahedra.
// This calls 3 onsplit.
Dart_descriptor resdart=cm.insert_cell_0_in_cell_2(d2);
// 6) Display all the values of 2-attributes.
display_map_and_2attributes(cm);
// 7) "Remove" the dynamic onmerge functor.
cm.onmerge_functor<2>()=boost::function<void(Face_attribute&,
Face_attribute&)>();
// 8) Remove one edge: this merges two faces, however no dynamic
// functor is called (because it was removed).
cm.remove_cell<1>(resdart);
// 9) Display all the values of 2-attributes.
display_map_and_2attributes(cm);
return EXIT_SUCCESS;
}
CGAL::Cell_attribute
The class Cell_attribute represents an attribute containing (or not) an information.
Definition: Cell_attribute.h:26
CGAL::Combinatorial_map
The class Combinatorial_map represents a dD combinatorial map.
Definition: Combinatorial_map.h:39