The concept TriangulatedSurfaceMesh describes an oriented surface (possibly with boundary) embedded in the 3 space. It is combinatorially based on a halfedge data structure with triangular faces, geometrically 3d points associated to the vertices define the embedding.
| |
geometric Traits, this is a CGAL::Kernel concept.
| |
| |
Opaque type representing a facet of the TriangulatedSurfaceMesh .
| |
| |
Handle to a facet. Model of the Handle concept.
| |
| |
| |
Iterator over all mesh facets. Model of the ForwardIterator concept.
| |
| |
| |
Opaque type representing a vertex of the TriangulatedSurfaceMesh .
| |
| |
Handle to a vertex. Model of the Handle concept.
| |
| |
| |
Iterator over all vertices of a mesh. Model of the ForwardIterator concept.
| |
| |
| |
Opaque type representing a halfedge of the TriangulatedSurfaceMesh .
| |
| |
Handle to a halfedge. Model of the Handle concept.
| |
| |
| |
Iterator over all halfedges of a TriangulatedSurfaceMesh . Model of the ForwardIterator concept.
| |
| |
| |
Iterator over all points of a TriangulatedSurfaceMesh , its value type is Traits::Point_3. Model of the ForwardIterator concept.
| |
|
Construction and destruction are undefined.
Methods for the Vertex :
|
| The point associated to the vertex |
Methods for the Halfedge :
|
| the opposite halfedge. |
|
| the next halfedge around the facet. |
|
| the previous halfedge around the facet. |
|
| is true if halfedge or halfedge.opposite() is a border halfedge. |
|
| the incident vertex of halfedge. |
|
| the incident facet of halfedge. If halfedge is a border halfedge the result is default construction of the handle. |
Methods for the Facet :
|
| an incident halfedge that points to facet. |
CGAL::Polyhedron_3 with the restriction that faces are triangular.