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, June 19, 2003, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Nina Amenta (University of California, Davis)

Incremental constructions con BRIO

Incremental constructions are central to computational geometry, particularly in practice the incremental construction of the 3D Delauany triangulation. But when the size of the data structure exceeds main memory, accessing it randomly causes thrashing and the program grinds to a halt. We propose using a Biased Randomized Insertion Order, which introduces enough locality to avoid thrashing but retains enough randomness to still give a provably optimal algorithm.

(joint work with Sunghee Choi and Guenter Rote)

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