CGAL 5.6.3 - dD Triangulations

Loading...
Searching...
No Matches
List of all members
TriangulationFullCell Concept Reference
dD Triangulations Reference » Concepts

## Definition

The concept `TriangulationFullCell` describes the requirements on the type used by the class `CGAL::Triangulation<TriangulationTraits_, TriangulationDataStructure_>`, and its derived classes, to represent a full cell.

Refines
  `TriangulationDSFullCell` We only list below the additional specific requirements of `TriangulationFullCell`

Has Models:
  `CGAL::Triangulation_full_cell<TriangulationTraits_, TriangulationDSFullCell_>`

See also
  `CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>`
  `TriangulationVertex`
  `CGAL::Triangulation<TriangulationTraits_, TriangulationDataStructure_>`

## Input/Output
These operators can be used directly and are called by the I/O operator of class `Triangulation`.
std::istream & | operator>> (std::istream &is, TriangulationFullCell &c)
| Inputs additional information stored in the full cell.
std::ostream & | operator<< (std::ostream &os, const TriangulationFullCell &c)
| Outputs additional information stored in the full cell.