Dagstuhl-Seminar 03121, "Computational Geometry"

Monday, 17. 3. 2003

8:55 - 9:00	Opening
9:00 - 9:25	Jonathan Shewchuk, University of California, Berkeley Anisotropic triangulations
9:30 - 9:55	Mariette Yvinec, INRIA, Sophia Antipolis The Voronoi diagram of convex objects in the plane
10:00 Coffee break
10:30 - 10:55	Jack Snoeyink, University of North Carolina, Chapel Hill Sphere-based computation of Delaunay diagrams
11:00 - 11:25	Gill Barequet, Technion, Haifa Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon
11:30 - 11:55	Christian Knauer, Freie Universität Berlin The complexity of unfolding
12:15 Lunch
15:30 Coffee and cake
16:00 - 16:25	Otfried Cheong, Eindhoven University 1. Line transversals 2. The extendible drawing editor Ipe - 10 years later
16:30 - 16:55	Hervé Brönnimann, Polytechnic University, New York Cost optimization for octrees
17:00 - 17:25	Monique Teillaud, INRIA, Sophia Antipolis Arrangement of quadrics in 3D
17:30 - 17:55	Sergio Cabello, Utrecht University Approximation algorithms for aligning points
18:00 Dinner
20:00	Joe Mitchell, SUNY at Stony Brook (Chairman) OPEN PROBLEM SESSION