Fixed-Parameter Computational Geometry

Description and aim

Algorithms and data structures form a key component of any software system. Many algorithmic problems arising in practice are intractable, which means there are no fast algorithm solving these problems optimally on all problem instances.  The area of fixed-parameter tractability tries to gain more insight into such problems, by analyzing them in terms of some well-defined parameter(s) that capture the difficulty of the problem. In many applications, algorithms are needed for problems involving spatial data. Computational geometry is the area within algorithm research dealing with spatial data. This workshop brings together researchers from the areas of computational geometry and fixed-parameter tractability, to advance the study of intractable problems on spatial data.