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 - 10:00 Mariette Yvinec, INRIA, Sophia Antipolis
The Voronoi diagram of convex objects in the plane
10:00 Coffee break
10:30 - 11:00
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 - 22:00 Joe Mitchell, SUNY at Stony Brook (Chairman)
OPEN PROBLEM SESSION



Tuesday, 18. 3. 2003

9:00 - 9:20 Marc van Kreveld, Utrecht University
Cutting the United States into pieces
9:25 - 9:45 Ioannis Z. Emiris, University of Athens
Algebraic methods for geometric predicates
9:50 - 10:10 Leonidas Guibas, Stanford University
Flexible spanners
10:00 Coffee break
10:40 - 11:00 Kurt Mehlhorn, Max-Planck-Institut für Informatik
Conic polygons
11:05 - 11:25 Nicola Wolpert, Max-Planck-Institut für Informatik
Arrangements of cubic curves
11:30 - 11:50 Ron Wein, Tel Aviv University
Planar arrangements of conic arcs and applications
12:15 Lunch; 15:30 Coffee and Cake
16:00 - 16:20 Dan Halperin, Tel Aviv University
Controlled perturbation
16:25 - 16:45 Oswin Aichholzer, TU Graz
Flipping in pseudo-triangulations
16:50 - 17:10 Franz Aurenhammer, TU Graz
Pseudo-triangulations and surfaces
17:15 - 17:35 Micha Sharir, Tel Aviv University
Computing the union of triangles
17:40 - 18:00 Emo Welzl, ETH Zürich
On the probability of a random 4-gon to be convex
18:00 Dinner

Wednesday, 19. 3. 2003

9:00 - 9:20 Beat Brüderlin, TU Ilmenau
Vertex tracing
9:25 - 9:50 Guido Brunnett, TU Chemnitz
Direct segmentation of algebraic models in reverse engineering
9:55 - 10:15 Hans Hagen, Universität Kaiserslautern
Simulation-based modeling
10:00 Coffee break
10:45 - 11:00 Joachim Giesen, ETH Zürich
The flow complex: a geometric datastructure and applications
11:05 - 11:20 Tamal K. Dey, Ohio State University
Shape segmentation and matching with flow discretization
11:25 - 11:45 Shakhar Smorodinsky, Tel Aviv University
On conflict-free coloring problems
11:50 - 12:10 Géraldine Morin, ENSEEIHT, Toulouse
Geometric filtering for parametric curves
12:15 Lunch
13:20Seminar photograph taken in front of the castle
13:30Bus departure to Mettlach and the river Saar loop
18:00 Dinner

Thursday, 20. 3. 2003

9:00 - 9:20 Sariel Har-Peled, University of Illinois, Urbana
Shape fitting with outliers
9:25 - 9:40 Erik Demaine, MIT, Cambridge
Instance-optimal algorithms for black-box curve manipulation
9:45 - 10:05 Steven Fortune, Bell Labs, Murray Hill
Iterative conditioning as a design methodology for robust predicates on curved objects
10:00 Coffee break
10:40 - 11:00 Bernard Chazelle, Princeton University
Sublinear geometric algorithms
11:05 - 10:20 Lutz Kettner, Max-Planck-Institut für Informatik
Boolean operations on 3d surfaces using Nef polyhedra
11:25 - 11:40 Joseph S. Mitchell, SUNY at Stony Brook
Touring a sequence of polygons - part 2
11:45 - 12:00 Alon Efrat, University of Arizona, Tucson
Touring a sequence of polygons - part 2
12:15 Lunch; 15:30 Coffee and Cake
16:00 - 16:20 Piotr Indyk, MIT, Cambridge
Nearest neighbor under edit distance via product metric
16:25 - 16:45 Chee K. Yap, Courant Institute, New York
Pseudo-approximation algorithms
16:50 - 17:05 Stefan Funke, Max-Planck-Institut für Informatik
Energy-minimizing k-hop paths in wireless networks
17:15 - 17:35 Sunghee Choi, University of Texas at Austin
Incremental constructions con BRIO
17:40 - 18:00 Ferran Hurtado, Universitat Politecnica de Catalunya
Playing with triangulations
18:00 Dinner

Friday, 21. 3. 2003

9:00 - 9:15 Aymée Calatayud, Universidad Politecnica de Madrid
The construction of arrangements of pseudo-parabolas
9:20 - 9:40 Pankaj Kumar Agarwal, Duke University
Hausdorff distance for points and balls
9:45 - 10:00 Tetsuo Asano, JAIST, Ishikawa
Discrepancy measure over natural matrices
10:00 Coffee break
10:35 - 10:50 Rolf Klein, Universität Bonn
Geometric dilation of point sets
10:55 - 11:05 Vladlen Koltun, University of California, Berkeley
The Magen David weaving
11:10 - 11:30 Stefan Schirra, Universität Magdeburg
Progress on LEDA reals
11:35 - 11:42 Carola Wenk, University of Arizona, Tucson
Finding a curve in a map
11:45 - 11:55 CLOSED PROBLEM SESSION
11:55 - 12:00 Wrap-up Session
12:15 Lunch; 15:30 Coffee and Cake; 18:00 Dinner