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

超矩形剖分的对偶复形的嵌入

Embedding the dual complex of hyper-rectangular partitions

Michael Kerber

摘要:

矩形划分是将(轴对齐的)矩形划分为相邻不相交的矩形。我们问一个矩形分区是否允许一个“漂亮”的绘图其对偶,也就是说,一个直线嵌入它,这样每个对偶顶点被放置到矩形,它表示。我们表明,决定是否存在这样的图纸是NP完全的。此外,我们认为,一个顶点被放置在所表示的矩形的中心的绘图,并考虑充分条件,这个绘图是好的。这个问题的研究都在平面上,并为高维推广的矩形分区。

英文摘要:

A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a "nice" drawing of its dual, that is, a straight-line embedding of it such that each dual vertex is placed into the rectangle that it represents. We show that deciding whether such a drawing exists is NP-complete. Moreover, we consider the drawing where a vertex is placed in the center of the represented rectangle and consider sufficient conditions for this drawing to be nice. This question is studied both in the plane and for the higher-dimensional generalization of rectangular partitions.

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

↑