arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.03847cs.CGcs.CCcs.DM
收藏

正交保序布局平差的常数因子逼近

A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment

Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi Varadarajan

摘要:

给定一组矩形在平面中的初始位置,我们考虑寻找矩形的不相交位置的问题,该位置使限界框的面积最小化并保持正交顺序,即相对于初始放置,保持矩形中心沿$x$轴和$y$轴的排序。此问题称为不相交矩形的布局调整(LADR)。我们证明了LADR的某个决策版本是$\mathbb{NP}$ -hard的,并给出了LADR的一个常数因子近似.

英文摘要:

Given an initial placement of a set of rectangles in the plane, we consider the problem of finding a disjoint placement of the rectangles that minimizes the area of the bounding box and preserves the orthogonal order i.e.\ maintains the sorted ordering of the rectangle centers along both $x$-axis and $y$-axis with respect to the initial placement. This problem is known as Layout Adjustment for Disjoint Rectangles(LADR). It was known that LADR is $\mathbb{NP}$-hard, but only heuristics were known for it. We show that a certain decision version of LADR is $\mathbb{APX}$-hard, and give a constant factor approximation for LADR.

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

↑