Adjacency in Digital Pictures.
MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER
Pagination or Media Count:
Let S be a subset of a digital picture, and let S bar be the complement of S. It is well known that the connected components of S and S bar, under the relation is adjacent to, form a tree, and algorithms for constructing this tree have been devised. The main purpose of the paper is to prove that the components do form a tree, and in the process, to provide a basis for proving the validity of the tree-constructing algorithms. Author
- Computer Hardware