Multidimensional binary search trees used for associative searching
Communications of the ACM
Introduction to VLSI Systems
KAHLUA: a hierarchical circuit disassembler
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Hierarchical representations of collections of small rectangles
ACM Computing Surveys (CSUR)
A practical online design rule checking system
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
HV/VH trees: a new spatial data structure for fast region queries
DAC '93 Proceedings of the 30th international Design Automation Conference
Multidimensional access methods
ACM Computing Surveys (CSUR)
Dual quadtree representation for VLSI designs
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Proceedings of the 39th annual Design Automation Conference
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
Journal of Intelligent Information Systems
A Data Structure for Fast Region Searches
IEEE Design & Test
Filter Trees for Managing Spatial Data over a Range of Size Granularities
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Localized set operations for solid modeling
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
A data-structuring technique for gridded VLSI layouts
EURO-DAC '90 Proceedings of the conference on European design automation
Restructuring VLSI layout representations for efficiency
EURO-DAC '91 Proceedings of the conference on European design automation
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Efficient query routing in distributed spatial databases
Proceedings of the 12th annual ACM international workshop on Geographic information systems
An efficient nearest neighbor algorithm for P2P settings
dg.o '05 Proceedings of the 2005 national conference on Digital government research
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
ACM Transactions on Database Systems (TODS)
A sorting approach to indexing spatial data
ACM SIGGRAPH 2008 classes
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
ACM SIGGRAPH ASIA 2010 Courses
An efficient quad-tree based index structure for cloud data management
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Semantic information retrieval in the COMPASS location system
UCS'06 Proceedings of the Third international conference on Ubiquitous Computing Systems
Overlaying multiple maps efficiently
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Content-addressable memories for quadtree-based images
EGGH'88 Proceedings of the Third Eurographics conference on Advances in Computer Graphics Hardware
Indexing methods for moving object databases: games and other applications
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
In this paper we describe the quad-CIF tree data structure and its application to hierarchical on-line computer-aided design algorithms. The main idea is to overlay a tree of coordinates on top of the hierarchical representation of an integrated circuit. The coordinate tree enables one to find quickly the set of all objects that intersect a given window. We outline how one can use the data structure in order to implement hierarchical, on-line design rule checking and node extraction. We also describe some applications to plotting.