CGAL 4.13 - 3D Triangulations
|
The base cell of a Delaunay triangulation must be a model of the concept DelaunayTriangulationCellBase_3
, which refines the concept TriangulationCellBase_3
by adding in the cell an operator that computes its circumcenter.
DelaunayTriangulationTraits_3
Types | |
typedef DelaunayTriangulationTraits_3::Point_3 | Point |
Access functions | |
const Point & | circumcenter (DelaunayTriangulationTraits_3 >=DelaunayTriangulationTraits_3()) const |
Returns the circumcenter of the cell. More... | |
const Point& DelaunayTriangulationCellBase_3::circumcenter | ( | DelaunayTriangulationTraits_3 & | gt = DelaunayTriangulationTraits_3() | ) | const |
Returns the circumcenter of the cell.
DelaunayTriangulationTraits_3
is the geometric traits class of the triangulation.
This operator is required only when the dual functions are called.