Minimal Component-Hypertrees

DOI10.1007/978-3-030-14085-4_22OpenAlexW2916587901MaRDI QIDQ5237070

Charles Ferreira Gobber, Alexandre Morimitsu, Dennis Jose Silva, Wonder Alexandre Luz Alves, Ronaldo Fumio Hashimoto

Publication date: 16 October 2019

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_22

zbMATH Keywords

mathematical morphologyconnected componentconnected operatorscomponent treecomponent-hypertree

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Connectivity on complete lattices
• Incremental and Efficient Computation of Families of Component Trees
• Component-Hypertrees for Image Segmentation
• Efficiency of a Good But Not Linear Set Union Algorithm
• A Comparative Review of Component Tree Computation Algorithms

This page was built for publication: Minimal Component-Hypertrees