Dagstuhl Seminar 28161
Computational Geometry
( Apr 17 – Apr 21, 2028 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/28161
Organizers
- Maarten Löffler (Utrecht University, NL)
- Eunjin Oh (POSTECH - Pohang, KR)
- Carola Wenk (Tulane University - New Orleans, US)
Contact
- Michael Gerke (for scientific matters)
- Susanne Bach-Bernhard (for administrative matters)
The field of 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, visualization, 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.
This Dagstuhl Seminar will be the 20th installment in the Dagstuhl Seminar series on Computational Geometry, which began in 1990. Building on this long-standing tradition, the seminar will focus on two themes that we have identified as especially relevant and timely.
The first theme is geometric distance measures. The comparison and processing of geometric shapes and data lie at the core of computational geometry and topological data analysis, and have gained renewed importance through the increasing prominence of data science and machine learning. The second theme is simplicity in geometric algorithms. Simplicity has increasingly been recognized as an important, yet often overlooked, consideration in the design of algorithms, as reflected, for example, in the emergence of dedicated simplicity tracks at conferences. It is also a topic that naturally bridges research on geometric algorithms with their communication and education.
Overall, the seminar aims to bring together researchers working on these themes, spotlight recent developments, and identify new challenges, opportunities, and connections across computational geometry and neighboring fields.
Creative Commons BY 4.0
Eunjin Oh, Maarten Löffler, and Carola Wenk
Related Seminars
- 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 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)
Classification
- Computational Geometry
Keywords
- geometric computing
- combinatorics
- geometric distances
- simplicity
- algorithms
