CGAL 5.6.2 - Linear Cell Complex

Classes

class  CGAL::Cell_attribute_with_point< LCC, Info_, Tag, OnMerge, OnSplit >
 The class Cell_attribute_with_point represents an attribute containing a point and containing an information when Info_ is different from void. More...
 
class  CGAL::Cell_attribute_with_point_and_id< LCC, Info_, Tag, OnMerge, OnSplit >
 The class Cell_attribute_with_point_and_id represents an attribute containing a point, containing an information when Info_ is different from void, and having an id. More...
 
class  CGAL::Linear_cell_complex_for_combinatorial_map< d, d2, LCCTraits, Items, Alloc >
 The class Linear_cell_complex_for_combinatorial_map represents a linear cell complex in dimension d, in an ambient space of dimension d2, using a combinatorial map as underlying combinatorial data-structure. More...
 
class  CGAL::Linear_cell_complex_for_generalized_map< d, d2, LCCTraits, Items, Alloc >
 The class Linear_cell_complex_for_generalized_map represents a linear cell complex in dimension d, in an ambient space of dimension d2, using a generalized map as underlying combinatorial data-structure. More...
 
class  CGAL::Linear_cell_complex_incremental_builder_3< LCC >
 The auxiliary class Linear_cell_complex_incremental_builder_3 supports the incremental construction of linear cell complexes. More...
 
struct  CGAL::Linear_cell_complex_min_items
 The class Linear_cell_complex_min_items defines void as the information associated with darts, and the attributes used. More...
 
struct  CGAL::Linear_cell_complex_traits< d, K >
 This geometric traits concept is used in the Linear_cell_complex_for_combinatorial_map and Linear_cell_complex_for_generalized_map classes. More...