Fine-Grained & Parameterized Computational Geometry

Computational geometry is a branch of computer science that studies the design of algorithms
and data structures for problems involving geometry and spatial data. Often, a
problem’s solution cannot be computed efficiently for all problem instances. Parameterized
algorithms seek to capitalise on the fact that we may be able to efficiently compute
solutions for certain well-defined classes of instances. In contrast, fine-grained complexity
allows us to provide very strong evidence that certain (instance classes of) problems do
not admit very efficient algorithms. Hence, the aim of the workshop is to bring together
experts from parameterized algorithms, fine-grained complexity and computational geometry,
in order to collaborate on identifying and solving challenges at the interface of these
areas. The workshop features four keynote talks and is mostly dedicated to working in
small groups.