- 1.
- Boolean operations on polygons with circular arcs.
- 2.
- Arrangements of ellipsoids
- 3.
- Boolean operations on polyhedra with curved faces and edges

The methods stem from different areas: computational geometry, data structures, numerical analysis, computer algebra, and software design. It is conceivable that you know some of the material already.

**There are loose ends.** We are not claiming that we know the ultimate
solutions to the problems above. We know some solutions and it will become
clear from the presentation that there is plenty of room for improvements and
further work. In fact, we believe that the charm of course lies in the fact
that there are many loose ends. We hope that you pick them up in Fopras,
Diplomarbeiten and PhD-projects.

See also the Course Announcement for this course.