CGAL 4.7 - 3D Mesh Generation: Secondary Concepts

\( \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 - 3D Mesh Generation

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Secondary Concepts
3D Mesh Generation Reference

##

The concepts in this group are secondary concepts, related to the template parameters of some models of the main concept.

## Concepts

concept | BisectionGeometricTraits_3

The concept `BisectionGeometricTraits_3` describes a geometric traits class that provides the basic types and operations to implement a model of `MeshDomain_3` based solely on intersection detections. Points in the non-empty intersections are herein computed by bisection. More...

concept | IntersectionGeometricTraits_3

The concept `IntersectionGeometricTraits_3` provides types and functors required to implement a model of `MeshDomain_3`, when the domain is described by a simplicial surface mesh forming its boundary. The concept `IntersectionGeometricTraits_3` mainly provides the detection and construction of intersections between segments and triangles. More...

concept | LabeledImage_3

The concept `LabeledImage_3` describes the requirements for the second template parameter of the class `CGAL::Labeled_image_mesh_domain_3<Image,BGT>` which represents mesh domains defined by 3D labeled images. A 3D labeled image is a 3D array of elements of an integral type `Type`. `Type` can be `bool`, `char`, `short`, `int`, or `long` (signed or not). Such an array is associated to a 3D axis-aligned regular grid, in \( \mathbb{R}^3\). A cell of this grid is denoted by voxel. A voxel is an iso-cuboid of size `vx()`, `vy()`, and `vz()`. More...

concept | MeshCellBase_3

The concept `MeshCellBase_3` describes the requirements for the `Cell` type of the triangulation used in the 3D mesh generation process. The type `MeshCellBase_3` refines the concept `RegularTriangulationCellBase_3` and must be copy constructible. The concept `MeshCellBase_3` includes a way to store and retrieve if a given cell of the triangulation is inside the domain or not and which subdomain it belongs to in case of a multi-domain. More...

concept | MeshDomainField_3
| The concept `MeshDomainField_3` describes a scalar field which could be queried at any point of the space. More...
concept | MeshPolyline_3

The concept `MeshPolyline_3` implements a container of points designed to represent a polyline (i.e. a sequence of points). Types and functions provided in this concept are such as standard template library containers are natural models of this concept. More...

concept | MeshVertexBase_3

The concept `MeshVertexBase_3` describes the requirements for the `Vertex` type of the triangulation used by a 3D mesh generation process. The type `MeshVertexBase_3` refines both the concept `TriangulationVertexBase_3` and the concept `SurfaceMeshVertexBase_3`. It provides additional members to store and retrieve information about the location of the vertex with respect to the input domain describing the domain to be discretized. More specifically, the concept `MeshVertexBase_3` provides read-write access to an integer representing the dimension of the lowest dimensional face of the input 3D complex on which the vertex lies, and to an index characteristic of this face. The concept `MeshVertexBase_3` provides storage and read-write access to a boolean, a `FT` value, and two `Vertex_handle` called 'intrusive'. More...

concept | TriangleAccessor_3
| The concept `TriangleAccessor_3` represents an accessor to a triangulated polyhedral surface, intersection free and without boundaries. More...