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, April 25, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Jiří Matoušek (Charles Univ., Prague)

Zone diagrams

A zone diagram is a new variation of the classical notion of Voronoi diagram. Given points (sites) p_1,...,p_n in the plane, each p_i is assigned a region R_i, but in contrast to the ordinary Voronoi diagrams, the union of the R_i has a nonempty complement, the neutral zone. The defining property is that each R_i consists of all points that lie closer (non-strictly) to p_i than to the union of all the other R_j. Thus, the zone diagram is defined implicitly, by a fixed-point property, and neither its existence nor its uniqueness seem obvious. We prove both, as well as convergence of a natural iterative algorithm for computing it. Many challenging questions remain open.

Joint work with Tetsuo Asano and Takeshi Tokuyama.

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