A New Region Expansion for Quadtrees

Authors:
C.-H. Ang;H. Samet;C. A. Shaffer
Affiliations:
-;-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1990

Citing 8
Cited 4

Dilation algorithm for a linear quadtree

Image and Vision Computing
Algorithm to expand regions represented by linear quadtrees

Image and Vision Computing
Analysis and applications of hierarchical data structures

Analysis and applications of hierarchical data structures
Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures

The design and analysis of spatial data structures
An effective way to represent quadtrees

Communications of the ACM
Digital Picture Processing

Digital Picture Processing
Efficient computation and data structures for graphics.

Efficient computation and data structures for graphics.

Efficient Regular Data Structures and Algorithms for Location and Proximity Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Database and Representation Issues in Geographic Information Systems (GIS)

W2GIS '09 Proceedings of the 9th International Symposium on Web and Wireless Geographical Information Systems
Multidimensional data structures for spatial applications

Algorithms and theory of computation handbook
Representing and segmenting 2d images by means of planar maps with discrete embeddings: from model to applications

GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition

Quantified Score

Hi-index	0.14

Visualization

Abstract

A one-pass algorithm that performs region expansion in images represented by quadtrees is presented. The algorithm changes to black those white pixels within a specified distance of any black mode in the image. The algorithm yields a significant improvement over previous approaches by reducing both the number of black nodes that must be considered for expansion and the number of nodes that must be inserted as a result of the expansion. The reductions are achieved by introducing the concepts of a merging cluster and a vertex set. Empirical tests show that the execution time of this algorithm generally decreases as the radius of expansion increases, whereas in previous approaches the execution time generally increased with the radius of expansion.