Extended algorithm to construct a quadtree from Freeman chain code in four directions

Andrej Nerat, Damjan Strnad, Eva Zupančič, Borut Žalik


This paper introduces improvements to the algorithm that was proposed in 2001 by Chen and Chen. The algorithm constructs a quadtree directly from Freeman chain code in four directions. We have improved the algorithm in two ways: Firstly, a time efficient solution using the space filling Z-order curve is proposed for a self-intersection case that was not considered by Chen and Chen. Secondly, the algorithm is expanded to handle geometric objects containing holes. The computational efficiency of the extended algorithm was confirmed by the experiments.

chain code; quadtree; chain code to quadtree conversion; space filling curve; Z-order curve

Full Text:


DOI: 10.5566/ias.2095

Copyright (c) 2019 Image Analysis & Stereology

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Image Analysis & Stereology
EISSN 1854-5165 (Electronic version)
ISSN 1580-3139 (Printed version)