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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, June 27, 2006, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Tetsuo Asano (School of Information Science, JAIST (Japan Advanced Institute of Science and Technology)

Angular and Aspect-Ratio Voronoi Diagram with Applications

Given a set of line segments in the plane, we can define an angular Voronoi diagram (and aspect-ratio Voronoi diagram) as follows: a point belongs to a Voronoi region of a line segment if the visual angle of the line segment from the point (aspect ratio of a triangle defined by the point and the line segment) is smallest (largest, resp.) among all line segments. These Voronoi diagrams are different from an ordinary Voronoi diagram for a point set. After introducing interesting properties, we present two efficient algorithms, one for finding a point to maximize the smallest visual angle and the other for computing a point to minimize the largest aspect ratio.


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

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