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, September 13, 2011, 12:15 pm

Duration: 30 minutes

Location: ML J37.1

Speaker: Yoshio Okamoto (Japan Advanced Institute of Science and Technology)

Vertex Angle and Crossing Angle Resolution of Leveled Tree Drawings

We study the problem of computing leveled tree drawings, i.e., straight-line drawings of trees where the vertices have distinct preassigned y-coordinates. Our optimization goal is to maximize the crossing angle resolution (i.e., the minimum angle formed by any two crossing edges) and/or the vertex angle resolution (i.e., the minimum angle formed by two edges incident to the same vertex) of the drawing. We provide worst case optimal (or almost optimal) bounds for the crossing angle resolution and for the total angle resolution (i.e., the minimum of crossing and vertex angle resolution).

Joint work with Walter Didimo, Michael Kaufmann, Giuseppe Liotta, and Andreas Spillner

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