arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.02282cs.LOcs.CG
收藏

C点宽度

Clique-Width of Point Configurations

Onur Çağırıcı, Petr Hliněný, Filip Pokrývka, Abhisekh Sankaran

摘要:

虽然(输入的)结构宽度参数属于图形算法的标准工具箱,但在计算几何中并不常见。作为一个案例研究,我们提出了一个自然的扩展的结构图参数的candle-width几何点配置表示其订单类型。我们研究了这个概念的基本性质,并将其与点配置的一元二阶逻辑联系起来。作为应用,我们给出了几种求解一般NP困难的几何点问题的线性FPT时间算法,并给出了输入点集具有有界宽度的特殊情况下的有限宽度表达式.

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑