Loading...
Please wait, while we are loading the content...
Similar Documents
Grow & fold: compressing the connectivity of tetrahedral meshes (2000).
| Content Provider | CiteSeerX |
|---|---|
| Author | Szymczak, Andrzej Rossignac, Jarek |
| Abstract | Standard representations of irregular finite element meshes combine vertex data (sample coordinates and node values) and connectivity (tetrahedron-vertex incidence) . Connectivity specifies how the samples should be interpolated. It may be encoded as four vertex-references for each tetrahedron, which requires 128m bits where m is the number of tetrahedra in the mesh. Our `Grow&Fold' format reduces the connectivity storage down to 7 bits per tetrahedron: 3 of these are used to encode the presence of children in a tetrahedron spanning tree; the other 4 constrain sequences of `folding' operations, so that they produce the connectivity graph of the original mesh. Additional bits must be used for each handle in the mesh and for each topological `lock' in the tree. However, as our experiments with a prototype implementation show, the increase of the storage cost due to this extra information is typically no more than 1-2%. By storing vertex data in an order defined by the tree, w... |
| File Format | |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Grow Fold Tetrahedral Mesh Vertex Data Original Mesh Storage Cost Tetrahedron-vertex Incidence Connectivity Storage Additional Bit Sample Coordinate Constrain Sequence Extra Information Connectivity Graph Standard Representation Node Value Irregular Finite Element Mesh Prototype Implementation Show |
| Content Type | Text |
