CGAL 6.1.2 - Combinatorial Maps: Combinatorial_map/map_3_index.cpp

CGAL 6.1.2 - Combinatorial Maps

Loading...
Searching...
No Matches
Combinatorial_map/map_3_index.cpp
#include <CGAL/Combinatorial_map.h>
#include <CGAL/Cell_attribute.h>
#include <vector>
#include <algorithm>
#include <string>
#include <cstdlib>
struct Myitem
{
using Use_index=CGAL::Tag_true; // use indices
using Index_type=std::uint16_t; // 16 bits
template<class CMap>
struct Dart_wrapper
{
typedef CGAL::Cell_attribute<CMap> Vol_attrib;
typedef std::tuple<void,void,void,Vol_attrib> Attributes;
};
};
using CMap_3=CGAL::Combinatorial_map<3,Myitem>;
using Dart_descriptor=CMap_3::Dart_descriptor;
int main()
{
CMap_3 cm;
// Create 2 hexahedra.
Dart_descriptor d1=cm.make_combinatorial_hexahedron();
Dart_descriptor d2=cm.make_combinatorial_hexahedron();
cm.sew<3>(d1, d2); // 3-Sew the two hexahedra along one facet.
// Create two 3-attributes and associated them to darts.
cm.set_attribute<3>(d1, cm.create_attribute<3>());
cm.set_attribute<3>(d2, cm.create_attribute<3>());
// Associate a vector of size_t to darts
std::vector<std::size_t> array_for_darts(cm.upper_bound_on_dart_ids());
std::generate(array_for_darts.begin(), array_for_darts.end(), std::rand);
// Associate a vector of string to 3-attributes
std::vector<std::string> array_for_vols(cm.upper_bound_on_attribute_ids<3>());
std::size_t i=0;
for(auto& e: array_for_vols)
{ e="vol"+std::to_string(i++); }
std::cout<<"Value in array for darts d1 and d2: "
<<array_for_darts[d1]<<" and "<<array_for_darts[d2]<<std::endl;
std::cout<<"Value in array for volumes of dart d1 and d2: "
<<array_for_vols[cm.attribute<3>(d1)]<<" and "
<<array_for_vols[cm.attribute<3>(d2)]<<std::endl;
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
CGAL::Tag_true
CGAL::Boolean_tag< true > Tag_true