Optimal Three-Dimensional Layouts of Complete Binary Trees
نویسندگان
چکیده
We present optimal embeddings of an n-node complete binary tree in a three-dimensional or a two-dimensional grid when k, the size of one of the dimensions of the grid, is given. For the three-dimensional case we show how to obtain, for any k in the range [1, n/2], a layout of O(n+k logn) volume. The same bound is shown to hold for the two-dimensional case when k is in the range [log n , n/2]. We also show that these bounds are optimal within a constant factor.
منابع مشابه
On Improving the Performance of Tree Machines
In this paper we introduce a class of trees, called generalized compressed trees. Generalized compressed trees can be derived from complete binary trees by performing certain `contraction' operations. A generalized compressed tree CT of height h has approximately 25% fewer nodes than a complete binary tree T of height h. We show that these trees have smaller (up to a 74% reduction) 2-dimensiona...
متن کاملOptimal Layout of Edge-weighted Forests
The layout problem for trees with weighted edges is motivated by the design of very large scale integrated circuits. Some of the nodes are xed and the object is to position the remainder so that the total weighted edge cost is minimized. The cost of each edge is the product of its weight and its length under some appropriate norm. Optimization for planar layouts is shown to be NP-hard. If cross...
متن کاملExpansion of layouts of complete binary trees into grids
Let Th be the complete binary tree of height h. Let M be the infinite grid graph with vertexset Z, where two vertices (x1,y1) and (x2,y2) of M are adjacent if and only if|x1-x2| + |y1-y2| = 1. Suppose that T is a tree which is a subdivision of Th and is also isomorphicto a subgraph of M. Motivated by issues in optimal VLSI design, we show that the point expansionration(T)<lb...
متن کاملGenerating Floor Plan Layouts with K-d Trees and Evolutionary Algorithms
K-dimensional trees, abbreviated as k-d trees in the following, are binary search and partitioning trees that represent a set of n points in a multi-dimensional space. K-d tree data structures have primarily been used for nearest neighbor queries and several other query types, for example in database applications. In the context of a research project at the Bauhaus-University Weimar concerned w...
متن کاملGeneralized Compressed Tree Machines
In this paper we propose a new class of tree machines, called generalized compressed tree machines. Generalized compressed tree machines are obtained from complete binary tree machines by performing certain`con-traction' operations. A generalized compressed tree machine of height h has approximately 25% less number of processors than a complete binary tree of height h. We show that these machin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 26 شماره
صفحات -
تاریخ انتشار 1987