CGAL 4.5 - Monotone and Sorted Matrix Search
|
![]() ![]() | |
![]() ![]() ![]() | The class Dynamic_matrix is an adaptor for an arbitrary matrix class M to provide the dynamic operations needed for monotone matrix search |
![]() ![]() ![]() | The class Sorted_matrix_search_traits_adaptor can be used as an adaptor to create sorted matrix search traits classes for arbitrary feasibility test and matrix classes F resp. M |
![]() ![]() | A class BasicMatrix has to provide the following types and operations in order to be a model for BasicMatrix |
![]() ![]() | The concept MonotoneMatrixSearchTraits is a refinement of BasicMatrix and defines types and operations needed to compute the maxima for all rows of a totally monotone matrix using the function CGAL::monotone_matrix_search |
![]() ![]() | The concept SortedMatrixSearchTraits defines types and operations needed to compute the smallest entry in a set of sorted matrices that fulfills a certain feasibility criterion using the function CGAL::sorted_matrix_search |