March 8 – 13 , 2009, Dagstuhl Seminar 09111
For support, please contact
The field of computational geometry is concerned with the design, analysis, and implementation of algorithms for geometric problems, which arise in a wide range of areas, including computer graphics, CAD, robotics computer vision, image processing, spatial databases, GIS, molecular biology, and sensor networks. 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 and fundamental research remains an important issue in the field. Meanwhile, as the field matured, researchers have started paying close attention to applications and implementations of geometric algorithms. Several software libraries for geometric computation (e.g. LEDA, CGAL, CORE) have been developed. Remarkably, these implementations emerged from the originally theoretically oriented computational geometry community itself, so that many researchers are concerned now with theoretical foundations as well as implementations.
The seminar focused on theoretical as well as practical issues in computational geometry. In the following, we list some of the currently most important topics in computational geometry, together with some of the leading researchers working in those areas whom were invited to this seminar:
- Theoretical foundations of computational geometry lie in combinatorial geometry and its algorithmic aspects. They are of an enduring relevance for the field, particularly the design and the analysis of efficient algorithms require deep theoretical insights.
- Various applications such as robotics, GIS, or CAD lead to interesting variants of the classical topics originally investigated, including convex hulls, Voronoi diagrams and Delaunay triangulations, and geometric data structures. For example, pseudotriangulations, generalization of triangulations and developed in connection with visibility and shortest-path problems, have turned out to be useful for many other applications and are being investigated intensively.
- Because of applications in molecular biology, computer vision, geometric databases, shape analysis has become an important topic.
- Another increasingly important application of computational geometry is modeling and reconstruction of surfaces. It brings about many interesting questions concerning fundamental structures like triangulations as well as new issues in computational topology.
- Massive geometric data sets are being generated by networks of sensors at unprecedented spatial and temporal scale. How to store, analyze, query, and visualize them has raised several algorithmic challenges. New computational models have been proposed to meet these challenges, e.g., streaming model, communication-efficient algorithms, and maintaining geometric summaries.
- Implementation issues have become an integral part of the research in computational geometry. Besides general software design questions especially robustness of geometric algorithms is important. Several methods have been suggested and investigated to make geometric algorithms numerically robust while keeping them efficient, which lead to interaction with the field of computer algebra, numerical analysis, and topology.
Dagstuhl seminars on computational geometry have been organized since 1990, lately in a two year rhythm, and always have been extremely successful and on a very high scientific level, possibly the highest of all meetings on computational geometry worldwide. This year, 42 researchers from various countries and continents attended the meeting. The feedback from participants was very positive. Participants, especially junior researchers, appreciate the opportunity to meet leaders in the field and benefit from their expertise. Keeping the attendance small enough is a necessary condition for an easy communication and a good research atmosphere, but, having most leaders in the field still allows to invite some very promising younger people. This formula has been recognized as very successful for years. The long breaks in the schedule are particularly useful for research in working groups.
The place itself is a great strength of the Seminar. Dagstuhl allows people to really meet and socialize, providing them with a wonderful atmosphere of a unique closed and pleasant environment, which is highly beneficial to interactions. Therefore, we warmly thank the scientific, administrative and technical staff at Schloss Dagstuhl!
Dagstuhl Seminar Series
- 17171: "Computational Geometry" (2017)
- 15111: "Computational Geometry" (2015)
- 13101: "Computational Geometry" (2013)
- 11111: "Computational Geometry" (2011)
- 07111: "Computational Geometry" (2007)
- 05111: "Computational Geometry" (2005)
- 03121: "Computational Geometry" (2003)
- 01121: "Computational Geometry" (2001)
- 99102: "Computational Geometry" (1999)
- 9707: "Computational Geometry" (1997)
- 9511: "Computational Geometry" (1995)
- 9312: "Computational Geometry" (1993)
- 9141: "Computational Geometry" (1991)
- 9041: "Algorithmic Geometry" (1990)
- Computer Graphics / Computer Vision
- Data Structures / Algorithms / Complexity