论文标题
点配置的集合宽度
Clique-Width of Point Configurations
论文作者
论文摘要
虽然（输入的）结构宽度参数属于图形算法的标准工具箱，但它在计算几何学中并不是通常的情况。作为一个案例研究，我们提出了将宽度宽度的结构图参数自然扩展到以其顺序类型为代表的几何点配置。我们研究了该集团宽度概念的基本特性，并将其与点配置的Monadic二阶逻辑相关联。作为一种应用，我们为几何点问题提供了几种线性fpt时间算法，这些算法通常是NP- hard的，在特殊情况下，输入点集是有界差宽的，并且也给出了集合宽度的表达式。
While structural width parameters (of the input) belong to the standard toolbox of graph algorithms, it is not the usual case in computational geometry. As a case study we propose a natural extension of the structural graph parameter of clique-width to geometric point configurations represented by their order type. We study basic properties of this clique-width notion, and relate it to the monadic second-order logic of point configurations. As an application, we provide several linear FPT time algorithms for geometric point problems which are NP-hard in general, in the special case that the input point set is of bounded clique-width and the clique-width expression is also given.
