Skip to main content

Merging the Component Trees

  • 819 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1984)

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, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   37.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vicent Caselles .

Rights and permissions

Reprints 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