CGAL 6.2 - 3D Mesh Generation

Loading...
Searching...
No Matches
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1 2 3]

▼N CGAL |
▼N Mesh_3 |
C Detect_features_in_image | Functor for feature detection in labeled images
C Detect_features_on_image_bbox | Functor for feature detection in labeled images
C Compact_mesh_cell_base_3 | The class `Compact_mesh_cell_base_3<GT, MD>` is a model of the concept `MeshCellBase_3`
C Construct_initial_points_gray_image | Functor for generating initial points in gray images
C Construct_initial_points_labeled_image | Functor for generating initial points in labeled images
C Image_3 | The class `Image_3` holds a shared pointer to a 3D image buffer
C Implicit_multi_domain_to_labeling_function_wrapper | The class `Implicit_multi_domain_to_labeling_function_wrapper` is a helper class to get a function with integer values labeling the components of a multidomain
C Implicit_to_labeling_function_wrapper | This class is designed to wrap an implicit function which describes a domain by [p is inside if f(p)<0] to a function which takes its values into {0,1}
C Labeled_mesh_domain_3 | The class `Labeled_mesh_domain_3` implements indexed domains
C Mesh_cell_base_3 | The class `Mesh_cell_base_3<GT, MD, Cb>` is a model of the concept `MeshCellBase_3`
C Mesh_cell_criteria_3 | The class `Mesh_cell_criteria_3` is a model of `MeshCellCriteria_3`
C Mesh_constant_domain_field_3 | The class `Mesh_constant_domain_field_3` is a model of concept `MeshDomainField_3`
C Mesh_criteria_3 | The class gathers the refinement criteria for mesh tetrahedra and surface facets where surface facets are facets in the mesh approximating the domain surface patches
C Mesh_domain_with_polyline_features_3 | The class `Mesh_domain_with_polyline_features_3` enables the user to add some 0- and 1-dimensional features into any model of the `MeshDomain_3` concept
C Mesh_edge_criteria_3 | The function object class `Mesh_edge_criteria_3` is a model of `MeshEdgeCriteria_3`
C Mesh_facet_criteria_3 | The class `Mesh_facet_criteria_3` is a model of `MeshFacetCriteria_3`
C Mesh_polyhedron_3 | The class `Mesh_polyhedron_3` provides a customized `Polyhedron_3` type
C Mesh_triangulation_3 | The class `Mesh_triangulation_3` is a class template which provides the triangulation type to be used for the 3D triangulation embedding the mesh
C Mesh_vertex_base_3 | The class `Mesh_vertex_base_3` is a model of the concept `MeshVertexBase_3`
C Polyhedral_complex_mesh_domain_3 | The class `Polyhedral_complex_mesh_domain_3` implements a domain defined by a collection of polyhedral surfaces, forming a complex
▼C Polyhedral_mesh_domain_3 | The class `Polyhedral_mesh_domain_3` implements a domain defined by a simplicial polyhedral surface
C Construct_initial_points | Constructs a set of `n` points on the surface, and output them to the output iterator `pts` whose value type is required to be `std::pair<Point_3, Index>`
C Construct_intersection | Returns a point in the intersection of the primitive `type` with some boundary surface
C Do_intersect_surface | Returns `true` if the element `type` intersects properly any of the surface patches describing either the domain boundary or some subdomain boundary
C Is_in_domain | Returns true if point `p` is in the domain
C Polyhedral_mesh_domain_with_features_3 | The class `Polyhedral_mesh_domain_with_features_3` implements a domain whose boundary is a simplicial polyhedral surface
C Sizing_field_with_aabb_tree | The class `Sizing_field_with_aabb_tree` is a model of concept `MeshDomainField_3`
C 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
C InitialPointsGenerator_3 | The function object concept `InitialPointsGenerator_3` is designed to construct a set of initial points on the surface of the domain
C 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
C 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 concepts `SimplicialMeshCellBase_3` and `RegularTriangulationCellBaseWithWeightedCircumcenter_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
C MeshCellCriteria_3 | The Delaunay refinement process involved in the template functions `CGAL::make_mesh_3()` and `CGAL::refine_mesh_3()` is guided by a set of elementary refinement criteria that concern either mesh tetrahedra or surface facets. The concept `MeshCellCriteria_3` describes the types that handle the refinement criteria for mesh tetrahedra
C MeshCriteria_3 | The Delaunay refinement process involved in the template functions `CGAL::make_mesh_3()` and `CGAL::refine_mesh_3()` is guided by a set of elementary refinement criteria that concern either mesh tetrahedra or surface facets. The refinement criteria for tetrahedra are described through the concept `MeshCellCriteria_3` while the refinement criteria for surface facets are described by the concept `MeshFacetCriteria_3`. The concept `MeshCriteria_3` encapsulates these concepts
C MeshCriteriaWithFeatures_3 | The concept `MeshCriteriaWithFeatures_3` refines the concept `MeshCriteria_3`. The concept `MeshCriteria_3` encapsulates the concepts `MeshCellCriteria_3` and `MeshFacetCriteria_3` describing the refinement criteria for, respectively, mesh cells and surface facets. For domains with features, the concept `MeshCriteriaWithFeatures_3` additionally encapsulates the concept `MeshEdgeCriteria_3`, that describes the requirements, in terms of sizing, for the discretization of the domain \( 1\)-dimensional features
C MeshDomain_3 | The concept `MeshDomain_3` describes the knowledge required on the object to be discretized. The concept `MeshDomain_3` is the concept to be used when the input domain does not have \( 0\) or \( 1\)-dimensional features that need to be accurately approximated by the mesh. In such a case, the queries issued by the meshing process concern only the faces of the input domain with dimension \( 3\) and \( 2\), that are respectively called subdomains and surface patches
C MeshDomainField_3 | The concept `MeshDomainField_3` describes a scalar field which could be queried at any point of the space
C MeshDomainWithFeatures_3 | The concept `MeshDomainWithFeatures_3` refines the concept `MeshDomain_3`. While the concept `MeshDomain_3` only exposes the 2-dimensional and 3-dimensional features of the domain through different queries, the concept `MeshDomainWithFeatures_3` also exposes 0 and 1-dimensional features. The exposed features of the domain are respectively called subdomains, surface patches, curves and corners according to their respective dimensions 3, 2, 1, and 0
C MeshEdgeCriteria_3 | The function object concept `MeshEdgeCriteria_3` is designed to drive the process which samples the 1-dimensional features of the domain. It provides an upper bound for the distance between two protecting ball centers that are consecutive on a 1-feature
C MeshFacetCriteria_3 | The Delaunay refinement process involved in the template functions `CGAL::make_mesh_3()` and `CGAL::refine_mesh_3()` is guided by a set of elementary refinement criteria that concern either mesh tetrahedra or surface facets. The concept `MeshFacetCriteria_3` describes the types that handle the refinement criteria for surface facets
C 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
C MeshTriangulationTraits_3 | The concept `MeshTriangulationTraits_3` describes the requirements for the geometric traits class of the underlying regular triangulation used during a mesh generation process
C 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 the concepts `RegularTriangulationVertexBase_3`, `SimplicialMeshVertexBase_3`, and `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'