TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 9041

Algorithmic Geometry

( Oct 08 – Oct 12, 1990 )

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/9041

Organizers
  • E. Welzl
  • H. Alt



Summary

The first Dagstuhl-seminar on Computational Geometry was organized by Helmut Alt and Emo Welzl (both FU Berlin). The 28 participants came from 10 countries, 7 of them came from North America and Israel.

20 lectures were given at the seminar, covering quite a number of topics in computational geometry. As was to be expected, a large percentage of the talks dealt with randomization in one way or the other, reflecting the current inclination of the community towards this field. Accordingly, a special discussion session on randomized algorithms was held, which in fact attracted most of the participants of the seminar.

Furthermore, two lectures dealt with the actual implementation of geometric algorithms, and two library / development systems were presented.

Other lectures dealt with problems concerning the similarity of two objects, e.g. matching points into regions, or measuring the (Hausdorff-) distance between polygons.

However, the most unforgettable event of the seminar was clearly the open problem session on monday evening, chaired by Ricky Pollack. It was there that Raimund Seidel declared the zone theorem an open problem, since the proof by Edelsbrunner, O'Rourke, Seidel (given e.g. in the book by Herbert Edelsbrunner) is incorrect. The excitement was considerable, and still rose when Jirka Matousek pulled out of his bag a short manuscript entitled A simple proof of weak zone theorem! Micha Sharir also presented some ideas as to how to prove a weak zone theorem, and now there seems to be a new proof for the zone theorem by Herbert Edelsbrunner which proceeds along the same lines.

Copyright

Participants
  • E. Welzl
  • H. Alt

Related Seminars
  • Dagstuhl Seminar 9141: Computational Geometry (1991-10-07 - 1991-10-11) (Details)
  • Dagstuhl Seminar 9312: Computational Geometry (1993-03-22 - 1993-03-26) (Details)
  • Dagstuhl Seminar 9511: Computational Geometry (1995-03-13 - 1995-03-17) (Details)
  • Dagstuhl Seminar 9707: Computational Geometry (1997-02-10 - 1997-02-14) (Details)
  • Dagstuhl Seminar 99102: Computational Geometry (1999-03-07 - 1999-03-12) (Details)
  • Dagstuhl Seminar 01121: Computational Geometry (2001-03-18 - 2001-03-23) (Details)
  • Dagstuhl Seminar 03121: Computational Geometry (2003-03-16 - 2003-03-21) (Details)
  • Dagstuhl Seminar 05111: Computational Geometry (2005-03-13 - 2005-03-18) (Details)
  • Dagstuhl Seminar 07111: Computational Geometry (2007-03-11 - 2007-03-16) (Details)
  • Dagstuhl Seminar 09111: Computational Geometry (2009-03-08 - 2009-03-13) (Details)
  • Dagstuhl Seminar 11111: Computational Geometry (2011-03-13 - 2011-03-18) (Details)
  • Dagstuhl Seminar 13101: Computational Geometry (2013-03-03 - 2013-03-08) (Details)
  • Dagstuhl Seminar 15111: Computational Geometry (2015-03-08 - 2015-03-13) (Details)
  • Dagstuhl Seminar 17171: Computational Geometry (2017-04-23 - 2017-04-28) (Details)
  • Dagstuhl Seminar 19181: Computational Geometry (2019-04-28 - 2019-05-03) (Details)
  • Dagstuhl Seminar 21181: Computational Geometry (2021-05-02 - 2021-05-07) (Details)
  • Dagstuhl Seminar 23221: Computational Geometry (2023-05-29 - 2023-06-02) (Details)
  • Dagstuhl Seminar 25201: Computational Geometry (2025-05-11 - 2025-05-16) (Details)