B*-Trees: a new representation for non-slicing floorplans

We present in this paper an efficient, flexible, and effective data structure, <italic>B<supscrpt>*</supscrpt>-trees</italic> for non-slicing floorplans. B<supscrpt>*</supscrpt>-trees are based on ordered binary trees and the admissible placement presented in [1]. Inheriting from the nice properties of ordered binary trees, B<supscrpt>*</supscrpt>-trees are… CONTINUE READING

12 Figures & Tables



Citations per Year

450 Citations

Semantic Scholar estimates that this publication has 450 citations based on the available data.

See our FAQ for additional information.