This Article 
 Bibliographic References 
 Add to: 
Simplification of Node Position Data ;for Interactive Visualization of Dynamic Data Sets
Sept. 2012 (vol. 18 no. 9)
pp. 1537-1548
P. Rosen, Sci. Comput. & Imaging Inst., Univ. of Utah, Salt Lake City, UT, USA
V. Popescu, Comput. Sci. Dept., Purdue Univ., West Lafayette, IN, USA
We propose to aid the interactive visualization of time-varying spatial data sets by simplifying node position data over the entire simulation as opposed to over individual states. Our approach is based on two observations. The first observation is that the trajectory of some nodes can be approximated well without recording the position of the node for every state. The second observation is that there are groups of nodes whose motion from one state to the next can be approximated well with a single transformation. We present data set simplification techniques that take advantage of this node data redundancy. Our techniques are general, supporting many types of simulations, they achieve good compression factors, and they allow rigorous control of the maximum node position approximation error. We demonstrate our approach in the context of finite element analysis data, of liquid flow simulation data, and of fusion simulation data.

[1] C. Johnson, T. Munzner, R. Moorhead, H. Pfister, P. Rheingans, and T. Yoo, "NIH-NSF Visualization Research Challenges Report Summary," IEEE Computer Graphics and Applications, vol. 26, no. 2, pp. 20-24, Mar./Apr. 2006.
[2] M. Deering, "Geometry Compression," Proc. 22nd Ann. Conf. Computer Graphics and Interactive Techniques, pp. 13-20, 1995.
[3] S. Gumhold and W. Strasser, "Real Time Compression of Triangle Mesh Connectivity," Proc. 25th Ann. Conf. Computer Graphics and Interactive Techniques, pp. 133-140, 1998.
[4] F. Kalberer, K. Polthier, U. Reitebuch, and M. Wardetzky, "Freelence - Coding with Free Valences," Computer Graphics Forum, vol. 24, pp. 469-478, 2005.
[5] Z. Karni and C. Gotsman, "Spectral Compression of Mesh Geometry," Proc. 27th Ann. Conf. Computer Graphics and Interactive Techniques, pp. 279-286, 2000.
[6] J. Rossignac, "Edgebreaker: Connectivity Compression for Triangle Meshes," IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 1, pp. 47-61, Jan.-Mar. 1999.
[7] G. Taubin and J. Rossignac, "Geometric Compression through Topological Surgery," ACM Trans. Graphics, vol. 17, pp. 84-115, 1998.
[8] C. Touma and C. Gotsman, "Triangle Mesh Compression," Proc. 24th Ann. Graphics Interface Conf. (GI '98), pp. 26-34, 1998.
[9] M. Isenburg and P. Alliez, "Compressing Polygon Mesh Geometry with Parallelogram Prediction," Proc. IEEE Visualization (VIS '02), pp. 141-146, 2002.
[10] A. Khodakovsky, P. Alliez, M. Desbrun, and P. Schröder, "Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes," Graphics Models, vol. 64, pp. 147-168, 2002.
[11] L.C. Aleardi, O. Devillers, and G. Schaeffer, "Optimal Succinct Representations of Planar Maps," Proc. 22nd Ann. Symp. Computational Geometry (SCG '06), pp. 309-318, 2006.
[12] P. Alliez and M. Desbrun, "Progressive Compression for Lossless Transmission of Triangle Meshes," Proc. 28th Ann. Conf. Computer Graphics and Interactive Techniques, pp. 195-202, 2001.
[13] M. Ben-Chen and C. Gotsman, "On the Optimality of Spectral Compression of Mesh Data," ACM Trans. Graphics, vol. 24, pp. 60-80, 2005.
[14] Z. Karni, A. Bogomjakov, and C. Gotsman, "Efficient Compression and Rendering of Multi-Resolution Meshes," Proc. Conf. Visualization (VIS '02), pp. 347-354, 2002.
[15] U. Bischoff and J. Rossignac, "Tetstreamer: Compressed Back-to-Front Transmission of Delaunay Tetrahedra Meshes," Proc. Data Compression Conf. (DCC '05), pp. 93-102, 2005.
[16] S. Gumhold, S. Guthe, and W. Strasser, "Tetrahedral Mesh Compression with the Cut-Border Machine," Proc. Conf. Visualization '99: Celebrating 10 Years, pp. 51-58, 1999.
[17] M. Isenburg and P. Alliez, "Compressing Hexahedral Volume Meshes," Proc. 10th Pacific Conf. Computer Graphics and Applications, pp. 284-293, 2002.
[18] D. Chen, Y.-J. Chiang, and N. Memon, "Lossless Compression of Point-Based 3D Models," Proc. Pacific Graphics, pp. 124-126, 2005.
[19] R. Lange, T. Farrell, F. Durr, and K. Rothermel, "Remote Real-Time Trajectory Simplification," Proc. IEEE Int'l Conf. Pervasive Computing and Comm., pp. 1-10, 2009.
[20] T.W. Liao, "Clustering of Time Series Data - A Survey," Pattern Recognition, vol. 38, no. 11, pp. 1857-1874, 2005.
[21] J.-G. Lee, J. Han, and K.-Y. Whang, "Trajectory Clustering: A Partition-and-Group Framework," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 593-604, , 2007.
[22] G. de Vries and M. van Someren, "Clustering Vessel Trajectories with Alignment Kernels under Trajectory Compression," Proc. European Conf. Machine Learning and Knowledge Discovery in Databases, pp. 296-311, 2010.
[23] J.E. Lengyel, "Compression of Time-Dependent Geometry," Proc. Symp. Interactive 3D Graphics (I3D '99), pp. 89-95, 1999.
[24] T. Winkler, J. Drieseberg, A. Hasenfuß, B. Hammer, and K. Hormann, "Thinning Mesh Animations," Proc. Vision, Modeling, and Visualization Conf., pp. 149-158, 2008.
[25] M. Sattler, R. Sarlette, and R. Klein, "Simple and Efficient Compression of Animation Sequences," Proc. ACM SIGGRAPH/Eurographics Symp. Computer Animation (SCA '05), pp. 209-217, 2005.
[26] S. Shlafman, A. Tal, and S. Katz, "Metamorphosis of Polyhedral Surfaces Using Decomposition," Computer Graphics Forum, vol. 21, no. 3, pp. 219-228, 2002.
[27] D.L. James and C.D. Twigg, "Skinning Mesh Animations," ACM Trans. Graphics, vol. 24, pp. 399-407, July 2005.
[28] M. Alexa and W. Miller, "Representing Animations by Principal Components," Computer Graphics Forum, vol. 19, no. 3, pp. 411-418, 2000.
[29] Z. Karni and C. Gotsman, "Compression of Soft-Body Animation Sequences," Computers and Graphics, vol. 28, pp. 25-34, 2004.
[30] E. Landreneau and S. Schaefer, "Simplification of Articulated Meshes," Computer Graphics Forum, vol. 28, no. 2, pp. 347-353, 2009.
[31] A. Shamir and V. Pascucci, "Temporal and Spatial Level of Details for Dynamic Meshes," Proc. ACM Symp. Virtual Reality Software and Technology (VRST '01), pp. 77-84, 2001.
[32] I. Guskov and A. Khodakovsky, "Wavelet Compression of Parametrically Coherent Mesh Sequences," Proc. ACM SIGGRAPH/Eurographics Symp. Computer Animation, 2004.
[33] F. Payan and M. Antonini, "Wavelet-Based Compression of 3D Mesh Sequences," Proc. Second Int'l Conf. Machine Intelligence, 2005.
[34] J. Woodring and H.-W. Shen, "Multiscale Time Activity Data Exploration via Temporal Clustering Visualization Spreadsheet," IEEE Trans. Visualization and Computer Graphics, vol. 15, no. 1, pp. 123-137, Jan./Feb. 2009.
[35] L. Ibarria and J. Rossignac, "Dynapack: Space-Time Compression of the 3D Animations of Triangle Meshes with Fixed Connectivity," Proc. ACM SIGGRAPH/Eurographics Symp. Computer Animation, pp. 126-135, 2003.
[36] O. Devillers and P.-M. Gandoin, "Geometric Compression for Interactive Transmission," Proc. Conf. Visualization (VIS '00), pp. 319-326, 2000.
[37] M. Isenburg, P. Lindstrom, and J. Snoeyink, "Lossless Compression of Predicted Floating-Point Geometry," Computer Aided Design, vol. 37, pp. 869-877, 2005.
[38] P. Lindstrom and M. Isenburg, "Fast and Efficient Compression of Floating-Point Data," IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 5, pp. 1245-1250, Sept./Oct. 2006.
[39] P. Ratanaworabhan, J. Ke, and M. Burtscher, "Fast Lossless Compression of Scientific Floating-Point Data," Proc. Data Compression Conf. (DCC '06), pp. 133-142, 2006.
[40] I.H. Witten, R.M. Neal, and J.G. Cleary, "Arithmetic Coding for Data Compression," Comm. ACM, vol. 30, pp. 520-540, 1987.
[41] U. Ramer, "An Iterative Procedure for the Polygonal Approximation of Plane Curves," Computer Graphics and Image Processing, vol. 1, no. 3, pp. 244-256, 1972.
[42] D. Douglas and T. Peucker, "Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature," Cartographica: The Int'l J. Geographic Information and Geovisualization, vol. 10, no. 2, pp. 112-122, 1973.
[43] S.P. Lloyd, "Least Squares Quantization in PCM," IEEE Trans. Information Theory, vol. IT-28, no. 2, pp. 129-137, Mar. 1982.

Index Terms:
interactive systems,approximation theory,data visualisation,finite element analysis,finite element analysis data,node position data,interactive visualization,dynamic data sets,time-varying spatial data sets,data set simplification techniques,node data redundancy,good compression factors,maximum node position approximation error,Trajectory,Data models,Data visualization,Clustering algorithms,Encoding,Approximation methods,Computational modeling,simulation data compression.,Simplification of node positions,trajectory simplification,trajectory clustering,rigid body decomposition,interactive visualization
P. Rosen, V. Popescu, "Simplification of Node Position Data ;for Interactive Visualization of Dynamic Data Sets," IEEE Transactions on Visualization and Computer Graphics, vol. 18, no. 9, pp. 1537-1548, Sept. 2012, doi:10.1109/TVCG.2011.268
Usage of this product signifies your acceptance of the Terms of Use.