CGAL 4.7 - dD Triangulations: TriangulationVertex Concept Reference

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - dD Triangulations

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
TriangulationVertex Concept Reference
Concepts

## Definition

The concept `TriangulationVertex` describes the requirements on the type used by the class `Triangulation<TriangulationTraits, TriangulationDataStructure>`, and its derived classes, to represent a vertex.

Refines:
  TriangulationDSVertex We only list below the additional specific requirements of TriangulationVertex. Compared to TriangulationDSVertex, the main difference is the addition of an association of the vertex with a geometric point.

Has Models:
  CGAL::Triangulation_vertex<TriangulationTraits, Data, TriangulationDSVertex>

## Input/Output

These operators can be used directly and are called by the I/O operator of class `Triangulation`.

See Also
  `Triangulation_vertex<TriangulationTraits, Data, TriangulationDSVertex>`
  `TriangulationFullCell`
  `Triangulation<TriangulationTraits, TriangulationDataStructure>`

## Types

typedef unspecified_type | Point
| The type of the point stored in the vertex. More...

## Creation

| TriangulationVertex (Full_cell_handle c, const Point &p)
| Constructs a vertex with incident full cell `c`. More...
| TriangulationVertex (const Point &p)
| Same as above, but without incident full cell.
| TriangulationVertex ()
| Same as above, but with a default-constructed `Point`.

## Operations

void | set_point (const Point &p)
| The parameter `p` becomes the new geometrical position of the vertex.
const Point & | point () const
| Returns the vertex's position.
std::istream & | operator>> (std::istream &is, TriangulationVertex &v)
| Inputs the non-combinatorial information given by the vertex, i.e., the point and other possible information.
std::ostream & | operator<< (std::ostream &os, const TriangulationVertex &v)
| Outputs the non-combinatorial information given by the vertex, i.e., the point and other possible information.

## Member Typedef Documentation

typedef unspecified_type TriangulationVertex::Point

The type of the point stored in the vertex.

It must be the same as the point type `TriangulationTraits::Point` (or its refined concepts) when the `TriangulationVertex` is used in the class `Triangulation<TriangulationTraits, TriangulationDataStructure>` (or its derived classes).

## Constructor & Destructor Documentation

TriangulationVertex::TriangulationVertex | ( | Full_cell_handle | c,
|  | const Point & | p
| ) |  |

Constructs a vertex with incident full cell `c`.

The vertex is embedded at point `p`.