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: Thursday, April 20, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Meghana M. Reddy

Local Complexity of Polygons and its Relevance in the Art Gallery Problem

Discrete and Computational Geometry often involve simple polygons or polygonal regions, with one of the classic problems being the Art Gallery Problem (AGP). However, many algorithms and data structures have significantly improved runtime if the underlying polygonal region has low local complexity. To provide a rigorous foundation for this notion, we present two possible formal definitions of local complexity of a polygon: point visibility width and chord visibility width. Additionally, we establish their combinatorial relationship. This is joint work with Fabian Klute and Tillmann Miltzow. Simon Hengeveld and Tillmann Miltzow have published an FPT algorithm for the AGP when parameterized by the chord visibility width, which we will briefly explore in our talk.

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