Name
Abstract | ||
|---|---|---|
A distance measure is defined for a quadtree representation of a binary image. An algorithm is presented that calculates the distance from the center of each black node to the border of the nearest white node. The distance is defined as the path length from the center of the black node, through the center of intervening black nodes, to the white border. The worst-case average execution time is shown to be proportional to the product of the logarithm of the image diameter and the number of blocks in the image. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1016/0020-0255(81)90040-2 | Information Sciences |
Field | DocType | Volume |
Discrete mathematics,Path length,Binary image,Execution time,Logarithm,Mathematics,Quadtree | Journal | 23 |
Issue | ISSN | Citations |
1 | 0020-0255 | 11 |
PageRank | References | Authors |
18.72 | 3 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Shneier | 1 | 257 | 52.18 |