Dagstuhl-Seminar 05111
Computational Geometry
( 13. Mar – 18. Mar, 2005 )
(zum Vergrößern in der Bildmitte klicken)
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/05111
Organisatoren
- Helmut Alt (FU Berlin, DE)
- Franz Aurenhammer (TU Graz, AT)
- Dan Halperin (Tel Aviv University, IL)
Kontakt
Computational geometry has developed as a subarea of algorithmics, concerned with algorithms and data structures for geometric problems. These problems are motivated by application areas, such as robotics, computer graphics, CAGD, pattern and shape matching and recognition, computer vision, image processing, integrated circuit design, structural bioinformatics, and more. Since the mid 1980s, computational geometry has arisen as an independent field with its own international conferences and journals.
In the early years mostly theoretical foundations of geometric algorithms were laid. Meanwhile, in addition, the area has become application oriented. These latter developments include two related activities of researchers in computational geometry:
- direct involvement in application domains, and
- robust implementation of geometric algorithms.
In fact, several software libraries for geometric computation have been developed. In particular, in the CGAL library and in parts of the LEDA library, geometric algorithms have been implemented. Remarkably, this software emerged from the originally theoretically oriented computational geometry community itself, so that many researchers are concerned now with theoretical foundations as well as implementation. Implementation issues like robustness of computation and software design have become an integral part of the research presented at computational geometry conferences and workshops.
The seminar, therefore, should be concerned with fundamentals as well as practical issues of computational geometry.
Dagstuhl seminars on computational geometry have been organized since 1990 in a two year rhythm.
- Pankaj Kumar Agarwal (Duke University - Durham, US) [dblp]
- Oswin Aichholzer (TU Graz, AT) [dblp]
- Helmut Alt (FU Berlin, DE) [dblp]
- Lars Arge (Aarhus University, DK) [dblp]
- Boris Aronov (Polytechnic Institute of NYU - Brooklyn, US) [dblp]
- Franz Aurenhammer (TU Graz, AT) [dblp]
- Jean-Daniel Boissonnat (INRIA Sophia Antipolis - Méditerranée, FR) [dblp]
- Hervé Brönnimann (Polytechnic Institute of NYU - Brooklyn, US)
- Otfried Cheong (KAIST - Daejeon, KR) [dblp]
- Kenneth Clarkson (Bell Labs - Murray Hill, US) [dblp]
- Raghavan Dhandapani (New York University, US)
- Scot Drysdale (Dartmouth College - Hanover, US)
- Alon Efrat (University of Arizona - Tucson, US) [dblp]
- Angela Enosh (Tel Aviv University, IL)
- Jeff Erickson (University of Illinois - Urbana-Champaign, US) [dblp]
- Leonidas J. Guibas (Stanford University, US) [dblp]
- Dan Halperin (Tel Aviv University, IL) [dblp]
- Sariel Har-Peled (University of Illinois - Urbana-Champaign, US) [dblp]
- Ferran Hurtado (UPC - Barcelona, ES)
- Piotr Indyk (MIT - Cambridge, US) [dblp]
- Lutz Kettner (MPI für Informatik - Saarbrücken, DE)
- Rolf Klein (Universität Bonn, DE) [dblp]
- Christian Knauer (FU Berlin, DE) [dblp]
- Hannes Krasser (TU Graz, AT)
- Kurt Mehlhorn (MPI für Informatik - Saarbrücken, DE) [dblp]
- Joseph S. B. Mitchell (SUNY - Stony Brook, US) [dblp]
- Mark Overmars (Utrecht University, NL)
- Richard Pollack (New York University, US) [dblp]
- Günter Rote (FU Berlin, DE) [dblp]
- Raimund Seidel (Universität des Saarlandes, DE) [dblp]
- Micha Sharir (Tel Aviv University, IL) [dblp]
- Michiel Smid (Carleton University - Ottawa, CA)
- Jack Snoeyink (University of North Carolina at Chapel Hill, US) [dblp]
- Bettina Speckmann (TU Eindhoven, NL) [dblp]
- Monique Teillaud (INRIA Sophia Antipolis - Méditerranée, FR) [dblp]
- Marc van Kreveld (Utrecht University, NL) [dblp]
- Gert Vegter (University of Groningen, NL) [dblp]
- Ron Wein (Tel Aviv University, IL)
- Emo Welzl (ETH Zürich, CH) [dblp]
- Sue Whitesides (McGill University - Montréal, CA) [dblp]
- Nicola Wolpert (MPI für Informatik - Saarbrücken, DE) [dblp]
- Chee K. Yap (New York University, US) [dblp]
Verwandte Seminare
- Dagstuhl-Seminar 9041: Algorithmic Geometry (1990-10-08 - 1990-10-12) (Details)
- 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 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)
