ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
HV/VH trees: a new spatial data structure for fast region queries
Full text PdfPdf (493 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 30th international Design Automation Conference table of contents
Dallas, Texas, United States
Pages: 43 - 47  
Year of Publication: 1993
ISBN:0-89791-577-1
Authors
Glenn G. Lai
Don Fussell
D. F. Wong
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 31,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/157485.164562
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Carver Mead , Lynn Conway, Introduction to VLSI Systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1979
 
2
Gershon Kedem, The quad-CIF tree: A data structure for hierarchical on-line algorithms, Proceedings of the 19th conference on Design automation, p.352-357, January 1982
 
3
J. K. Ousterhout, "Corner stitching: a data-structuring technique for VLSI layout tools," IEEE Trans. on Computer-Aided Design, CAD-3, 1 (January 1984).
 
4
J. B. Rosenberg, "Geographical data structures compared: a study of data structures supporting region queries," IEEE Trans. on Computer-Aided Design, CAD-4, 1 (January 1985).
 
5
R. L. Brown, "Multiple storage quad trees: a simpler faster alternative to bisector list quad trees," IEEE Trans. on Computer-Aided Design, CAD-5, 3 (July 1986}.
 
6
L. Weyten and W. de Pauw, "Quad list qua(} trees: a geometrical data structure with improved performance for large region queries," IEEE Trans. on Computer-Aided Design, 8, 3 (March 1.989).
 
7
A. Pitaksanonkul, S. Thanawastien, and C. Lursinsap, "Comparisons of qua(} trees and 4-D trees: new results," IEEE Trans. on Computer-Aided Design, 8, 11 (November 1989).
 
8
D. Maxple, M. Smulders, and H. Hegen, "Tailor: A layout system based on trapezoidal corner stitching," IEEE Trans. on Computer-Aided Design, 9, 1 (January 1990).

CITED BY
Narendra V. Shenoy , William Nicholls, An efficient routing database, Proceedings of the 39th conference on Design automation, June 10-14, 2002, New Orleans, Louisiana, USA

INDEX TERMS

Primary Classification:
  B. Hardware
  B.7 INTEGRATED CIRCUITS
      B.7.1 Types and Design Styles
          Subjects: VLSI (very large scale integration)

Additional Classification:
  E. Data
  E.1 DATA STRUCTURES
      Subjects: Trees

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Trees


General Terms:
Algorithms, Design, Performance

Collaborative Colleagues:
Glenn G. Lai: colleagues
Don Fussell: colleagues
D. F. Wong: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player