Comparisons of quad trees and 4-D trees: new results [VLSI layout]

@article{Pitaksanonkul1989ComparisonsOQ,
  title={Comparisons of quad trees and 4-D trees: new results [VLSI layout]},
  author={Anucha Pitaksanonkul and Suchai Thanawastien and Chidchanok Lursinsap},
  journal={IEEE Trans. on CAD of Integrated Circuits and Systems},
  year={1989},
  volume={8},
  pages={1157-1164}
}
A comparison is made between two tree data structures that support region queries for VLSI layout systems. In a previous study, J.B. Rosenberg (ibid., vol.CAD-4, no.1, p.53-67, 1985) demonstrated that four-dimensional trees have a faster speed but use more memory space than quad trees with bisector lists. In this study the authors show that quad trees without bisector lists, for some small threshold values, have a better speed and require less storage than four-dimensional trees. > 

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

Quad - tree hierarchy for circuit data retrieval in structured design

  • Jon L. Bentley
  • Proc . Inr . Conf . Computer Design
  • 1985

An algorithm for finding best matches in logarithmic expected time

  • Jon L. Bentley, R. A. Finkel
  • ACM TOMS
  • 1982

A range searching sub - system used to perform efficient VLSI design checks

  • G. Mazare
  • Proc . ICCAD
  • 1977