DocumentCode
3377696
Title
The extended binary tree representation of binary image and its application to engineering drawing entry
Author
Yu, Bin ; Lin, Xinggang
Author_Institution
Dept. of Electron. Eng., Tsinghua Univ., Beijing, China
Volume
ii
fYear
1990
fDate
16-21 Jun 1990
Firstpage
109
Abstract
A kind of tree structure called extended binary tree (EBT) is presented to represent the line adjacency graph (LAG) in order to reduce the computational complexities of LAG-based algorithms in binary image processing. The traversal and the storage of the EBT are discussed. Applications of the structure in engineering drawing entry are shown
Keywords
computational complexity; computer graphics; computerised picture processing; data structures; trees (mathematics); binary image; engineering drawing entry; extended binary tree representation; line adjacency graph; storage; traversal; Application software; Binary trees; Computational complexity; Engineering drawings; Image processing; Joining processes; Least squares approximation; Pixel; Tree data structures; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1990. Proceedings., 10th International Conference on
Conference_Location
Atlantic City, NJ
Print_ISBN
0-8186-2062-5
Type
conf
DOI
10.1109/ICPR.1990.119339
Filename
119339
Link To Document