Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Efficient implementation of constraint reduction for convex polytopes


Thomas Jericke

Semester/Bachelor Thesis, SS 06

This semester work is about the implementation of the reduction of polytope representation as a C++ function. The goal of the implementation is to have an optimal speed performance, hence the use of C/C++ as programming language. The function is then called by Matlab, therefore it is implemented as a Matlab MEX-function written in C++. For the matrix calculations the linear algebra package lapackpp [1] is used. To solve linear programs the libcdd [2] package is used. For quick-hull computation the qhull [3] library is used. Supervisors: M. Baric, Dr. C. Jones, Prof. M. Morari


Type of Publication:

(13)Semester/Bachelor Thesis

M. Morari

No Files for download available.
% Autogenerated BibTeX entry
@PhdThesis { Xxx:2006:IFA_2824
Permanent link