Two linear time Union-Find strategies for image processing
- 10 February 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 154 (2) , 165-181
- https://doi.org/10.1016/0304-3975(94)00262-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Image segmentation techniquesPublished by Elsevier ,2006
- Lower Bounds for the Union–Find and the Split–Find Problem on Pointer MachinesJournal of Computer and System Sciences, 1996
- Corrigenda: M. B. Dillencourt, H. Samet, and M. Tamminen,Journal of the ACM, 1992
- A general approach to connected-component labeling for arbitrary image representationsJournal of the ACM, 1992
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A complement to Tarjan's result about the lower bound on the complexity of the set union problemInformation Processing Letters, 1980
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Region growing: Childhood and adolescenceComputer Graphics and Image Processing, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975