![]() |
#include <CGAL/Combinatorial_map.h>
The class Combinatorial_map<d,CMItems,Alloc> represents a dD combinatorial map.
Darts and non void attributes are stored in memory using CGAL::Compact_container, using Alloc as allocator.
There are two default template arguments: Combinatorial_map_min_items<d> for CMItems and CGAL_ALLOCATOR(int) from the <CGAL/memory.h> header file for Alloc.
typedef Combinatorial_map<d,CMItems,Alloc> | ||
Self; | ||
typedef CMItems::Dart_wrapper<Self>::Dart | ||
Dart; |
The complexity of sew and unsew is in O(|S|×|c|), S being the set of darts of the orbit 〈β1,…,βi-2,βi+2,…,βd〉 for the considered dart, and c the biggest j-cell merged or split during the sew such that j-attributes are non void. The complexity of is_sewable is in O(|S|).
The complexity of set_attribute is in O(|c|), c being the i-cell containing the considered dart.
The complexity of is_without_boundary(unsigned int i) is in O(|D|), D being the set of darts of the combinatorial map, and the complexity of is_without_boundary() is in O(|D|×d).
The complexity of unmark_all and free_mark is in O(1) if all the darts of the combinatorial map have the same mark, and in O(|D|) otherwise.
The complexity of is_valid is in O(|D|×d2).
The complexity of clear is in O(|D|×d).
Other methods have all a constant time complexity.