#include <CGAL/Combinatorial_map.h>
#include <CGAL/Cell_attribute.h>
#include <iostream>
#include <cstdlib>
struct Myitem
{
template<class CMap>
struct Dart_wrapper
{
typedef std::tuple<void,void,Face_attribute> Attributes;
};
};
typedef CMap_3::Dart_descriptor Dart_descriptor;
typedef CMap_3::Attribute_type<2>::type Face_attribute;
struct Merge_functor
{
void operator()(Face_attribute& ca1, Face_attribute& ca2)
{
ca1.info()=ca1.info()+ca2.info();
std::cout<<"After on merge faces: info of face1="<<ca1.info()
<<", info of face2="<<ca2.info()<<std::endl;
}
};
struct Split_functor
{
Split_functor(CMap_3& amap) : mmap(amap)
{}
void operator()(Face_attribute& ca1, Face_attribute& ca2)
{
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;
};
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;
Dart_descriptor d1 = cm.make_combinatorial_hexahedron();
Dart_descriptor d2 = cm.make_combinatorial_hexahedron();
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)); }
cm.onsplit_functor<2>()=Split_functor(cm);
cm.onmerge_functor<2>()=Merge_functor();
cm.sew<3>(d1, d2);
display_map_and_2attributes(cm);
Dart_descriptor resdart=cm.insert_cell_0_in_cell_2(d2);
display_map_and_2attributes(cm);
cm.onmerge_functor<2>()=boost::function<void(Face_attribute&,
Face_attribute&)>();
cm.remove_cell<1>(resdart);
display_map_and_2attributes(cm);
return EXIT_SUCCESS;
}
The class Cell_attribute represents an attribute containing (or not) an information.
Definition: Cell_attribute.h:26
The class Combinatorial_map represents a dD combinatorial map.
Definition: Combinatorial_map.h:39