The extended binary tree representation of binary image and its application to engineering drawing entry

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.<>