A general approach to connected-component labeling for arbitrary image representations

DOI10.1145/128749.128750MaRDI QIDQ4302798zbMATH OpenOpenAlexWikidataFDO

Authors Michael B. Dillencourt, H. Samet, Markku Tamminen

Publication date 29 September 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/128749.128750

zbMATH Keywords

connected component labelingimage representations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)

Cited in

(6)

• Efficient Union-Find for planar graphs and other sparse graph classes
• An automatic cognitive graph-based segmentation for detection of blood vessels in retinal images
• scientific article; zbMATH DE number 1810462 (Why is no real title available?)
• Memory management for union-find algorithms
• Efficient union-find for planar graphs and other sparse graph classes (extended abstract)
• Two linear time Union--Find strategies for image processing

This page was built for publication: A general approach to connected-component labeling for arbitrary image representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302798)