The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can lead to drawings which are quite wide. We present two new drawing conventions which reduce the layout width to be less than some maximum width while still maintaining the essential layered drawing convention. These conventions relax the requirement that a parent must be exactly placed midway between its children, and instead make this a preference which can be violated if this is required for the layout to fit into the required width. Both drawing conventions give rise to a simple kind of quadratic programming problem. We give an iterative gradient projection algorithm for solving this kind of problem, and also a linear time heuristic algorithm. Our algorithms are practical: a tree with three thousand nodes can be laid out in less than a hundred milliseconds with either algorithm.
树的标准分层绘图约定,其中节点的垂直位置由其在树中的高度指定,并且每个节点在其子节点之间居中,这可能会导致图形相当宽。我们提出了两个新的绘图约定,这些约定将布局宽度减小到小于某个最大宽度,同时仍保持基本的分层绘图约定。这些约定放宽了必须将父级准确放置在其子级中间的要求,而是将其设置为首选项,如果布局必须适合所需宽度,则可以违反此首选项。两种绘图约定都引发了一种简单的二次编程问题。我们给出了用于解决此类问题的迭代梯度投影算法,以及线性时间启发式算法。我们的算法是实用的:无论哪种算法,都可以在不到一百毫秒的时间内布置具有三千个节点的树。 P>
机译:压制压实机的布局设计,用于压缩含水分的工业废物和螺杆驱动区域的水分离过程分析
机译:专家压缩器:VLSI布局压缩中基于知识的应用程序
机译:树木煤气管网布局优化
机译:紧凑的层状树木布局
机译:共享内存多处理器上的并行网络优化及其在VLSI布局压缩和布线平衡中的应用。
机译:基于液压压实机加固的黄土路基分层压实质量的实时监测方法
机译:蝴蝶胖树的紧凑,多层布局
机译:完整二叉树的超薄VLsI布局(超大规模集成布局)