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 1234]
▼NCGAL | |
▼NShape_regularization | |
▼NContours | |
CLongest_direction_2 | Estimates the longest principal direction of the contour |
CMultiple_directions_2 | Estimates possibly multiple principal directions of the contour based on the user-specified minimum length and maximum angle bounds |
CUser_defined_directions_2 | Sets multiple user-specified principal directions of the contour |
▼NSegments | |
CAngle_regularization_2 | An angle-based regularization type for 2D segments that reinforces parallelism and orthogonality relationships |
CDelaunay_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 |
COffset_regularization_2 | An offset-based regularization type for 2D segments that reinforces collinearity relationships |
CContourDirections | 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 |
CNeighborQuery | A concept that describes the set of methods used by the class QP_regularization to access neighbors of a geometric object being regularized |
CQP_regularization | Shape regularization algorithm based on the quadratic programming global optimization |
CRegularizationType | 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 |