An adaptive algorithm is presented for converting the quadtree representation of a binary image to its chain code representation. Our algorithm has the advantage of constructing the chain codes of the resulting quadtree of the Boolean operation of two quadtrees by re-using the original chain codes.
An optimal boundary to quadtree conversion algorithm
β Scribed by Mark R. Lattanzi; Clifford A. Shaffer
- Publisher
- Elsevier Science
- Year
- 1991
- Weight
- 1002 KB
- Volume
- 53
- Category
- Article
- ISSN
- 1049-9660
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The O(h 4) finite-difference scheme for the second derivative u"(x) leads to a coherent pentadiagonal matrix which is factorized into two tridiagonal matrices. This factorization is used to derive an optimal algorithm for solving a linear system of equations with the pentadiagonal matrix. As an appl
The problem of finding optimal diameter double loop networks with a fixed number of vertices has been widely studied. In this work, we give an algorithmic solution of the problem by using a geometrical approach. Given a fixed number of vertices n, the general problem is to find "steps" s 1 , s z e