#include <CGAL/Triangulation_data_structure.h>
#include <vector>
#include <cassert>
int main()
{
TDS S;
assert( 7 == S.maximal_dimension() );
assert( -2 == S.current_dimension() );
assert( S.is_valid() );
std::vector<TDS::Vertex_handle> V(10);
V[0] = S.insert_increase_dimension();
assert( -1 == S.current_dimension() );
for( int i = 1; i <= 5; ++i )
V[i] = S.insert_increase_dimension(V[0]);
assert( 4 == S.current_dimension() );
assert( 6 == S.number_of_vertices() );
assert( 6 == S.number_of_full_cells() );
TDS::Full_cell_handle c = V[5]->full_cell();
V[6] = S.insert_in_full_cell(c);
assert( 7 == S.number_of_vertices() );
assert( 10 == S.number_of_full_cells() );
c = V[3]->full_cell();
TDS::Facet ft(c, 2);
V[7] = S.insert_in_facet(ft);
assert( 8 == S.number_of_vertices() );
assert( 16 == S.number_of_full_cells() );
c = V[3]->full_cell();
TDS::Face face(c);
face.set_index(0, 2);
face.set_index(1, 4);
V[8] = S.insert_in_face(face);
assert( S.is_valid() );
TDS::Full_cell_handle hole[2];
hole[0] = V[8]->full_cell();
hole[1] = hole[0]->neighbor(0);
ft = TDS::Facet(hole[0], 1);
V[9] = S.insert_in_hole(hole, hole+2, ft);
assert( S.is_valid() );
return 0;
}
This class is a data structure used for storing a triangulation of dimension (D is the maximal dimen...
Definition: Triangulation_data_structure.h:45