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.
机译:压制压实机的布局设计,用于压缩含水分的工业废物和螺杆驱动区域的水分离过程分析
机译:专家压缩器:VLSI布局压缩中基于知识的应用程序
机译:树木煤气管网布局优化
机译:分层树的紧凑布局
机译:共享内存多处理器上的并行网络优化及其在VLSI布局压缩和布线平衡中的应用。
机译:基于液压压实机加固的黄土路基分层压实质量的实时监测方法
机译:蝴蝶胖树的紧凑,多层布局
机译:完整二叉树的超薄VLsI布局(超大规模集成布局)