This work presents an elegant and simple to implement framework for performing out-of-core visualization and view-dependent refinement of large terrain surfaces, and shows how this framework supports virtually any error metric, while still being highly memory and compute efficient.Expand

Resampling raw surface meshes is one of the most fundamental operations used by nearly all digital geometry processing systems. The vast majority of this work has focused on triangular remeshing, yet… Expand

It is shown that visualization of gigabyte-size data sets can be realized even on low-end, commodity PCs without the need for complicated and explicit data paging techniques, by virtue of dramatic improvements in multilevel cache coherence.Expand

This paper gives the first methods to obtain seed sets that are provably small in size based on a variant of the contour tree (or topographic change tree), and develops a simple approximation algorithm giving a seed set of size at most twice the size of the minimum once the contours tree is known.Expand

This work combines topological and geometric methods to construct a multiresolution representation for a function over a two-dimensional domain and uses this data structure to extract topologically valid approximations that satisfy error bounds provided at runtime.Expand

This work describes a fundamentally new approach to the quadrangulation of manifold polygon meshes using Laplacian eigenfunctions, the natural harmonics of the surface, to construct a well-shaped quadrilateral mesh with very few extraordinary vertices.Expand

An isocontouring algorithm which is near-optimal for real-time interaction and modification of isovalues in large datasets and a specialized algorithm suitable for meshes of regular topology, including rectilinear and curvilinear meshes is described.Expand

Tight upper and lower bounds are proved on the number of loops in the Reeb graph that depend on the genus, number of boundary components, and whether or not the 2-manifold is orientable.Expand

This work combines topological and geometric methods to construct a multi-resolution data structure for functions over two-dimensional domains and creates a geometric hierarchy by adapting the geometry to the changes in topology.Expand

The Contour Tree of a scalar field is the graph obtained by contracting all the connected components of the level sets of the field into points. This is a powerful abstraction for representing the… Expand