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

DOI10.5566/IAS.2095zbMATH Open1455.94032OpenAlexW2994717371MaRDI QIDQ5219062FDOQ5219062

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

Publication date: 6 March 2020

Published in: Image Analysis & Stereology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5566/ias.2095

Recommendations

• scientific article; zbMATH DE number 743877
• Coding of geometric configurations using quadtrees
• scientific article; zbMATH DE number 3852447
• Efficient Coding of Quadtree Nodes
• scientific article; zbMATH DE number 1305402
• Quad-\(K\)-d trees
• scientific article; zbMATH DE number 1304789
• Constructing optimal trees from quartets
• Fringed-quadtrees: a new kind of data structure

zbMATH Keywords

quadtreespace filling curvechain code\(\mathbb{Z}\)-order curvechain code to quadtree conversion

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

This page was built for publication: Extended algorithm to construct a quadtree from Freeman chain code in four directions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219062)