Computational geometry is concerned with the design, analysis, and implementation of algorithms for geometric and topological problems, which arise naturally in a wide range of areas, including computer graphics, CAD, robotics, computer vision, image processing, spatial databases, GIS, molecular biology, sensor networks, machine learning, data mining, scientific computing, theoretical computer science, and pure mathematics. Computational geometry is a vibrant and mature field of research, with several dedicated international conferences and journals and strong intellectual connections with other computing and mathematics disciplines.

The emphasis of this Dagstuhl Seminar will be on presenting recent developments in computational geometry, as well as identifying new challenges, opportunities, and connections to other fields of computing. In addition to the usual broad coverage of new results in the field, the seminar will include broad survey talks on algebraic methods in computational geometry as well as geometric data structures. The former focus area has seen exciting recent progress and the latter is a fundamental topic at the heart of computational geometry. There are numerous opportunities for further cross-disciplinary impact.

Algebraic Methods in Computational Geometry

The polynomial method of Guth and Katz of 2010 has had a fundamental impact on discrete geometry and other areas, which was already envisioned by the talk of Jiří Matoušek at the Annual European Workshop on Computational Geometry in 2011, four years before he passed away. Indeed, the polynomial method has attracted the attention of many researchers, including famous ones like Janos Pach, Micha Sharir, and Terence Tao. Applications have been found not only in making progress on long-standing combinatorial geometry problems, but also in the design and analysis of efficient algorithms for fundamental geometric problems such as range searching, approximate nearest search, diameter, etc. The polynomial method is very powerful and it offers a new research direction in which many interesting new results can potentially be discovered.

Geometric Data Structures

Many beautiful results in geometric data structures have been established in the early days of the field. Despite of this, some long-standing problems remain unresolved and some of the recent progress is in fact made using the polynomial method mentioned previously. Independently, there have been some recent advances in our understanding of lower bounds and the usage of more sophisticated combinatorial constructions and techniques such as shallow cuttings, optimal partition trees, discrete Voronoi diagrams, etc. There are also new applications that require the modeling of uncertain data and hence call for a study of the performance of geometric data structures under a stochastic setting.

Creative Commons BY 3.0 DE

Siu-Wing Cheng, Anne Driemel, and Jeff Erickson

• Mikkel Abrahamsen (University of Copenhagen, DK) [dblp]
• Peyman Afshani (Aarhus University, DK) [dblp]
• Kevin Buchin (TU Eindhoven, NL) [dblp]
• Maike Buchin (Ruhr-Universität Bochum, DE) [dblp]
• Hsien-Chih Chang (Duke University - Durham, US) [dblp]
• Siu-Wing Cheng (HKUST - Kowloon, HK) [dblp]
• Man-Kwun Chiu (FU Berlin, DE) [dblp]
• Arnaud de Mesmay (University of Grenoble, FR) [dblp]
• Anne Driemel (Universität Bonn, DE) [dblp]
• Alperen Ergür (TU Berlin, DE)
• Jeff Erickson (University of Illinois - Urbana-Champaign, US) [dblp]
• Esther Ezra (Georgia Tech - Atlanta, US & Bar-Ilan Univ. Ramat Gan, IL) [dblp]
• Kyle Jordan Fox (University of Texas - Dallas, US) [dblp]
• Marc Glisse (INRIA Saclay - Île-de-France, FR) [dblp]
• Rolf Klein (Universität Bonn, DE) [dblp]
• Stefan Langerman (UL - Brussels, BE) [dblp]
• Maarten Löffler (Utrecht University, NL) [dblp]
• Kurt Mehlhorn (MPI für Informatik - Saarbrücken, DE) [dblp]
• Wouter Meulemans (TU Eindhoven, NL) [dblp]
• Guillaume Moroz (INRIA Nancy - Grand Est, FR) [dblp]
• David M. Mount (University of Maryland - College Park, US) [dblp]
• André Nusser (MPI für Informatik - Saarbrücken, DE) [dblp]
• Eunjin Oh (MPI für Informatik - Saarbrücken, DE) [dblp]
• Zuzana Patáková (IST Austria & Charles University Praha) [dblp]
• Benjamin Raichel (University of Texas - Dallas, US) [dblp]
• Natan Rubin (Ben Gurion University - Beer Sheva, IL) [dblp]
• Maria Saumell (The Czech Academy of Sciences - Prague, CZ & Czech Technical University - Prague, CZ) [dblp]
• Lena Schlipf (FernUniversität in Hagen, DE) [dblp]
• Raimund Seidel (Universität des Saarlandes, DE) [dblp]
• Micha Sharir (Tel Aviv University, IL) [dblp]
• Bettina Speckmann (TU Eindhoven, NL) [dblp]
• Monique Teillaud (INRIA Nancy - Grand Est, FR) [dblp]
• Hans Raj Tiwary (Charles University - Prague, CZ) [dblp]
• Marc van Kreveld (Utrecht University, NL) [dblp]
• André van Renssen (The University of Sydney, AU) [dblp]
• Suresh Venkatasubramanian (University of Utah - Salt Lake City, US) [dblp]
• Kevin Verbeek (TU Eindhoven, NL) [dblp]
• Antoine Vigneron (Ulsan National Institute of Science and Technology, KR) [dblp]
• Birgit Vogtenhuber (TU Graz, AT) [dblp]
• Nicola Wolpert (University of Applied Sciences - Stuttgart, DE) [dblp]