|
CGAL 4.7 - 3D Surface Mesh Generation
|
|
CGAL 4.7 - 3D Surface Mesh Generation
|
Concepts | |
| concept | ImplicitFunction |
The concept ImplicitFunction describes a function object whose operator() computes the values of a function \( f : \mathbb{R}^3 \longrightarrow \mathbb{R}\). More... | |
| concept | ImplicitSurfaceTraits_3 |
The concept ImplicitSurfaceTraits_3 describes the requirements of the traits class to be plugged as Traits in CGAL::Implicit_surface_3<Traits, Function>. More... | |
| concept | Surface_3 |
The concept Surface_3 describes the types of surfaces to be meshed. The surface types are required to be copy constructible and assignable. More... | |
| concept | SurfaceMeshCellBase_3 |
The concept SurfaceMeshCellBase_3 describes the cell base type of the three dimensional triangulation used to embed the surface mesh. More... | |
| concept | SurfaceMeshComplex_2InTriangulation_3 |
The concept SurfaceMeshComplex_2InTriangulation_3 describes a data structure designed to represent a two dimensional pure complex embedded in a three dimensional triangulation. More... | |
| concept | SurfaceMeshFacetsCriteria_3 |
The Delaunay refinement process involved in the function template CGAL::make_surface_mesh() is guided by a set of refinement criteria. The concept SurfaceMeshFacetsCriteria_3 describes the type which handles those criteria. It corresponds to the requirements for the template parameter FacetsCriteria of the surface mesher function CGAL::make_surface_mesh<SurfaceMeshC2T3,Surface,FacetsCriteria,Tag>(). More... | |
| concept | SurfaceMeshTraits_3 |
The concept SurfaceMeshTraits_3 describes the knowledge that is required on the surface to be meshed. A model of this concept implements an oracle that is able to tell whether a segment (or a ray, or a line) intersects the surface or not, and to compute some intersection points if any exists. The concept SurfaceMeshTraits_3 also includes a funcctor able to provide a small set of initial points on the surface. More... | |
| concept | SurfaceMeshTriangulation_3 |
The concept SurfaceMeshTriangulation_3 describes the triangulation type used by the surface mesher CGAL::make_surface_mesh() to represent the three dimensional triangulation embedding the surface mesh. Thus, this concept describes the requirements for the triangulation type SurfaceMeshC2T3::Triangulation nested in the model of SurfaceMeshComplex_2InTriangulation_3 plugged as the template parameter SurfaceMeshC2T3 of CGAL::make_surface_mesh(). It also describes the requirements for the triangulation type plugged in the class CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>. More... | |
| concept | SurfaceMeshVertexBase_3 |
The concept SurfaceMeshVertexBase_3 describes the vertex base type of the three dimensional triangulation used to embed the surface mesh. More... | |
An iterator type to visit the boundary edges of the 2D complex.
| typedef Triangulation::Cell_handle SurfaceMeshComplex_2InTriangulation_3::Cell_handle |
The type of the embedding triangulation cell handles.
| typedef Triangulation::Edge SurfaceMeshComplex_2InTriangulation_3::Edge |
The type of the embedding triangulation edges.
An iterator type to visit the edges of the 2D complex.
| typedef Triangulation::Facet SurfaceMeshComplex_2InTriangulation_3::Facet |
The type of the embedding triangulation facets.
An iterator type to visit the facets of the 2D complex.
| typedef Triangulation::size_type SurfaceMeshComplex_2InTriangulation_3::size_type |
Size type (an unsigned integral type)
The type of the embedding 3D triangulation.
Must be a model of SurfaceMeshTriangulation_3.
| typedef Triangulation::Vertex_handle SurfaceMeshComplex_2InTriangulation_3::Vertex_handle |
The type of the embedding triangulation vertex handles.
An iterator type to visit vertices of the 2D complex.
A type to describe the status of a face (facet, edge, or vertex) with respect to the 2D pure complex.
A NOT_IN_COMPLEX face does not belong to the 2D complex. Facets can only be NOT_IN_COMPLEX or REGULAR depending on whether they belong to the 2D complex on not. Edges and vertices can be NOT_IN_COMPLEX, BOUNDARY, REGULAR or SINGULAR. An edge in the complex is BOUNDARY, REGULAR, or SINGULAR, if it is incident to respectively 1, 2, or 3 or more facets in the complex. The status of a vertex is determined by the adjacency graph of the facets of the 2D complex incident to that vertex. The vertex of the 2D complex is BOUNDARY, if this adjacency graph is a simple path, it is REGULAR, if the adjacency graph is cyclic, and SINGULAR in any other case.
| Enumerator | |
|---|---|
| NOT_IN_COMPLEX | |
| BOUNDARY | |
| REGULAR | |
| SINGULAR | |
1.8.8