Translator Disclaimer
8 March 1996 Error-bounded reduction of triangle meshes with multivariate data
Author Affiliations +
Interactive visualization is complicated by the complexity of the objects being visualized. Sampled or computed scientific data is often dense, in order to capture high frequency components in measured data or to accurately model a physical process. Common visualization techniques such as isosurfacing on such large meshes generate more geometric primitives than can be rendered in an interactive environment. Geometric mesh reduction techniques have been developed in order to reduce the size of a mesh with little compromise in image quality. Similar techniques have been used for functional surfaces (terrain maps) which take advantage of the planar projection. We extend these methods to arbitrary surfaces in 3D and to any number of variables defined over the mesh by developing a algorithm for mapping from a surface mesh to a reduced representation and measuring the introduced error in both the geometry and the multivariate data. Furthermore, through error propagation, our algorithm ensures that the errors in both the geometric representation and multivariate data do not exceed a user-specified upper bound.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chandrajit L. Bajaj and Daniel R. Schikore "Error-bounded reduction of triangle meshes with multivariate data", Proc. SPIE 2656, Visual Data Exploration and Analysis III, (8 March 1996);

Back to Top