Skip to Main content Skip to Navigation
Journal articles

Two Linear Time Union-Find Strategies for Image Processing

Christophe Fiorio 1 Jens Gustedt 2 
1 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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).
Document type :
Journal articles
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Jens Gustedt Connect in order to contact the contributor
Submitted on : Thursday, September 5, 2019 - 11:54:34 AM
Last modification on : Tuesday, September 6, 2022 - 5:00:28 PM
Long-term archiving on: : Thursday, February 6, 2020 - 2:02:24 AM


Publisher files allowed on an open archive




Christophe Fiorio, Jens Gustedt. Two Linear Time Union-Find Strategies for Image Processing. Theoretical Computer Science, Elsevier, 1996, 154 (2), pp.165-181. ⟨10.1016/0304-3975(94)00262-2⟩. ⟨inria-00549539⟩



Record views


Files downloads