sentences:  The points of the H tree come arbitrarily close to every point in a rectangle (the same as the starting rectangle in the constructing by centroids of subdivided rectangles).However, it does not include all points of the rectangle; for instance, the perpendicular bisector of the initial line segment is not included.In VLSI design, the H tree may be used as the layout for a complete binary tree using a total area that is proportional to the number of nodes of the tree.