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, August 24, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Csaba Dávid Tóth (University of Calgary)

Watchman Tours for Polygons with Holes

A watchman tour in a polygonal domain (for short, polygon) is a closed curve such that every point in the polygon is visible from at least one point of the tour. The problem of finding a shortest watchman tour is NP-hard for polygons with holes. We show that the length of a minimum watchman tour in a polygon P with k holes is O(per(P) + \sqrt{k}*diam(P)), where per(P) and diam(P) denote the perimeter and the diameter of P, respectively. Apart from the multiplicative constant, this bound is tight in the worst case. A watchman tour of this length can be computed in O(n\log n) time, where n is the total number of vertices. We generalize our results to watchman tours in polyhedra with holes in 3-space. We obtain an upper bound O(per(P) + \sqrt{k*per(P)*diam(P)} + k^{2/3}*diam(P)), which is again tight in the worst case.

Joint work with Adrian Dumitrescu.

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