Multiresolution tetrahedral meshes: an analysis and a comparison

The paper deals with the problem of analyzing and visualizing large-size volume data sets. To this aim, we consider multiresolution representations based on a decomposition of the field domain into tetrahedral cells. We compare two types of multiresolution representations that differ on the rule applied to refine an initial coarse mesh: one is based on tetrahedron bisection, and one based on vertex split. The two representations can be viewed as instances of a common multiresolution model, that we call a multiresolution mesh. Encoding data structures for the two representations are briefly described. An experimental comparison on structured volume data sets is presented.

Multi-resolution out-of-core modeling of terrain and geological data

Multi-resolution is a useful tool for managing the complexity of huge terrain and geological data sets. Since encoding large data sets may easily exceed main memory capabilities, data structures and algorithms capable of efficiently working in external memory are needed. In our work, we aim at developing an out-of-core multi-resolution model dimensionindependent, that can be used for both terrains, represented by Triangulated Irregular Networks(TINs), and 3D data, such as geological data, represented by tetrahedral meshes. We have based our approach on a general multi-resolution model, that we have proposed in our previous work, which supports the extraction of variable-resolution representations. As first step, we have developed, in a prototype simulation system, a large number of clustering techniques for the modifications in a multi-resolution model. Here, we describe such techniques, and analyze and evaluate them experimentally. The result of this investigation has led us to select a specific clustering approach as the basis for an efficient out-of-core data structure

Clustering Techniques for Out-of-Core Multi-resolution Modeling

Thanks to improvements in simulation tools, high resolutio

2 Out-of-core Multi-resolution Terrain Modeling

In this chapter we discuss issues about Level Of Detail (LOD) representations for digital terrain models and, especially, we describe how to deal with very large terrain datasets through out-of-core techniques that explicitly manage I/O operations between levels of memory. LOD modeling in the related context of geographical map

Multiresolution Morse Triangulations

none4We address the problem of representing the geometry and the morphology of a triangulated surface endowed with a scalar field in a combined geometric and topological multiresolution model. The model, called a Multiresolution Morse Triangulation (MMT), is composed of a multiresolution triangle mesh, and of a multiresolution Morse complex describing the morphology of the field. The MMT is built through a combined morphological and geometrical generalization, and supports queries to extract consistent geometrical and morphological representations of the field at both uniform and variable resolutions.E.Danovaro; L.De Floriani; P.Magillo; M.VitaliDanovaro, Emanuele; DE FLORIANI, Leila; Magillo, Paola; M., Vital

Representing Vertex-Based Simplicial Multi-Complexes

In this paper, we consider the problem of representing a multiresolution geometric model, called a Simplicial Multi-Complex (SMC), in a compact way. We present encoding schemes for both two- and three-dimensional SMCs built through a vertex insertion (removal) simplification strategy. We show that a good compression ratio is achieved not only with respect to a general-purpose data structure for a SMC, but also with respect to just encoding the complex at the maximum resolution

Data Structures for 3D Multi-Tessellations: An Overview

Multiresolution models support the interactive visualization of large volumetric data through selective refinement, an operation which permits to focus resolution only on the most relevant portions of the domain, or in the proximity of interesting field values. A 3D Multi-Tessellation (MT) is a multiresolution model, consisting of a coarse tetrahedral mesh at low resolution, and of a set of updates refining such a mesh, arranged as a partial order. In this paper, we describe and compare di#erent data structures which permit to encode a 3D MT and to support selective refinement