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: Thursday, January 19, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Mirco Fröhlicher

An Algorithm for Segment-Dragging

Given a set of n points in the plane, pick an arbitrary horizontal line segment and move it vertically until it hits one of the points. This paper[1] describes a linear size data structure to answer such dragging queries in O(log n) time with O(n log n) preprocessing time.

[1] B. Chazelle, An Algorithm for Segment-Dragging and Its Implementation, Algorithmica 3(2), pp. 205-221, 1998.

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

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