Asset Details
Do you wish to reserve the book?
Contour Trees
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Contour Trees
Do you wish to request the book?
Contour Trees
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Book Chapter
Contour Trees
2013
Overview
Let φ : D → R be a continuous scalar field where D is a rectangular region in
R
d. More generally, D is homeomorphic to a closed ball in Rd. A connectedcomponent of a level set φ−1(σ) is a maximally connected subset of φ−1(σ),
i.e., a connected subset of φ−1(σ) that is not contained in any other connected
subset of φ−1(σ). As σ changes, the connected components of φ−1(σ) change.
New components appear, existing components disappear, multiple components
join together to form one component, or a single component splits apart into
multiple components. A contour tree is a graph that represents these components
and their changes.
Publisher
A K Peters/CRC Press,CRC Press LLC
ISBN
1466570970, 9781466570979
