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

关于正交圆的排列

On Arrangements of Orthogonal Circles

Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff

摘要:

本文研究了正交圆的排列,即每对圆必须不相交或相交成直角的圆的排列。使用几何参数,我们表明,这样的安排只有一个线性数量的面。这意味着正交圆交图只有线性数量的边。当我们把自己限制在正交单位圆上时,所得的交图类是便士图(即单位圆的接触图)的子类。我们发现,类似于便士图,它是NP-难识别正交单位圆相交图。

英文摘要:

In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have only a linear number of faces. This implies that orthogonal circle intersection graphs have only a linear number of edges. When we restrict ourselves to orthogonal unit circles, the resulting class of intersection graphs is a subclass of penny graphs (that is, contact graphs of unit circles). We show that, similarly to penny graphs, it is NP-hard to recognize orthogonal unit circle intersection graphs.

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

↑