This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computing Perimeters of Regions in Images Represented by Quadtrees
June 1981 (vol. 3 no. 6)
pp. 683-687
Hanan Samet, Department of Computer Science, University of Maryland, College Park, MD 20742.
An algorithm is presented for computing the total perimeter of a region in a binary image represented by a quadtree. The algorithm explores each segment of the boundary of the region once and only once. Analysis of the algorithm shows that its average execution time is proportional to the number of leaf nodes in the quadtree.
Citation:
Hanan Samet, "Computing Perimeters of Regions in Images Represented by Quadtrees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 6, pp. 683-687, June 1981, doi:10.1109/TPAMI.1981.4767171
Usage of this product signifies your acceptance of the Terms of Use.