Selected papers that cite this one
- David Eppstein. Dynamic connectivity in digital images. Information Processing Letters, 62(3):121-126, 14 May 1997.
- Christophe Fiorio and Jens Gustedt. Two linear time Union-Find strategies for image processing. Theoretical Computer Science, 154(2):165-181, 5 February 1996.
- Jens Gustedt. Efficient Union-Find for planar graphs and other sparse graph classes. Theoretical Computer Science, 203(1):123-141, 6 August 1998.
Selected references
- Michael B. Dillencourt, Hannan Samet, and Markku Tamminen. A general approach to connected-component labeling for arbitrary image representations. Journal of the ACM, 39(2):253-280, April 1992.