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
使用者手冊英文連結：
API參考手冊英文連線：
-
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
使用者手冊英文連結：
API參考手冊英文連線：