CGAL::is_insertable_cell_2_in_cell_3<CMap,InputIterator>

#include <CGAL/Combinatorial_map_operations.h>


template <class CMap, class InputIterator>
bool is_insertable_cell_2_in_cell_3 ( 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). The 2-cell can be inserted iff each couple of consecutive darts of the path a1 and a2 belong to the same vertex and the same volume, and if the path is closed.
Precondition: CMap::dimension≥3.

See Also

CGAL::insert_cell_2_in_cell_3<CMap,InputIterator>
CGAL::is_insertable_cell_1_in_cell_2<CMap>