SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Time/space tradeoffs for polygon mesh rendering
ACM Transactions on Graphics (TOG)
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Optimizing triangle strips for fast rendering
Proceedings of the 7th conference on Visualization '96
Building and traversing a surface at variable resolution
VIS '97 Proceedings of the 8th conference on Visualization '97
Optimized geometry compression for real-time rendering
VIS '97 Proceedings of the 8th conference on Visualization '97
VARIANT—processing and visualizing terrains at variable resolution
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
JPEG Still Image Data Compression Standard
JPEG Still Image Data Compression Standard
Linear-Time Reconstruction of Delaunay Triangulations with Applications
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Compressing Multiresolution Triangle Meshes
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Compression of triangular meshes by simultaneously processing pairs of triangles
Proceedings of the 21st spring conference on Computer graphics
A multi-resolution model of vector map data for rapid transmission over the Internet
Computers & Geosciences
Hi-index | 0.00 |
We address the problem of designing compact data structures for encoding a Triangulated Irregular Network (TIN). In particular, we study the problem of compressing connectivity, i.e., the information describing the topological structure of the TIN, and we propose two new compression methods which have different purposes. The goal of the first method is to minimize the number of bits needed to encode connectivity information: it encodes each vertex once, and at most two bits of connectivity information for each edge of a TIN; algorithms for coding and decoding the corresponding bitstream are simple and efficient. A practical evaluation shows compression rates of about 4.2 bits per vertex, which are comparable with those achieved by more complex methods. The second method compresses a TIN at progressive levels of detail and it is based on a strategy which iteratively removes a vertex from a TIN according to an error-based criterion. Encoding and decoding algorithms are presented and compared with other approaches to progressive compression. Our method can encode more general types of triangulations, such as those constrained by topographic features, at the cost of a slightly longer bitstream.