Workshop on

Robustness and Efficiency Issues in Implementing

Arrangements of Curves and Surfaces

INRIA Sophia-Antipolis, December 18,19, 2002

Wednesday

9:30 - 9:50 registration and coffee
9:50 - 10:00 workshop opening
10:00 - 10:20 Monique Teillaud review of arrg-related activities in INRIA (.ps.gz)
10:20 - 10:40 Lutz Kettner review of arrg-related activities in MPI (.ps.gz)
10:40 - 11:00 Dan Halperin review of arrg-related activities in Tel Aviv (.ps.gz)
11:00 - 11:30 coffee break
11:30 - 12:00 Dinesh ManochaExact and Approximate Algorithms for Complex Geometric Computations (pdf)
12:00 - 12:30 Bernard Mourrain SYNAPS (pdf)
13:00 - 14:30 lunch
14:30 - 15:00 Efi Fogel 2D arrgs in CGAL, recent developments (zipped ppt)
15:00 - 15:30 Sylvain Pion Number types : tips and pitfalls (pdf)
15:30 - 16:00 coffee break
16:00 - 17:00 software demos
Laurent Rineau - The extension package CGAL::Visibility_complex_2
Ron Wein - High level filtering for arrangements of conic arcs (zipped ppt)
Matthias Baesken - Geometry kernel development - experiments and ideas
17:00 - 17:15 break
17:15 - 18:00 open problems
20:00 workshop dinner

Thursday

9:45 - 10:15 Lutz Kettner Representations of arrangements in the plane and in space (pdf)
10:15 - 10:45 Laurent Dupont Robust intersection of quadric surfaces (pdf)
10:45 - 11:15 coffee break
11:15 - 11:45 Arno Eigenwillig Sweeping arrangements of cubic segments exactly and efficiently (.ps.gz)
11:45 - 12:15Shai HirschHybrid Motion Planning
12:15 - 13:00 discussion
13:00 - 14:30 lunch
14:30 - 16:00 working in groups
16:00 - 16:30 coffee break
16:30 - 17:30 working in groups
17:30 - 18:00 workshop summary


Monique Teillaud
Last modified: Fri Jan 17 16:13:53 MET 2003