Skip Navigation

The Computer Journal 1997 40(7):435-440; doi:10.1093/comjnl/40.7.435
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pan, Y.
Right arrow Articles by Vaidyanathan, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Scalable and Efficient Algorithm for Computing the City Block Distance Transform on Reconfigurable Meshes

Y. Pan1, J. L. Trahan2 and R. Vaidyanathan2

1 Department of Computer Science, University of Dayton, Dayton, OH 45469-2160, USA Email: pan{at}cps.udayton.edu, 2 Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA 70803-5901, USA

The distance transform is a basic operation in computer vision, pattern recognition and robotics. In this paper, we consider the city block (L1) distance metric. An algorithm for computing the city block distance transform on reconfigurable meshes is proposed in this paper. The time complexity and scalability of the algorithm are analysed. The results indicate that the algorithm is scalable and efficient.

Received February 2, 1997. revised October 19, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.