Theory of Combinatorial Algorithms Institute for Theoretical Computer Science Department of Computer Science ETH Zurich

Seminar Computational Geometry FS10
(251-0429-00S / 252-4201-00L)

Bernd Gärtner, CAB G32.2, Tel: 01-632 70 26, lastname@inf.ethz.ch.
Michael Hoffmann, CAB G33.1, Tel: 01-632 73 90, lastname@inf.ethz.ch.
Emo Welzl, CAB G15.2, Tel: 01-632 73 70, lastname@inf.ethz.ch.

Contents

This seminar is held once a year and complements the course Computational Geometry. Successful participation (exam passed) in a Computational Geometry course is necessary as a prerequisite. Students of the seminar will present original research papers on computational geometry. The seminar is a good preparation for a master, diploma, or semester thesis in the area of computational geometry.

Dates

First meeting: Friday Feb 25th 2011, 14:15-15:00, CAB G15.2
The seminar will be held as a block seminar, on two to three slots. CAB G15.2.

Proposed papers

  1. S. Bereg, Enumerating pseudo-triangulations in the plane, Computational Geometry 30/3, 207-222, 2005. [DOI]
  2. T. Chan, Optimal partition trees, in SOCG 2010, [preprint]
  3. O. Aichholzer, S. Bereg, A. Dumitrescu, A. García, C. Huemer, F. Hurtado, M. Kano, A. Márquez, D. Rappaport, S. Smorodinsky, D. Souvaine, J. Urrutia, and D. Wood, Compatible Geometric Matchings, Computational Geometry 42/6-7, 617-626, 2009. [DOI]
  4. N. Amenta, G. M. Ziegler, Shadows and Slices of Polytopes, Proc. of the twelfth annual symposium on Computational Geometry, 10-19, 1996. [DOI]
  5. Jie Gao, Michael Langberg, Leonard J. Schulman, Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem, Discrete and Computational Geometry 40(4), 537-560, 2008.[DOI]
  6. Leonidas J. Guibas, Steve Y. Oudot, Reconstruction Using Witness Complexes , Discrete and Computational Geometry 40(3), 325-356, 2008.[DOI]

Conditions

The seminar is held in English. Each talk is 45min. plus 15min. discussion.
A successful participation in the seminar requires the following:
  1. previous participation (exam passed) in a Computational Geometry course;
  2. a rehearsal talk, to be given in front of your supervisor at least one week prior to the plenary talk;
  3. a satisfactory plenary talk;
  4. attendance at all other talks.

Last modified: $Date: 2011/01/10 13:29:49 $ by Michael Hoffmann. Valid HTML 4.0! Valid CSS!