Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
| Mittagsseminar Talk Information |
Date and Time: Thursday, May 08, 2025, 12:15 pm
Duration: 30 minutes
Location: OAT S15
Speaker: Bernd Gärtner
We are given a number of labels (all of the same shape; unit squares, say) that need to be placed within some container (rectangle, say). If there are many labels, heavy overlaps are unavoidable, and there will necessarily be labels with most of their area invisible. A notion of visibility that focuses on visible perimeter instead of visible area is more promising, as it is easy to guarantee that each square has at least half of its perimeter visible. We consider the problem of placing and stacking the labels such that the minimum visible perimeter among all label is maximized, and we obtain first nontrivial results in restricted settings. This is joint work with Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann and Miloš Stojaković, initiated at GWOP'22, and presented at SWAT'24.
Upcoming talks | All previous talks | Talks by speaker |
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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