Guillaume Damiand
This package implements linear cell complexes, objects in d-dimension with linear geometry. The combinatorial part of objects is described either by a combinatorial or a generalized map, representing all the cells of the object plus the incidence and adjacency relations between cells. Geometry is added to the combinatorial data-structure simply by associating a point to each vertex of the map. Taking a 2D combinatorial map, and using 3D points, gives a linear cell complex equivalent to a Polyhedron_3.
Concepts
Classes
CGAL::Linear_cell_complex_for_combinatorial_map<d,d2,LCCTraits,Items,Alloc>
CGAL::Linear_cell_complex_for_generalized_map<d,d2,LCCTraits,Items,Alloc>
CGAL::Linear_cell_complex_min_items<d>
CGAL::Linear_cell_complex_traits<d,K>
CGAL::Cell_attribute_with_point<LCC,Info_,Tag,OnMerge,OnSplit>
CGAL::Cell_attribute_with_point_and_id<LCC,Info_,Tag,OnMerge,OnSplit>
CGAL::Linear_cell_complex_incremental_builder_3<LCC>
Global Functions
Constructions for Linear Cell Complex
Operations for Linear Cell Complex
Draw a Linear Cell Complex