Contour trees are used when high-dimensional data are preprocessed for efficient extraction
of isocontours for the purpose of visualization. So far, efficient algorithms for contour trees …

One of the most effective techniques for develo** efficient isosurfacing algorithms is the
reduction of visits to nonisosurface cells. Recent algorithms have drastically reduced the …

We revisit the classical problem of computing the contour tree of a scalar field f: M → R f: M→
R, where MM is a triangulation of a ball in R^ d R d. The contour tree is a fundamental …

Consider a scalar field f: M→ R, where M is a triangulated simplicial mesh in Rd. A level set,
or contour, at value v is a connected component of f–1 (v). As v is changed, these contours …

Isosurface extraction is one of the most powerful techniques in the investigation of volume
datasets in scientific visualization. The contour tree is a fundamental data structure for fast …

Morse theory relates the contour topology changes to critical points in the underlying scalar
fields. We describe a simple algorithm that can decrease the number of critical points in a …

Many computational problems arise naturally from geometric data. In this thesis, we consider
three such problems:(i) distance optimization problems over point sets,(ii) computing contour …

To present the spatio/temporal data from oceanographic modeling in GIS has been a
challenging task due to the highly dynamic characteristic and complex pattern of variables …

The display of a large number of points, distributed over the plane, is a classic visualization
problem. Available space is usually limited, which means a simple plot of the points (known …

Understanding isosurfaces and contours (their connected components) is important for the
analysis as well as effective visualization of 3D scalar fields. The topological changes that …