CGAL 4.10 官方文档软件包概述 ——组合算法类

Combinatorial Algorithms 组合算法类

•  Monotone and Sorted Matrix Search 单调排序矩阵搜索

 

作者：Michael Hoffmann

 

简介：This package provides a matrix search framework, which is theunderlying technique for the computation of all furthest neighbors for thevertices of a convex polygon, maximal k-gons inscribed into a planar point set,and computing rectangular p-centers.

这个包提供了矩阵搜索的框架，该框架是凸多边形顶点最远邻、平面点集中的最大内接K变形以及矩形P中心计算的底层技术。

 

Introduced in 引入版本: CGAL1.1
BibTeX 文献排版: cgal:h-msms-17a
License 版权许可: GPL

 

用户手册英文链接：

https://doc.cgal.org/latest/Matrix_search/index.html#Chapter_Monotone_and_Sorted_Matrix_Search

 

API参考手册英文连接：

https://doc.cgal.org/latest/Matrix_search/group__PkgMatrixSearch.html

 

• Linear and Quadratic Programming Solver 线性和二次规划求解器

作者：Kaspar Fischer, Bernd Gärtner, Sven Schönherr, Frans Wessendorp

 

简介：This package contains algorithms for minimizing linear and convexquadratic functions over polyhedral domains, described by linear equations andinequalities. The algorithms are exact, i.e. the solution is computed in termsof multiprecision rational numbers. The resulting solution is certified: alongwith the claims that the problem under consideration has an optimal solution,is infeasible, or is unbounded, the algorithms also deliver proofs for thesefacts. These proofs can easily (and independently from the algorithms) bechecked for correctness. The solution algorithms are based on a generalizationof the simplex method to quadratic objective functions.

这个包包括最小化多面体域上线性和凸二次函数的算法，这些算法由线性方程组和不等式描述。这些算法是精确的，也就是说，答案以多精度有理数的方式计算。所得到的结果是经过验证的：声明所考虑的问题有最优解、不可行或者无解，这些算法还会予以证明。这些证明的正确性能过很容易地被验证（并且独立于算法）。这些求解算法基于单纯形法到二次目标函数的推广。

 

Introduced in 引入版本: CGAL3.3
BibTeX 文献排版: cgal:fgsw-lqps-17a
License 版权许可: GPL

 

用户手册英文链接：

https://doc.cgal.org/latest/QP_solver/index.html#Chapter_Linear_and_Quadratic_Programming_Solver

 

API参考手册英文连接：

https://doc.cgal.org/latest/QP_solver/group__PkgQPSolver.html