{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:50:11Z","timestamp":1759042211626},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"1402034423"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-3443-1_11","type":"book-chapter","created":{"date-parts":[[2005,7,28]],"date-time":"2005-07-28T08:35:57Z","timestamp":1122539757000},"page":"105-116","source":"Crossref","is-referenced-by-count":6,"title":["Ruminations on Tarjan\u2019s Union-Find Algorithm and Connected Operators"],"prefix":"10.1007","author":[{"given":"Thierry","family":"G\u00e9raud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"J. Darbon, T. G\u00e9raud, and A. Duret-Lutz. Generic implementation of morphological image operators. In Mathematical Morphology, Proc. of ISMM, pages 175\u2013184. Sciro, 2002."},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/128749.128750","volume":"39","author":"M. Dillencourt","year":"1992","unstructured":"M. Dillencourt, H. Samet, and M. Tamminen. A general approach to connected-components labeling for arbitrary image representations. Journal of the ACM, 39(2):253\u2013280, 1992.","journal-title":"Journal of the ACM"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1023\/A:1020726725590","volume":"17","author":"H. Heijmans","year":"2002","unstructured":"H. Heijmans and R. Keshet. Inf-semilattice approach to self-dual morphology. Journal of Mathematical Imaging and Vision, 17(1):55\u201380, 2002.","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"1\u20132","key":"11_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.ipl.2003.08.003","volume":"88","author":"W. H. Hesselink","year":"2003","unstructured":"W. H. Hesselink. Salembier\u2019s min-tree algorithm turned into breadth first search. Information Processing Letters, 88(1\u20132):225\u2013229, 2003.","journal-title":"Information Processing Letters"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"A. Mehnert and P Jackway. Folding induced self-dual filters. In Mathematical Morphology and its Applications to Image and Signal Processing, pages 99\u2013108, 2000.","DOI":"10.1007\/0-306-47025-X_12"},{"key":"11_CR6","unstructured":"A. Meijster and J. Roerdink. A disjoint set algorithm for the watershed transform. In EUSIPCO IX European Signal Processing Conference, pages 1665\u20131668, 1998."},{"issue":"4","key":"11_CR7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/34.993556","volume":"24","author":"A. Meijster","year":"2002","unstructured":"A. Meijster and M. Wilkinson. A comparison of algorithms for connected set openings and closings. IEEE Trans. on PAMI, 24(4):484\u2013494, 2002.","journal-title":"IEEE Trans. on PAMI"},{"key":"11_CR8","unstructured":"F. Meyer. From connected operators to levelings. In Mathematical Morphology and its Applications to Image and Signal Processing, pages 191\u2013198. Kluwer, 1998."},{"key":"11_CR9","unstructured":"F. Meyer. The levelings. In Mathematical Morphology and its Applications to Image and Signal Processing, pages 199\u2013206. Kluwer, 1998."},{"issue":"1\u20132","key":"11_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/B:JMIV.0000011319.21884.39","volume":"20","author":"F. Meyer","year":"2004","unstructured":"F. Meyer. Levelings, image simplification filters for segmentation. Journal of Mathematical Imaging and Vision, 20(1\u20132):59\u201372, 2004.","journal-title":"Journal of Mathematical Imaging and Vision"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"L. Najman and M. Couprie. Quasi-linear algorithm for the component tree. In IS&T\/SPIE Symposium on Electronic Imaging, In Vision Geometry XII, pages 18\u201322, 2004.","DOI":"10.1117\/12.526592"},{"key":"11_CR12","volume-title":"Generic C++ image processing library","author":"Olena.","year":"2005","unstructured":"Olena. Generic C++ image processing library, http:\/\/olena.lrde.epita.fr, free software available under GNU Public Licence, EPITA Research and Development Laboratory, France, 2005."},{"issue":"1\u20132","key":"11_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3233\/FI-2000-411207","volume":"41","author":"J. B. Roerdink","year":"2000","unstructured":"J. B. Roerdink and A. Meijster. The watershed transform: Definitions, algorithms and parallelization strategies. Fundamenta Informaticae, 41(1\u20132):187\u2013228, 2000.","journal-title":"Fundamenta Informaticae"},{"key":"11_CR14","unstructured":"P. Salembier and J. Ruiz. On filters by reconstruction for size and motion simplification. In Mathematical Morphology, Proc. of ISMM, pages 425\u2013434. Sciro Publishing, 2002."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"P. Soille. Morphological Image Analysis. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-662-03939-7"},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. E. Tarjan","year":"1975","unstructured":"R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215\u2013225, 1975.","journal-title":"Journal of the ACM"},{"key":"11_CR17","first-page":"676","volume":"3","author":"C. Vachier","year":"2001","unstructured":"C. Vachier. Morphological Scale-Space Analysis and Feature Extraction. In IEEE Intl. Conf. on Image Processing, volume 3, pages 676\u2013679, October 2001.","journal-title":"IEEE Intl. Conf. on Image Processing"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/83.217222","volume":"2","author":"L. Vincent","year":"1993","unstructured":"L. Vincent. Morphological grayscale reconstruction in image analysis: Applications and efficient algorithms. IEEE Trans. on Image Processing, 2(2):176\u2013201, 1993.","journal-title":"IEEE Trans. on Image Processing"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"M. Wilkinson and J. Roerdink. Fast morphological attribute operations using tarjan\u2019s union-find algorithm. In Mathematical Morphology and its Applications to Image and Signal Processing, Proc. of ISMM, pages 311\u2013320, 2000.","DOI":"10.1007\/0-306-47025-X_34"}],"container-title":["Computational Imaging and Vision","Mathematical Morphology: 40 Years On"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-3443-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T19:40:54Z","timestamp":1619552454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-3443-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402034423"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/1-4020-3443-1_11","relation":{},"subject":[]}}