CGAL 6.1 - Combinatorial Maps

Loading...
Searching...
No Matches
Combinatorial_map/map_3_simple_example.cpp
#include <CGAL/Combinatorial_map.h>
#include <iostream>
#include <cstdlib>
typedef CGAL::Combinatorial_map<3> CMap_3;
typedef CMap_3::Dart_const_descriptor Dart_const_descriptor;
int main()
{
CMap_3 cm;
// Create two tetrahedra.
Dart_const_descriptor d1 = cm.make_combinatorial_tetrahedron();
Dart_const_descriptor d2 = cm.make_combinatorial_tetrahedron();
// Display the combinatorial map characteristics.
cm.display_characteristics(std::cout);
std::cout<<", valid="<<cm.is_valid()<<std::endl;
unsigned int res = 0;
// Iterate over all the darts of the first tetrahedron.
// Note that CMap_3::Dart_of_orbit_range<1,2> in 3D is equivalent to
// CMap_3::Dart_of_cell_range<3>.
for (CMap_3::Dart_of_orbit_range<1,2>::const_iterator
it(cm.darts_of_orbit<1,2>(d1).begin()),
itend(cm.darts_of_orbit<1,2>(d1).end()); it!=itend; ++it)
++res;
std::cout<<"Number of darts of the first tetrahedron: "<<res<<std::endl;
res = 0;
// Iterate over all the darts of the facet containing d2.
for (CMap_3::Dart_of_orbit_range<1>::const_iterator
it(cm.darts_of_orbit<1>(d2).begin()),
itend(cm.darts_of_orbit<1>(d2).end()); it!=itend; ++it)
++res;
std::cout<<"Number of darts of the facet containing d2: "<<res<<std::endl;
return EXIT_SUCCESS;
}
CGAL::Combinatorial_map
The class Combinatorial_map represents a dD combinatorial map.
Definition: Combinatorial_map.h:39