arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1004.2338cs.CGcs.CCcs.DS
收藏

有根树气球图绘制的复杂性分析

Complexity Analysis of Balloon Drawing for Rooted Trees

Chun-Cheng Lin, Hsu-Chun Yen, Sheung-Hung Poon, Jia-Hao Fan

摘要:

在树的气球状绘图中,同一父节点下的所有子节点都放置在以其父节点为中心的圆的圆周上,并且沿着从根节点开始的任何路径以每个节点为中心的圆的半径反映了与该节点关联的后代的数量。在各种风格的树木绘画的文献报道,气球画享有一个理想的特点,显示树结构在一个相当平衡的方式。对于引出序号图形中的每个内部节点,从该节点到其子节点的射线将容纳以该子节点为根的子树的楔形划分为两个子楔形。根据是否要求两个子楔角相同,气球图可以进一步分为两种类型:均匀子楔型和不均匀子楔型。在最一般的情况下,对于树中的任何内部节点,有两个自由度维度会影响引出序号图形的质量:(1)更改节点的子节点在图形中出现的顺序,以及(2)对于以节点的每个子节点为根的子树,翻转子树的两个子楔形。本文从角度分辨率、纵横比和角度标准差等方面,对有根树气球图的优化问题进行了复杂性分析,并根据树是均匀子楔型还是不均匀子楔型,以及是否允许上述(1)和(2)两种情况,给出了不同的绘制情况。事实证明,有些是NP完全的,而另一些可以在多项式时间内解决。我们还推导出近似算法的那些是棘手的一般。

英文摘要:

In a balloon drawing of a tree, all the children under the same parent are placed on the circumference of the circle centered at their parent, and the radius of the circle centered at each node along any path from the root reflects the number of descendants associated with the node. Among various styles of tree drawings reported in the literature, the balloon drawing enjoys a desirable feature of displaying tree structures in a rather balanced fashion. For each internal node in a balloon drawing, the ray from the node to each of its children divides the wedge accommodating the subtree rooted at the child into two sub-wedges. Depending on whether the two sub-wedge angles are required to be identical or not, a balloon drawing can further be divided into two types: even sub-wedge and uneven sub-wedge types. In the most general case, for any internal node in the tree there are two dimensions of freedom that affect the quality of a balloon drawing: (1) altering the order in which the children of the node appear in the drawing, and (2) for the subtree rooted at each child of the node, flipping the two sub-wedges of the subtree. In this paper, we give a comprehensive complexity analysis for optimizing balloon drawings of rooted trees with respect to angular resolution, aspect ratio and standard deviation of angles under various drawing cases depending on whether the tree is of even or uneven sub-wedge type and whether (1) and (2) above are allowed. It turns out that some are NP-complete while others can be solved in polynomial time. We also derive approximation algorithms for those that are intractable in general.

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

↑