Abstract
Chapter 2 started by presenting the tree of shapes as a fusion of the tree of connected components of upper level sets and the tree of connected components of lower level sets, known commonly as the component trees. We come back in this chapter to a constructive study of this fusion, leading to an algorithm applicable in any dimension. Direct and more efficient algorithms, specific to dimension 2, are presented in following chapters. However, the generality of the algorithm presented here and its natural implementation as the result of merging the component trees make it interesting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Caselles, V., Monasse, P. (2010). Merging the Component Trees. In: Geometric Description of Images as Topographic Maps. Lecture Notes in Mathematics(), vol 1984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04611-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-04611-7_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04610-0
Online ISBN: 978-3-642-04611-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)