Kaspar Fischer, Bernd Gärtner, Sven Schönherr, and Frans Wessendorp
This package contains algorithms for minimizing linear and convex quadratic functions
over polyhedral domains, described by linear equations and inequalities. The
algorithms are exact, i.e. the solution is computed in terms of multiprecision rational
numbers. The resulting solution is certified: along with the claims that the problem under
consideration has an optimal solution, is infeasible, or is unbounded, the algorithms
also deliver proofs for these facts. These proofs can easily (and independently from the
algorithms) be checked for correctness. The solution algorithms are based on a
generalization of the simplex method to quadratic objective functions.
User Manual Reference Manual
Introduced in:
CGAL 3.3
BibTeX:
cgal:fgsw-lqps-16a
License:
GPL
Geometry Kernels
2D and 3D Linear Geometry Kernel
Hervé Brönnimann, Andreas Fabri, Geert-Jan Giezeman, Susan Hert, Michael
Hoffmann, Lutz Kettner, Sylvain Pion, and Stefan Schirra
This package contains kernels each containing objects of constant size, such as point,
vector, direction, line, ray, segment, circle as well as predicates and constructions for
these objects. The kernels mainly differ in the way they handle robustness issues.
User Manual Reference Manual
Introduced in:
CGAL 0.9
BibTeX:
cgal:bfghhkps-lgk23-16a
License:
LGPL
dD Geometry Kernel