CGAL 6.1.1 - Triangulated Surface Mesh Simplification

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 Surface_mesh_simplification |
C Bounded_distance_placement |
C Bounded_normal_change_filter | The class `Bounded_normal_change_filter` is a model for the `PlacementFilter` concept
C Bounded_normal_change_placement |
C Constrained_placement | The class `Constrained_placement` is a model for the concept `GetPlacement`
C Count_ratio_stop_predicate |
C Count_stop_predicate |
C Edge_collapse_visitor_base | The class `Surface_mesh_simplification::Edge_collapse_visitor_base` provides a base class for models of the `EdgeCollapseSimplificationVisitor` concept
C Edge_count_ratio_stop_predicate |
C Edge_count_stop_predicate |
C Edge_length_cost | The class `Edge_length_cost` is a model for the `GetCost` concept, which computes the collapse cost as the squared length of the edge
C Edge_length_stop_predicate | The class `Edge_length_stop_predicate` is a model for the `StopPredicate` concept, which returns `true` when the top edge in the priority queue is larger than a certain threshold
C Edge_profile | The class `Edge_profile` regroups useful information about an edge, such as its incident vertices and faces
C Face_count_ratio_stop_predicate |
C Face_count_stop_predicate |
C GarlandHeckbert_plane_policies | The class `GarlandHeckbert_plane_policies` regroups the cost and placement policies based on the Garland-Heckbert "Classic Plane" strategy (Section Garland-Heckbert Cost and Placement Strategy)
C GarlandHeckbert_policies |
C GarlandHeckbert_probabilistic_plane_policies | The class `GarlandHeckbert_probabilistic_plane_policies` regroups the cost and placement policies based on the "Probabilistic Plane" strategy of Trettner and Kobbelt [7]
C GarlandHeckbert_probabilistic_triangle_policies | The class `GarlandHeckbert_probabilistic_triangle_policies` regroups the cost and placement policies based on the "Probabilistic Triangle" strategy of Trettner and Kobbelt [7]
C GarlandHeckbert_triangle_policies | The class `GarlandHeckbert_triangle_policies` regroups the cost and placement policies using the triangle-based Garland-Heckbert strategy (Section Garland-Heckbert Cost and Placement Strategy)
C LindstromTurk_cost | The class `LindstromTurk_cost` provides a model for the `GetCost` concept
C LindstromTurk_placement | The class `LindstromTurk_placement` provides a model for the `GetPlacement` concept
C Midpoint_placement | The class `Midpoint_placement` is a model for the `GetPlacement` concept which computes the placement as the midpoint position along the edge
C Polyhedral_envelope_filter | The class `Polyhedral_envelope_filter` is a model for the `PlacementFilter` concept
C EdgeCollapseSimplificationVisitor | The concept `EdgeCollapseSimplificationVisitor` describes the requirements for the visitor object which is used to track the edge collapse simplification algorithm
C GetCost | The concept `GetCost` describes the requirements for the policy function object which gets the collapse cost of an edge
C GetPlacement | The concept `GetPlacement` describes the requirements for the policy function object which gets the collapse placement of an edge, that is, the new position of the vertex that remains after a halfedge-collapse operation
C PlacementFilter | The concept `PlacementFilter` describes the requirements for the policy function object which gets the profile and placement of an edge and which can filter the placement. The filtering is only done when an edge is taken from the priority queue in order to get collapsed, and neither when the edge is inserted nor when it is updated in the priority queue
C StopPredicate | The concept `StopPredicate` describes the requirements for the predicate which indicates if the simplification process must finish