Selected papers that cite this one
- P. K. Agarwal and M. van Kreveld. Connected component and simple polygon intersection searching. Algorithmica, 15(6):626-660, June 1996.
- M. B. Dillencourt, H. Samet, and M. Tamminen. Corrigenda: ``A general approach to connected component labeling for arbitrary image representations''. Journal of the ACM, 39(4):985-986, October 1992.
- Christophe Fiorio and Jens Gustedt. Two linear time Union-Find strategies for image processing. Theoretical Computer Science, 154(2):165-181, 5 February 1996.
Selected references
- Azriel Rosenfeld and John L. Pfaltz. Sequential operations in digital picture processing. Journal of the ACM, 13(4):471-494, October 1966.
- Hanan Samet. Connected component labeling using quadtrees. Journal of the ACM, 28(3):487-501, July 1981.
- Robert Endre Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215-225, April 1975.
- Robert E. Tarjan and Jan van Leeuwen. Worst-case analysis of set union algorithms. Journal of the ACM, 31(2):245-281, April 1984.