35 search results - page 1 / 7 » Computing contour trees in all dimensions |
SODA
2000
ACM
13 years 6 months ago
2000
ACM
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 Vyaly...
COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
our tree is an abstraction of a scalar field that encodes the nesting relationships of isosurfaces. We show how to use the contour tree to represent individual contours of a scala...
SMI
2005
IEEE
13 years 10 months ago
2005
IEEE
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents an improved version of our specific methodology to detect the vessel tree in retinal angiographies. The automatic analysis of retinal vessel tree facilitates ...
CCCG
2008
13 years 6 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...