CGAL 6.1 - Shape Regularization

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 4]

▼N CGAL |
▼N Shape_regularization |
▼N Contours |
C Longest_direction_2 | Estimates the longest principal direction of the contour
C Multiple_directions_2 | Estimates possibly multiple principal directions of the contour based on the user-specified minimum length and maximum angle bounds
C User_defined_directions_2 | Sets multiple user-specified principal directions of the contour
▼N Segments |
C Angle_regularization_2 | An angle-based regularization type for 2D segments that reinforces parallelism and orthogonality relationships
C Delaunay_neighbor_query_2 | A neighbor query based on a Delaunay triangulation, which enables to find the nearest neighbors in a set of `GeomTraits::Segment_2`
C Offset_regularization_2 | An offset-based regularization type for 2D segments that reinforces collinearity relationships
C ContourDirections | We assume that each contour has one or several principal directions. By implementing a model of this concept, the user sets such directions and provides a way to orient contour edges towards these directions. All contour regularization functions in this package are parameterized by this concept
C NeighborQuery | A concept that describes the set of methods used by the class `QP_regularization` to access neighbors of a geometric object being regularized
C QP_regularization | Shape regularization algorithm based on the quadratic programming global optimization
C RegularizationType | A concept that describes the set of methods used by the class `QP_regularization` to access various data required for setting up the the global regularization problem