Compression of digital elevation models by Huffman coding
Computers & Geosciences - Special issue on geographical computing
Optimal predictors for compression of digital elevation models
Computers & Geosciences
Curves and surfaces for CAGD: a practical guide
Curves and surfaces for CAGD: a practical guide
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
A real-time terrain visualization algorithm using wavelet-based compression
The Visual Computer: International Journal of Computer Graphics
Binary Codes for Non-Uniform Sources
DCC '05 Proceedings of the Data Compression Conference
High-quality networked terrain rendering from compressed bitstreams
Proceedings of the twelfth international conference on 3D web technology
Parallel ODETLAP for terrain compression and reconstruction
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Compressing terrain elevation datasets
Compressing terrain elevation datasets
On-the-fly decompression and rendering of multiresolution terrain
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
Some computer organizations and their effectiveness
IEEE Transactions on Computers
Parallel quadtree coding of large-scale raster geospatial data on GPGPUs
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Journal of Computer Science and Technology - Special issue on Natural Language Processing
Hi-index | 0.00 |
In this paper, we present a novel method for fast lossy or lossless compression and decompression of regular height fields. The method is suitable for SIMD parallel implementation and thus inherently suitable for modern GPU architectures. Lossy compression is achieved by approximating the height field with a set of quadratic Bezier surfaces. In addition, lossless compression is achieved by superimposing the residuals over the lossy approximation. We validated the method's efficiency through a CUDA implementation of compression and decompression algorithms. The method allows independent decompression of individual data points, as well as progressive decompression. Even in the case of lossy decompression, the decompressed surface is inherently seamless. In comparison with the GPU-oriented state-of-the-art method, the proposed method, combined with a widely available lossless compression method (such as DEFLATE), achieves comparable compression ratios. The method's efficiency slightly outperforms the state-of-the-art method for very high workloads and considerably for lower workloads.