|
CGAL 6.0 - Polygon Mesh Processing
|
| ▼NCGAL | |
| ▼NPolygon_mesh_processing | |
| ▼NAutorefinement | |
| CDefault_visitor | |
| ▼NCorefinement | |
| CDefault_visitor | |
| CNon_manifold_output_visitor | |
| ▼NHole_filling | |
| CDefault_visitor | Default hole filling visitor model of PMPHolefillingVisitor |
| ▼NTriangulate_faces | |
| CDefault_visitor | Default new face visitor model of PMPTriangulateFaceVisitor |
| ▼NTriangulate_polygons | |
| CDefault_visitor | Default new polygon visitor model of PMPTriangulateFaceVisitor |
| CAdaptive_sizing_field | Sizing field describing variable target mesh edge lengths for CGAL::Polygon_mesh_processing::isotropic_remeshing() |
| CDefault_orientation_visitor | Default visitor model of PMPPolygonSoupOrientationVisitor |
| CPrincipal_curvatures_and_directions | Struct for storing principal curvatures and directions |
| CUniform_sizing_field | Sizing field describing a uniform target edge length for CGAL::Polygon_mesh_processing::isotropic_remeshing() |
| CPolygon_mesh_slicer | Function object that computes the intersection of a plane with a triangulated surface mesh |
| CPolyhedral_envelope | This class can be used to check if a query point, segment, or triangle is inside or outside a polyhedral envelope of a set of triangles, constructed for a given \( \epsilon \) distance tolerance |
| CRigid_triangle_mesh_collision_detection | This class provides methods to perform some intersection tests between triangle meshes that undergo affine transformations (rotation, translation, and scaling) |
| CSide_of_triangle_mesh | This class provides an efficient point location functionality with respect to a domain bounded by one or several disjoint closed triangle meshes |
| CPMPAutorefinementVisitor | The concept PMPAutorefinementVisitor defines the requirements for the visitor used in CGAL::Polygon_mesh_processing::autorefine_triangle_soup() to track the creation of new triangles |
| CPMPCorefinementVisitor | The concept PMPCorefinementVisitor defines the requirements for the visitor used in corefinement-related functions to track the creation of new faces and new edges |
| CPMPDistanceTraits | The concept PMPDistanceTraits is a refinement of the concepts AABBGeomTraits_3 and SpatialSortingTraits_3. In addition to the types required by those concepts, it also requires types and functors needed by the functions approximate_max_distance_to_point_set(), sample_triangle_mesh(), approximate_Hausdorff_distance() and max_distance_to_triangle_mesh() |
| CPMPHolefillingVisitor | The concept PMPHolefillingVisitor defines the requirements for the visitor used in hole-filling-related functions . The hole filling may use a 2D constrained triangulation for almost planar holes (planar phase). If that is not appropriate or fails it may use an algorithm with a quadratic running time relying on the 3D Delaunay triangulation (quadratic phase). If that fails, it uses an algorithm with cubic running time (cubic phase) |
| CPMPPolygonSoupOrientationVisitor | The concept PMPPolygonSoupOrientationVisitor defines the requirements for the visitor used in CGAL::Polygon_mesh_processing::orient_polygon_soup() to track the detection of non-manifold simplices and the modifications performed to polygons during the orientation process |
| CPMPSelfIntersectionTraits | Geometric traits concept for the functions CGAL::self_intersections() and CGAL::does_self_intersect() |
| CPMPSizingField | The concept PMPSizingField defines the requirements for the sizing field used in CGAL::Polygon_mesh_processing::isotropic_remeshing() to define the target length for every individual edge during the remeshing process |
| CPMPTriangulateFaceVisitor | The concept PMPTriangulateFaceVisitor defines the requirements for the visitor used in triangulation-related functions to track the creation of new faces |