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: Tuesday, November 20, 2018, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Luis Barba

Testing if V-polytopes and H-polytopes intersect

We consider the two possible representation of d-dimensional polytopes: either as the convex hull of a set of n points (V-polytope), or as the intersection of a set of m halfspaces (H-polytope). We study the problem of deciding whether a V-polytope and an H-polytope intersect. We discuss how known approaches can be used to attack this problem, and we provide a very simple strategy that leads to an algorithm, linear on n and m, whose leading constant depends reasonably on the dimension d.

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