Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, September 03, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Helmut Alt (FU Berlin)

An Approximation Algorithm for Packing Planar Convex Objects

Efficiently packing geometric objects is a natural question with many applications, e.g., in transportation, apparel, or steel industries. Packing of regular objects, like disks , higher dimensional spheres or axis-parallel rectangles has been considered intensely in pure mathematics as well as in operations research. Since even the most simple variants of the problem are NP-hard, efficient constant factor approximations are interesting.

In the lecture, we will consider more irregular objects, namely, convex polygons in the plane. We investigate the problem of finding a minimum-area container for packing a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems we develop efficient constant factor approximation algorithms.

Joint work with Mark de Berg and Christian Knauer.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login