Deprecated List

Class CGAL::Combinatorial_map< d, Items, Alloc >

Before CGAL 4.9, Items had to define the type of dart used, and the default class was Combinatorial_map_min_items. This is now deprecated, the Dart type is no more defined in the item class, but replaced by the Dart_info type. CGAL_CMAP_DART_DEPRECATED can be defined to keep the old behavior.

Class CGAL::Combinatorial_map_min_items< d >

This class is deprecated since CGAL 4.9. Users are required to use class Generic_map_min_items instead, where the Dart type is no more defined, but replaced by the Dart_info type. CGAL_CMAP_DART_DEPRECATED can be defined to keep the old behavior.

Class CGAL::Dart< d, CMap >

This class is deprecated since CGAL 4.9. Dart is now a type defined internally; users can now only define the information associated with darts. All functions defined in this class are now defined as methods of a combinatorial map taking a Dart_handle as first parameter. CGAL_CMAP_DART_DEPRECATED can be defined to keep the old behavior.

Member CGAL::insert_cell_0_in_cell_1 (CMap &cm, typename CMap::Dart_handle dh)

Inserts a 0-cell in the 1-cell containing dh.

Member CGAL::insert_cell_0_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh)

Inserts a 0-cell in the 2-cell containing dh.

Member CGAL::insert_cell_1_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh1, typename CMap::Dart_handle dh2)

Inserts a 1-cell in the 2-cell containing dh1 and dh2.

Member CGAL::insert_cell_2_in_cell_3 (CMap &cm, InputIterator afirst, InputIterator alast)

Inserts a 2-cell along the path of 1-cells containing darts given by the range [afirst,alast).

Member CGAL::insert_dangling_cell_1_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh)

Inserts a 1-cell in a the 2-cell containing dh, the 1-cell being attached only by one of its extremity to the 0-cell containing dh.

Member CGAL::is_insertable_cell_1_in_cell_2 (const CMap &cm, typename CMap::Dart_const_handle dh1, typename CMap::Dart_const_handle dh2)

Returns true iff it is possible to insert a 1-cell in cm between dh1 and dh2.

Member CGAL::is_insertable_cell_2_in_cell_3 (const CMap &cm, InputIterator afirst, InputIterator alast)

Returns true iff it is possible to insert a 2-cell in cm along the path of darts given by the range [afirst,alast).

Member CGAL::is_removable (const CMap &cm, typename CMap::Dart_const_handle dh)

Returns true iff the i-cell containing dh can be removed.

Member CGAL::make_combinatorial_hexahedron (CMap &cm)

Creates a combinatorial hexahedron.

Member CGAL::make_combinatorial_polygon (CMap &cm, unsigned int lg)

Creates a combinatorial polygon of length lg.

Member CGAL::make_combinatorial_tetrahedron (CMap &cm)

Creates a combinatorial tetrahedron.

Member CGAL::make_edge (CMap &cm)

Creates an isolated edge.

Member CGAL::remove_cell (CMap &cm, typename CMap::Dart_handle dh)

Removes the i-cell containing dh.