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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, November 09, 2010, 12:15 pm

**Duration**: This information is not available in the database

**Location**: OAT S15/S16/S17

**Speaker**: Tobias Christ

Given a simple polygon P, how can we find triangles such that their union equals P? Obviously, we can just take a triangulation of P, which yields a cover of P using n-2 triangles. But now we also allow the triangles to overlap. Maybe we can cover P with fewer than n-2 triangles. In this talk, we are going to look at the computational complexity of this problem and several variants of it. Not very surprisingly, the problem turns out to be NP-hard. We also consider a simple 2-approximation algorithm for the variant where we only want to cover the edges of P.

Joint work with David Tschirky

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