2nd CGAL User Workshop Programme (Preliminary)

12 June 2004
New York, USA
08:30 - 09:00 Registration
09:00 - 09:10 Welcome and Introduction
Andreas Fabri
09:10 - 10:50 Session chair: Menelaos Karavelas
09:10 - 09:35 A CGAL implementation of the Straight Skeleton of a Simple 2D Polygon with Holes.
Fernardo Cacciola (Scisoft)
09:35 - 10:00 Visibility-based pursuit-evasion for searchers with limited field of view
Brian Gerkey (Stanford University)
10:00 - 10:25 A Tutorial on CGAL Polyhedron for Subdivision Algorithms
Le-Jeng Shiue (University of Florida), Pierre Alliez (INRIA Sophia Antipolis), Lutz Kettner (MPI) and Radu Ursu (GeometryFactory).
10:25 - 10:50 A Case Study on the Portability of old CGAL Code.
Stefan Schirra and Christian Schulz (Magdeburg University)
10:50 - 11:20 Refreshment Break
11:20 - 12:35 Session chair: Mariette Yvinec
11:20 - 11:45 Almost-Delaunay Simplices : Robust Neighbor Relations for Imprecise 3D Points using CGAL
Deepak Bandyopadhyay and Jack Snoeyink (University of North Carolina)
11:45 - 12:10 Computing Four-Body Protein Energy Potentials with Incremental 3D Delaunay Triangulation in CGAL.
David O'Brien and Jack Snoeyink (University of North Carolina)
12:10 - 12:35 A Kinetic Data Structures framework for CGAL
Leonidas Guibas, Daniel Russel (Stanford University) and Menelaos Karavelas (Notre Dame University).
12h35 - 13:45 Lunch
13:45 - 14:45 Session chair: Monique Teillaud
13:45 - 14:00 Arrangements in CGAL: More Generic than Ever!
Efi Fogel, Ron Wein, and Dan Halperin (Tel Aviv University)
14:00 - 14:15 About Arithmetics and Kernels
Sylvain Pion (INRIA Sophia Antipolis)
14:15 - 14:30 Segment Voronoi Diagrams
Menelaos Karavelas (Notre Dame University)
14:30 - 14:45 Spatial Searching
Hans Tangelder (Utrecht University)
14:45 - 15:30 Refreshment Break
15:30 - 15:45 The CGAL Open Source Project
Andreas Fabri (GeometryFactory) and Lutz Kettner (MPI)
15:45 - 17:00 Discussion
Session Chair: Lutz Kettner
[an error occurred while processing this directive]