Computing contour trees in all dimensions

13 years 5 months ago

Download www.comp.leeds.ac.uk

We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyalyi and of van Kreveld et al.

Hamish Carr, Jack Snoeyink, Ulrike Axen

Real-time Traffic

Algorithms | Contour Trees | Simple Algorithm | SODA 2000 | Van Kreveld Et |

claim paper

» Subdomain Aware Contour Trees and Contour Evolution in TimeDependent Scalar Fields

» Retinal vessel tree segmentation using a deformable contour model

» Computing the Stretch Factor of Paths Trees and Cycles in Weighted Fixed Orientation Metri...

» IsoContour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks

» Maximizing NonLinear Concave Functions in Fixed Dimension

» Approximate Tree Kernels

» On Unfolding Lattice PolygonsTrees and Diameter4 Trees

» Nearest Neighbor Search Using Additive Binary Tree

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	SODA
Authors	Hamish Carr, Jack Snoeyink, Ulrike Axen

Comments (0)

Sciweavers

Computing contour trees in all dimensions

Algorithms | Contour Trees | Simple Algorithm | SODA 2000 | Van Kreveld Et |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers