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, May 29, 2007, 12:15 pm

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

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

**Speaker**: Jack Snoeyink (Univ. of North Carolina at Chapel Hill)

1. How much time does it take to compute the diameter or convex hull of the intersection points of a set of n lines (the finite vertices of their arrangement)?

2. What if you are given n line segments?

3. What if you are given n planes?

Over 20 years ago, Ching and Lee (and Atallah) answered the first question: Theta(n log n) time, even though the arrangement can have Theta(n^2) intersections -- the extreme points must be intersections of lines that are consecutive in slope order. This observation does not help us for questions #2 or #3, however. I'll present the answers in today's seminar.

This result has no known practical application, other than to partially refute Emo's accusation that I do applied work.

Joint work with Esther Arkin and Joseph Mitchell.

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

Previous talks by year: 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