Level of detail visualization of scalar data sets on irregular surface meshes

In this article, we build a multi-resolution framework intended to be used for the visualization of continuous piecewise linear functions defined over triangular planar or spherical meshes. In particular, the data set can be viewed at different level of detail, that's to say as a piecewise linear function defined over any simplification of the base mesh. In his multi-resolution form, the function requires strictly the same volume of data than the original input: It is then possible to go through consecutive levels by the use of so-called detail coefficients, with exact reconstruction if desired. We also show how to choose a decimation sequence that leads to a good compromise between the resulting approximation error and the number of removed vertices. The theoretical tools used here are inspired from wavelet-based techniques and extended in the sense that they can handle non-nested approximation spaces.

[1]  Chandrajit L. Bajaj,et al.  Error-bounded reduction of triangle meshes with multivariate data , 1996, Electronic Imaging.

[2]  Gregory M. Nielson,et al.  BLaC-wavelets: a multiresolution analysis with non-nested spaces , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[3]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[4]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

[5]  Georges-Pierre Bonneau,et al.  Hierarchical decomposition of datasets on irregular surface meshes , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).

[6]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[7]  Leila De Floriani,et al.  A pyramidal data structure for triangle-based surface description , 1989, IEEE Computer Graphics and Applications.

[8]  Peter Schröder,et al.  Spherical wavelets: efficiently representing functions on the sphere , 1995, SIGGRAPH.