CGAL 6.0.1 - Triangulated Surface Mesh Simplification
|
▼NCGAL | |
▼NSurface_mesh_simplification | |
CBounded_distance_placement | |
CBounded_normal_change_filter | The class Bounded_normal_change_filter is a model for the PlacementFilter concept |
CBounded_normal_change_placement | |
CConstrained_placement | The class Constrained_placement is a model for the concept GetPlacement |
CCount_ratio_stop_predicate | |
CCount_stop_predicate | |
CEdge_collapse_visitor_base | The class Surface_mesh_simplification::Edge_collapse_visitor_base provides a base class for models of the EdgeCollapseSimplificationVisitor concept |
CEdge_count_ratio_stop_predicate | |
CEdge_count_stop_predicate | |
CEdge_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 |
CEdge_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 |
CEdge_profile | The class Edge_profile regroups useful information about an edge, such as its incident vertices and faces |
CFace_count_ratio_stop_predicate | |
CFace_count_stop_predicate | |
CGarlandHeckbert_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) |
CGarlandHeckbert_policies | |
CGarlandHeckbert_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] |
CGarlandHeckbert_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] |
CGarlandHeckbert_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) |
CLindstromTurk_cost | The class LindstromTurk_cost provides a model for the GetCost concept |
CLindstromTurk_placement | The class LindstromTurk_placement provides a model for the GetPlacement concept |
CMidpoint_placement | The class Midpoint_placement is a model for the GetPlacement concept which computes the placement as the midpoint position along the edge |
CPolyhedral_envelope_filter | The class Polyhedral_envelope_filter is a model for the PlacementFilter concept |
CEdgeCollapseSimplificationVisitor | The concept EdgeCollapseSimplificationVisitor describes the requirements for the visitor object which is used to track the edge collapse simplification algorithm |
CGetCost | The concept GetCost describes the requirements for the policy function object which gets the collapse cost of an edge |
CGetPlacement | 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 |
CPlacementFilter | 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 |
CStopPredicate | The concept StopPredicate describes the requirements for the predicate which indicates if the simplification process must finish |