Thumbnail
Access Restriction
Subscribed

Author Geuk Lee ♦ Hee Yeung Hwang
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1993
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Image coding ♦ Labeling ♦ Solids ♦ Computer displays ♦ Orbital robotics ♦ Availability ♦ Block codes ♦ Facsimile
Abstract This paper proposes the method which traverses and codes the quadtree by breadth first. Quadtree coded by breadth first (breadth first quadtree) has the same compression ratio with the quadtree coded by depth first (depth first quadtree). In breadth first quadtree, nodes in high level and low level appear in level by level, not at random. This makes it better for operation efficiency, especially in geometric property operation (perimeter calculation, area calculation, search, object labelling, neighbor finding) which needs long operation time. In this paper we show the advantage of breadth first quadtree by the worst case analysis and the general case analysis.
Description Author affiliation: Han Nam Univ., Dae Jeon, South Korea (Geuk Lee)
ISBN 0780312333
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1993-10-19
Publisher Place China
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 249.22 kB
Page Count 4
Starting Page 660
Ending Page 663


Source: IEEE Xplore Digital Library