, Proc. Ist Arm. ACM-SIAM Symp. on Discrete Algorithms (SIAM, Philadelphia, 1990.
A complement to Tarjan's result about the lower bound on the complexity of the set Union Problem, Irrform. Process. Lett, vol.11, pp.59-65, 1980. ,
A general approach to connected-component labeling for arbitrary image representations, r. ACM, vol.39, pp.985-986, 1992. ,
A linear-time algorithm for a special case of disjoint set Union, J. Comput. System Sei, vol.30, pp.209-221, 1984. ,
Survey: image Segmentation techniques, Comput. Vision Graphits Image Process, vol.29, pp.100-132, 1985. ,
Lower bounds for the Union-find and the Split-find Problem on pointer machines, 1989. ,
New techniques for the Union-find Problem, 1989. ,
54-63, extended abstract of c71. J.A. La Poutre, Dynamit graph algorithms and data structures, 1990. ,
, Data Structures and Algorithms 1: Sorting and Searching, 1984.
Data structures, pp.301-314 ,
Segmentation d'images: vers une methodologie, Traitement du Signal, vol.4, pp.169-193, 1987. ,
Experimental evaluation of techniques for automatic Segmentation of objects in a complex Scene, Pictorial Pattern Recognition, pp.3-13, 1968. ,
Several approaches to implement the merging step of the Split and merge region Segmentation, EURO-GRAPHICS'91, pp.399-412, 1991. ,
Efficiency of a good but not linear set Union algorithm, J. ACM, vol.22, pp.215-225, 1975. ,
A class of algorithms which require non-linear time to maintain disjoint Sets, J. Comgut. System Sei, vol.18, pp.110-127, 1979. ,
Worst-case analysis of set union algorithms, J. ACM, vol.31, pp.245-281, 1984. ,
, Handbook of Theoretical Computer Science, 1990.
Survey: region growing: childhood and adolescence, Comput. Grnphics Image Process, vol.5, pp.382-399, 1976. ,