Representing vertex-based simplicial multi-complexes

Authors:
Emanuele Danovaro;Leila De Floriani;Paola Magillo;Enrico Puppo
Affiliations:
Department of Computer and Information Sciences (DISI), University of Genova, Via Dodecaneso 35, 16146 Genova - Italy;Department of Computer and Information Sciences (DISI), University of Genova, Via Dodecaneso 35, 16146 Genova - Italy;Department of Computer and Information Sciences (DISI), University of Genova, Via Dodecaneso 35, 16146 Genova - Italy;Department of Computer and Information Sciences (DISI), University of Genova, Via Dodecaneso 35, 16146 Genova - Italy
Venue:
Digital and image geometry
Year:
2001

Citing 18
Cited 0

Multiresolution modeling and visualization of volume data based on simplicial complexes

VVS '94 Proceedings of the 1994 symposium on Volume visualization
Real-time, continuous level of detail rendering of height fields

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
View-dependent refinement of progressive meshes

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
View-dependent simplification of arbitrary polygonal environments

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Progressive simplicial complexes

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
ROAMing terrain: real-time optimally adapting meshes

VIS '97 Proceedings of the 8th conference on Visualization '97
Multiresolution tetrahedral framework for visualizing regular volume data

VIS '97 Proceedings of the 8th conference on Visualization '97
Tetrahedral mesh generation by Delaunay refinement

Proceedings of the fourteenth annual symposium on Computational geometry
Progressive forest split compression

Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Efficient implementation of multi-triangulations

Proceedings of the conference on Visualization '98
Progressive tetrahedralizations

Proceedings of the conference on Visualization '98
Tetrahedral mesh compression with the cut-border machine

VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Simplification of Tetrahedral meshes with accurate error evaluation

Proceedings of the conference on Visualization '00
Adaptive Projection Operators in Multiresolution Scientific Visualization

IEEE Transactions on Visualization and Computer Graphics
Generalized Unstructured Decimation

IEEE Computer Graphics and Applications
Hierarchical Meshes for Volume Data

CGI '98 Proceedings of the Computer Graphics International 1998
Constant-Time Neighbor Finding in Hierarchical Tetrahedral Meshes

SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Right Triangular Irregular Networks

Right Triangular Irregular Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.