Procedural elements for computer graphics
Procedural elements for computer graphics
The connection machine
Connected component labelling using quadtrees—a bottom-up approach
The Computer Journal
Optimal quadtree construction algorithms
Computer Vision, Graphics, and Image Processing
Connected Component Labeling Using Quadtrees
Journal of the ACM (JACM)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
An effective way to represent quadtrees
Communications of the ACM
Introduction to VLSI Systems
The quad-CIF tree: A data structure for hierarchical on-line algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
Content-Addressable Read/Write Memories for Image Analysis
IEEE Transactions on Computers
Associative memory with ordered retrieval
IBM Journal of Research and Development
Computing Geometric Properties of Images Represented by Linear Quadtrees
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
Quadtrees are attractive for storing and processing mages with area coherence, but performance has been limited by software overheads. A Content-Addressable Memory (CAM) with ternary storage allows single-cycle searches by pixel coordinate, quadrant or rectangle. To use thiS feature effectively the authors have reviewed a range of quadtree processing functions relevant to computer graphics and Image processing, and some new algorithms have been discovere. The proposed VLSI chip has microcoded logic on each row, as well as its CAM cells. This architecture has been simulated in fine detail with the aid of the Connection Machine as well as by much slower, conventional computers. The combination of quadtrees and CAMs offers significant improvement in performance for display systems and image processing.