EF1 – Extracting Dynamical Laws from Complex Data



Approximate Convex Hulls With Bounded Complexity

Project Heads

Michael Joswig, Klaus-Robert Müller

Project Members

Marek Kaluba (TU) 

Project Duration

01.01.2019 – 31.12.2020

Located at

TU Berlin


For a given finite point set Tin Rdwe investigate methods to describe the convex hull conv(T) approximately by choosing another point set U subset Rdsuch that the resulting polytope P = conv(U) is sufficiently close. As an additional constraint we wish to bound the combinatorial complexity of P, e.g., given in terms of the total number of faces. This is motivated, e.g., by classification problems from machine learning.

Project Webpages

Selected Publications

Selected Pictures

Please insert any kind of pictures (photos, diagramms, simulations, graphics) related to the project in the above right field (Image with Text), by choosing the green plus image on top of the text editor. (You will be directed to the media library where you can add new files.)
(We need pictures for a lot of purposes in different contexts, like posters, scientific reports, flyers, website,…
Please upload pictures that might be just nice to look at, illustrate, explain or summarize your work.)

As Title in the above form please add a copyright.

And please give a short description of the picture and the context in the above textbox.

Don’t forget to press the “Save changes” button at the bottom of the box.

If you want to add more pictures, please use the “clone”-button at the right top of the above grey box.