Set operations on constant bit-length linear quadtrees

Authors:
Tsong-Wuu Lin
Affiliations:
Department of Information and Computer Science, Soochow University, No. 56, Kwei-Yang Street, Section 1, Taipei 10001, Taiwan, R.O.C.
Venue:
Pattern Recognition
Year:
1997

Citing 11
Cited 3

Determination of the 3D border by repeated elimination of internal surfaces

Computing
Recent developments in linear quadtree-based geographic information systems

Image and Vision Computing
A general PASCAL program for map overlay of quadtrees and related problems

The Computer Journal
Set operations for unaligned linear quadtrees

Computer Vision, Graphics, and Image Processing
The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
An effective way to represent quadtrees

Communications of the ACM
Region representation: quadtrees from boundary codes

Communications of the ACM
A Model for the Analysis of Neighbor Finding in Pointer-Based Quadtrees

IEEE Transactions on Pattern Analysis and Machine Intelligence
Depth-First Picture Expression Viewed from Digital Picture Processing

IEEE Transactions on Pattern Analysis and Machine Intelligence
Operations on Images Using Quad Trees

IEEE Transactions on Pattern Analysis and Machine Intelligence
On a Method of Binary-Picture Representation and Its Application to Data Compression

IEEE Transactions on Pattern Analysis and Machine Intelligence

An efficient data structure for storing similar binary images

Information organization and databases
Variant code transformations for linear quadtrees

Pattern Recognition Letters
A hybrid gray image representation using spatial- and DCT-based approach with application to moment computation

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.01

Visualization

Abstract

The constant Bit-length Linear Quadtree (CBLQ) is a new encoding scheme for representing binary images. The representation keeps the level of detail property, and it makes the CBLQ suitable for interactive application systems. Based on the CBLQ representation, action tables for set operations are derived. A new algorithm using these derived tables is proposed. The time complexity of the algorithm is linear. A control scheme is also presented to keep the level of detail property in the algorithm. Therefore the algorithm can be used in the interactive application systems