Paper Info
Title
Two linear time Union-Find strategies for image processing
Abstract
We consider Union-Find as an appropriate data structure to obtain two linear time algorithms for the segmentation of images. The linearity is obtained by restricting the order in which Union's are performed. For one algorithm the complexity bound is proven by amortizing the Find operations. For the other we use periodic updates to keep the relevant part of our Union-Find-tree of constant height. Both algorithms are generalized and lead to new linear strategies for Union-Find that are neither covered by the algorithm of Gabow and Tarjan (1984) nor by the one of Dillencourt et al. (1992).
Year
DOI
Venue
1996
10.1016/0304-3975(94)00262-2
Theor. Comput. Sci.
Keywords
DocType
Volume
linear time Union-Find strategy,image processing
Journal
154
Issue
ISSN
Citations 
2
Theoretical Computer Science
62
PageRank 
References 
Authors
6.36
7
2
Name
Order
Citations
PageRank
Christophe Fiorio119723.27
Jens Gustedt235435.74