Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, June 12, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Bernd Gärtner
Release 3.3 of CGAL, the Computational Geometry Algorithms library, contains a solver for linear and convex quadratic programs. Originally motivated by (and tuned for) applications in low-dimensional geometric optimization, the solver is now also useful as a general-purpose tool for medium-sized problems. The solution is computed in exact rational arithmetic, and it comes with certificates that make it easy to verify the correctness of the output.
After a brief advertisement of CGAL, its philosophy and its functionality, I describe the (simplex-type) algorithm behind the solver. Then I present a simple example of its usage. I conclude with a few benchmarks and a discussion about when (and when not) it might be beneficial for you to use the CGAL solver.
Joint work with Kaspar Fischer, Sven Schönherr, and Frans Wessendorp.
Automatic MiSe System Software Version 1.4803M | admin login