Translator Disclaimer
17 April 1995 Volume data compression using smoothed particle transformation
Author Affiliations +
Proceedings Volume 2419, Digital Video Compression: Algorithms and Technologies 1995; (1995)
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1995, San Jose, CA, United States
In 3D entertainment oriented games, most geometrical objects are represented by polygon sets. Thus, the handling of polygons is highly optimized in the hardware of graphic workstations. However, 3D scientific simulations do not ordinarily use polygon data but rather volume data in its original form, such as the scalar array p(x,y,z). If we had an effective volume data compression algorithm and a standard way of representing this data, it could be used in a more efficient manner in the network environment. This paper presents a Smoothed Particle Transformation (SPT) algorithm for volume data at several levels of compressed resolution from an original array description of a given variable. Representing data at various levels of detail is important for archiving the huge data in the network environment. SPT contributes not only to data compression but also for resolution rearrangement. As a result, it speeds up of the visualization of transferred data, especially for the direct volume rendering of compressed data.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mikio Nagasawa "Volume data compression using smoothed particle transformation", Proc. SPIE 2419, Digital Video Compression: Algorithms and Technologies 1995, (17 April 1995);

Back to Top