Workshop on

Robustness and Efficiency Issues in Implementing

Arrangements of Curves and Surfaces

INRIA Sophia-Antipolis, December 18,19, 2002

Arrangements are space subdivisions induced by collections of geometric objects. They are ubiquitous in computational geometry and have applications in a variety of domains including robotics, GIS, computer vision, molecular modeling and more. The theory of arrangements (combinatorics and algorithmics) has been intensively studied for several decades. In recent years there is growing interest in the practice of arrangements, their implementation and application. The goal of the workshop is to bring together researchers working on applied aspects of arrangements or closely related topics to present the recent advancements in robust implementation of arrangements, to compare the qualities of various approaches, to discuss key problems and to identify promising future directions in this area.

Topics for presentation and discussion include:

Program and slides

List of participants

The workshop is organized as part of the ECG project, Effective Computational Geometry for Curves and Surfaces, an EU funded project of several computational geometry groups in Europe and Israel. It is open for non-ECG participants. The workshop will take place at the campus of INRIA Sophia-Antipolis on December 18,19, 2002, immediately after the Workshop on Algorithmic Foundations of Robotics (WAFR).

There will be a registration fee of 60 Euros, just to cover two lunches and a workshop dinner. Participants will be expected to pay themselves for lodging and travel.

Practical Information
Rooms have been booked at Resideal Hotel for the participants who sent the reservation fax.
If you want to modify your reservation, please contact the hotel directly (see the Practical Information).

To get more details, please contact the organizers:

Eran Leiserowitz - Monique Teillaud
Last modified: Fri Jan 10 11:22:14 MET 2003