Share Email Print

Proceedings Paper

Volume data compression using smoothed particle transformation
Author(s): Mikio Nagasawa
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 17 April 1995
PDF: 8 pages
Proc. SPIE 2419, Digital Video Compression: Algorithms and Technologies 1995, (17 April 1995); doi: 10.1117/12.206367
Show Author Affiliations
Mikio Nagasawa, Hitachi Central Research Lab. (Japan)

Published in SPIE Proceedings Vol. 2419:
Digital Video Compression: Algorithms and Technologies 1995
Arturo A. Rodriguez; Robert J. Safranek; Edward J. Delp, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?