Skip Navigation

The Computer Journal 1987 30(2):176-182; doi:10.1093/comjnl/30.2.176
© 1987 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 (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Unnikrishnan, A.
Right arrow Articles by Shankar, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Connected Component Labelling using Quadtrees – A Bottom-up Approach

A. Unnikrishnan *, Y. V. Venkatesh * and P. Shankar *

Indian Institute of Science, Bangalore 560012, India

An algorithm to label the connected components of a binary picture is presented using a hierarchical version of the linear quadtree.2 This algorithm, which starts from the lowest level of the hierarchy, is shown to be computationally faster than the one using the topmost level as the starting point. The computational complexity of the algorithm appears comparable to that of existing methods due to Gargantini and Samet.4,5

Received April 1985.

* Indian Institute of Science, Bangalore 560012, India


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.