Skip to main content

Massive Data Visualization: A Survey

  • Chapter
  • First Online:

Part of the book series: Mathematics and Visualization ((MATHVISUAL))

Summary

Today’s scientific and engineering problems require a different approach to address the massive data problems in organization, storage, transmission, visualization, ex- ploration, and analysis. Visual techniques for data exploration are now common in many scientific, engineering, and business applications. However, the massive amount of data collected through simulation, collection and logging is inhibiting the use of conventional vi- sualization methods. We need to discover new visualization methods that allow us to explore the massive multidimensional time-varying information streams and turn overwhelming tasks into opportunities for discovery and analysis.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abello, J., and Korn, J. Visualizing massive multi-digraphs. In INFOVIS 2000: Proceedings of the IEEE Symposium on Information Vizualization 2000 (2000), IEEE Computer Society, p. 39.

    Google Scholar 

  2. Abello, J., and Korn, J. Mgv: A system for visualizing massive multidigraphs. IEEE Trans. Vis. Comput. Graph. 8, 1 (2002), 21–38.

    Article  Google Scholar 

  3. Abello, J., and Vitter, J. S., Eds. External memory algorithms and visualization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society Press, Providence, RI, 1999.

    Google Scholar 

  4. Arge, L., and Miltersen, P.B. On showing lower bounds for external-memory computational geometry problems. In External Memory Algorithms and Visualization, J. Abello and J. S. Vitter, Eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society Press, Providence, RI, 1999.

    Google Scholar 

  5. Asano, T., Ranjan, D., Roos, T., and Welzl, E. Space filling curves and their use in the design of geometric data structures. Lecture Notes in Computer Science, vol. 911. Springer, Berlin, 1995, pp. 36–44.

    Google Scholar 

  6. Balmelli, L., Kova vcević, J., and Vetterli, M. Quadtree for embedded surface visualization: Constraints and efficient data structures. In IEEE International Conference on Image Processing (ICIP) (Kobe Japan, October 1999), pp. 487–491.

    Google Scholar 

  7. Bandou, Y., and Kamata, S.-I. An address generator for a 3-dimensional pseudohilbert scan in a cuboid region. In International Conference on Image Processing, ICIP99 (1999), vol. I.

    Google Scholar 

  8. Bandou, Y., and Kamata, S.-I. An address generator for an n-dimensional pseudohilbert scan in a hyper-rectangular parallelepiped region. In International Conference on Image Processing, ICIP 2000 (2000) (to appear).

    Google Scholar 

  9. Bier, E., Stone, M., and Pier, K. Enhanced illustration using magic lens filters. IEEE Comput. Graph. Appl. 17, 6 (1997), 62–70.

    Article  Google Scholar 

  10. Bosch, R., Stolte, C., Tang, D., Gerth, J., Rosenblum, M., and Hanrahan, P. Rivet: a flexible environment for computer systems visualization. SIGGRAPH Comput. Graph. 34, 1 (2000), 68–73.

    Article  Google Scholar 

  11. Chiang, Y., and Silva, C. T. I/O optimal isosurface extraction. In IEEE Visualization 1997 (Nov. 1997), R. Yagel and H. Hagen, Eds., IEEE, pp. 293–300.

    Google Scholar 

  12. Chopra, P., and Meyer, J. Tetfusion: An algorithm for rapid tetrahedral mesh simplification. In VIS 2002: Proceedings of the conference on Visualization 2002 (Washington, DC, USA, 2002), IEEE Computer Society.

    Google Scholar 

  13. Chui, C. K. An introduction to wavelets. Wavelet Analysis and its Applications, vol. 1. Academic, New York, 1992.

    Google Scholar 

  14. Cignoni, P., De Floriani, L., Montoni, C., Puppo, E., and Scopigno, R. Multiresolution modeling and visualization of volume data based on simplicial complexes. In 1994 Symposium on Volume Visualization (Oct. 1994), A. Kaufman and W. Krueger, Eds., ACM SIGGRAPH, pp. 19–26.

    Chapter  Google Scholar 

  15. Cignoni, P., Ganovelli, F., Gobbetti, E., Marton, F., Ponchio, F., and Scopigno, R. BDAM: Batched dynamic adaptive meshes for high performance terrain visualization. In Proceedings of the 24th Annual Conference of the European Association for Computer Graphics (EG-03) (Oxford, UK, Sept. 1–6 2003), P. Brunet and D. Fellner, Eds., vol. 22, 3 of Computer Graphics forum, IEEE Computer Society/Blackwell, Malden, pp. 505–514.

    Google Scholar 

  16. Cignoni, P., Ganovelli, F., Gobbetti, E., Marton, F., Ponchio, F., and Scopigno, R. Interactive out-of-core visualization of very large landscapes on commodity graphics platforms. In ICVS 2003, Lecture Notes in Computer Science. Springer, New York, pp. 21–29.

    Google Scholar 

  17. Cignoni, P., Ganovelli, F., Gobbetti, E., Marton, F., Ponchio, F., and Scopigno, R. Planet–sized batched dynamic adaptive meshes (P-BDAM). In Proceedings IEEE Visualization (Conference held in Seattle, WA, USA, Oct. 2003), IEEE Computer Society, IEEE Computer Society Press, pp. 147–155.

    Google Scholar 

  18. Cohen, J., Manocha, D., and Olano, M. Simplifying polygonal models using successive mappings. In IEEE Visualization 1997 (Nov. 1997), R. Yagel and H. Hagen, Eds., IEEE, pp. 395–402.

    Google Scholar 

  19. Duchaineau, M. A., Porumbescu, S., Bertram, M., Hamann, B., and Joy, K. I. Dataflow and remapping for wavelet compression and view-dependent optimization of billion-trangle isosurfaces. In Approximation and Geometrical Methods for Scientific Visualization, G. Farin, H. Hagen, and B. Hamann, Eds., Springer, Heidelberg, 2002, pp. 1–17.

    Google Scholar 

  20. Duchaineau, M. A., Wolinsky, M., Sigeti, D. E., Miller, M. C., Aldrich, C., and Mineev-Weinstein, M. B. ROAMing terrain: Real-time optimally adapting meshes. In IEEE Visualization 1997 (Nov. 1997), R. Yagel and H. Hagen, Eds., IEEE Computer Society Press, Los Alamitos, CA, pp. 81–88.

    Google Scholar 

  21. Eick, S., and Karr, A. Visual scalability. Int. J. Comput. Graph. Stat. 11, 1 (Mar. 2002), 22–43.

    Article  MathSciNet  Google Scholar 

  22. Evans, W., Kirkpatrick, D., and Townsend, G. Right triangular irregular networks. Tech. Rep. TR97-09, The Department of Computer Science, University of Arizona, May 30 1997.

    Google Scholar 

  23. Fowler, R. J., and Little, J. J. Automatic extraction of irregular network digital terrain models. Computer Graphics (SIGGRAPH 1979 Proc.) 13, 2 (Aug. 1979), pp. 199–207.

    Article  Google Scholar 

  24. Fua, Y.-H., Ward, M. O., and Rundensteiner, E. A. Hierarchical parallel coordinates for exploration of large datasets. In IEEE Visualization 1999 (Vis 1999) (Washington, Brussels, Tokyo, Oct. 1999), IEEE, pp. 43–50.

    Google Scholar 

  25. Fua, Y.-H., Ward, M. O., and Rundensteiner, E. A. Structure-based brushes: A mechanism for navigating hierarchically organized data and information spaces. IEEE Trans. Vis. Comput. Graph. 6, 2 (2000), 150–159.

    Article  Google Scholar 

  26. Furnas, G. W. Generalized fisheye views. In CHI 1986: Proceedings of the SIGCHI conference on Human factors in computing systems (New York, USA, 1986), ACM, pp. 16–23.

    Google Scholar 

  27. Garland, M., and Heckbert, P. S. Surface simplification using quadric error metrics. In SIGGRAPH 1997: Proceedings of the 24th annual conference on Computer graphics and interactive techniques (1997), ACM/Addison-Wesley, pp. 209–216.

    Google Scholar 

  28. Gieng, T. S., Hamann, B., Joy, K. I., Schussman, G. L., and Trotts, I. J. Smooth hierarchical surface triangulations. In Proceedings of Visualization 1997 (Oct. 1997), H. Hagen and R. Yagel, Eds., IEEE Computer Society Press, Los Alamitos, CA, pp. 379–386.

    Google Scholar 

  29. Gieng, T. S., Hamann, B., Joy, K. I., Schussman, G. L., and Trotts, I. J. Constructing hierarchies for triangle meshes. IEEE Trans. Vis. Comput. Graph. 4, 2 (1998), 145–161.

    Article  Google Scholar 

  30. Goodrich, M. T., Tsay, J.-J., Vengroff, D. E., and Vitter, J. S. External-memory computational geometry. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1993) (Palo Alto, CA, November 1993).

    Google Scholar 

  31. Griebel, M., and Zumbusch, G. W. Parallel multigrid in an adaptive pde solver based on hashing and space-filling curves. Parallel Comput. 25 (1999), 827–843.

    Article  MathSciNet  MATH  Google Scholar 

  32. Hamann, B. A data reduction scheme for triangulated surfaces. Comput. Aided Geometric Des. 11 (1994), 197–214.

    Article  MathSciNet  MATH  Google Scholar 

  33. Hamann, B., and Chen, J.-L. Data point selection for piecewise linear curve approximation. Computer-Aided Geometric Design 11, 3 (June 1994), 289–301.

    Article  MathSciNet  MATH  Google Scholar 

  34. Havre, S., Hetzler, B., and Nowell, L. Themeriver: Visualizing theme changes over time. In INFOVIS 2000: Proceedings of the IEEE Symposium on Information Vizualization 2000 (Washington, DC, USA, 2000), IEEE Computer Society, p. 115.

    Google Scholar 

  35. Hilbert, D. Über die stetige abbildung einer linie auf ein flachenstück. Mathematische Annalen 38 (1891), 459–460.

    Article  MathSciNet  MATH  Google Scholar 

  36. Hoppe, H. Progressive meshes. In SIGGRAPH 1996 Proc. (Aug. 1996), pp. 99–108.

    Google Scholar 

  37. Hoppe, H. View-dependent refinement of progressive meshes. In SIGGRAPH 1997 Proc. (Aug. 1997).

    Google Scholar 

  38. Hoppe, H. Smooth view-dependent level-of-detail control and its application to terrain rendering. In Proceedings of IEEE Visualization 1998 (Jan. 1998), IEEE, Piscataway, NJ, 1998, pp. 35–42.

    Google Scholar 

  39. Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., and Stuetzle, W. Mesh optimization. In Computer Graphics (SIGGRAPH 1993 Proceedings) (Aug. 1993), J. T. Kajiya, Ed., vol. 27 (4), pp. 19–26.

    Google Scholar 

  40. Hwa, L. M., Duchaineau, M. A., and Joy, K. I. Adaptive 4-8 texture hierarchies. In VIS 2004: Proceedings of the conference on Visualization 2004 (Washington, DC, USA, 2004), IEEE Computer Society, pp. 219–226.

    Google Scholar 

  41. Inselberg, A., and Dimsdale, B. Parallel coordinates for visualizing multidimensional geometry. In Computer Graphics 1987 (Proceedings of CG International 1987), T. L. Kunii, Ed., Springer, Berlin, pp. 25–44.

    Google Scholar 

  42. Isenburg, M., and Lindstrom, P. Streaming meshes. In Proceedings of IEEE Visualization 2005 (2005), IEEE Computer Society Press, (to appear).

    Google Scholar 

  43. Isenburg, M., Lindstrom, P., Gumhold, S., and Snoeyink, J. Large mesh simplification using processing sequences. In Proceedings of IEEE Visualization 2003 (2003), IEEE Computer Society Press, pp. 465–472.

    Google Scholar 

  44. Isenburg, M., Lindstrom, P., and Snoeyink, J. Streaming compression of triangle meshes. In Proceedings of Eurographics Symposium on Geometry Processing (2005), pp. 111–118.

    Google Scholar 

  45. Kamata, S.-I., and Bandou, Y. An address generator of a pseudo-hilbert scan in a rectangle region. In International Conference on Image Processing, ICIP97 (1997), vol. I, pp. 707–714.

    Google Scholar 

  46. Klein, R., Liebich, G., and Strasser, W. Mesh reduction with error control. In Proceedings of IEEE Visualization 1996 (Oct. 1996), IEEE Computer Society Press, Los Alamitos, CA, pp. 311–318.

    Google Scholar 

  47. Lawder, J. K. The Application of Space-filling Curves to the Storage and Retrieval of Multi-Dimensional Data. PhD thesis, School of Computer Science and Information Systems, Birkbeck College, University of London, 2000.

    Google Scholar 

  48. Lawder, J. K., and King, P. J. H. Using space-filling curves for multi-dimensional indexing. In proceedings of the 17th British National Conference on Databases (BNCOD 17) (July 2000), B. Lings and K. Jeffery, Eds., vol. 1832 of Lecture Notes in Computer Science. Springer, Berlin, pp. 20–35.

    Google Scholar 

  49. Lindstrom, P., Koller, D., Ribarsky, W., Hughes, L. F., Faust, N., and Turner, G. Real-Time, continuous level of detail rendering of height fields. In SIGGRAPH 96 Conference Proceedings (New Orleans, LA, 04–09 Aug. 1996), H. Rushmeier, Ed., Annual Conference Series, ACM SIGGRAPH, Addison Wesley, pp. 109–118.

    Chapter  Google Scholar 

  50. Lindstrom, P., and Pascucci, V. Visualization of large terrains made easy. In Proceedings Visualization 2001 (2001), T. Ertl, K. Joy, and A. Varshney, Eds., IEEE Computer Society Technical Committee on Visualization and Graphics Executive Committee, pp. 363–370.

    Google Scholar 

  51. Mallat, S. A wavelet tour of signal processing. Academic, San Diego, 1998.

    MATH  Google Scholar 

  52. Matias, Y., Segal, E., and Vitter, J. S. Efficient bundle sorting. In SODA 2000: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (2000), Society for Industrial and Applied Mathematics, pp. 839–848.

    Google Scholar 

  53. Mirante, A., and Weingarten, N. The radial sweep algorithm for constructing triangulated irregular networks. IEEE Comput. Graph. Appl. 2, 3 (May 1982), 11–13, 15–21.

    Article  Google Scholar 

  54. Mirin, A. A., Cohen, R. H., Curtis, B. C., Dannevik, W. P., Dimits, A. M., Duchaineau, M. A., Eliason, D. E., Schikore, D. R., Anderson, S. E., Porter, D. H., Woodward, P. R., Shieh, L. J., and White, S. W. Very high resolution simulation of compressible turbulence on the IBM-SP system. Supercomputing 99 Conference (Nov. 1999).

    Google Scholar 

  55. Munzner, T., Guimbretire, F., Tasiran, S., Zhang, L., and Zhou, Y. Treejuxtaposer: scalable tree comparison using focus + context with guaranteed visibility. ACM Trans. Graph. 22, 3 (2003), 453–462.

    Article  Google Scholar 

  56. Niedermeier, R., Reinhardt, K., and Sanders, P. Towards optimal locality in meshindexings, 1997.

    Google Scholar 

  57. Niedermeier, R., and Sanders, P. On the manhattan-distance between points on space-filling mesh-indexings. Technical Report iratr-1996-18, Universität Karlsruhe, Informatik für Ingenieure und Naturwissenschaftler, 1996.

    Google Scholar 

  58. Pajarola, R. Large scale terrain visualization using the restricted quadtree triangulation. In Proceedings Visualization 98 (Los Alamitos, CA, 1998), IEEE, Computer Society Press, pp. 19–26, 515. Extended version available as technical report ftp://ftp.inf.ethz.ch/pub/publications/tech-reports/2xx/292.ps.

    Google Scholar 

  59. Parashar, M., Browne, J., Edwards, C., and Klimkowski, K. A common data management infrastructure for adaptive algorithms for pde solutions. In SuperComputing 97 (1997).

    Google Scholar 

  60. Pascucci, V., and Frank, R. J. Global static indexing for real-time exploration of very large regular grids. In Supercomputing 2001: Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) (New York, NY, USA, 2001), ACM, p. 2.

    Google Scholar 

  61. Plaisant, C., Carr, D., and Shneiderman, B. Image-browser taxonomy and guidelines for designers. IEEE Softw. 12, 2 (1995), 21–32.

    Article  Google Scholar 

  62. Plaisant, C., Grosjean, J., and Bederson, B. B. Spacetree: Supporting exploration in large node link tree, design evolution and empirical evaluation. In INFOVIS 2002: Proceedings of the IEEE Symposium on Information Visualization (InfoVis 2002) (Washington, DC, USA, 2002), IEEE Computer Society, p. 57.

    Google Scholar 

  63. Popović, J., and Hoppe, H. Progressive simplicial complexes. In SIGGRAPH 97 Conference Proceedings (Aug. 1997), T. Whitted, Ed., Annual Conference Series, ACM SIGGRAPH, Addison Wesley, pp. 217–224.

    Chapter  Google Scholar 

  64. Rao, R., and Card, S. K. The table lens: merging graphical and symbolic representations in an interactive focus+context visualization for tabular information. In CHI 1994: Proceedings of the SIGCHI conference on Human factors in computing systems (New York, NY, USA, 1994), ACM, pp. 318–322.

    Google Scholar 

  65. Renze, K. J., and Oliver, J. H. Generalized unstructured decimation. IEEE Comput. Graph. Appl. 16, 6 (Nov. 1996), 24–32.

    Article  Google Scholar 

  66. Sagan, H. Space-filling curves. Springer, New York, 1994.

    Book  MATH  Google Scholar 

  67. Schrofder, W. J., Zarge, J. A., and Lorensen, W. E. Decimation of triangle meshes. Computer Graphics (SIGGRAPH 1992 Proc.) 26, 2 (July 1992), 65–70.

    Article  Google Scholar 

  68. Silva, C. T., Mitchell, J. S. B., and Kaufman, A. E. Automatic generation of triangular irregular networks using greedy cuts. In Proceedings of IEEE Visualization (1995), IEEE Computer Society, IEEE Computer Society Press, Los Alamitos, CA, pp. 201–208.

    Google Scholar 

  69. Staadt, O. G., and Gross, M. H. Progressive tetrahedralizations. In Proceedings of Visualization 98 (Oct. 1998), D. Ebert, H. Hagen, and H. Rushmeier, Eds., IEEE Computer Society Press, Los Alamitos, CA, pp. 397–402.

    Google Scholar 

  70. Stollnitz, E. J., DeRose, T. D., and Salesin, D. H. Wavelets for computer graphics: theory and applications. Morgann Kaufmann, San Francisco, CA, 1996.

    Google Scholar 

  71. Stolte, C., Tang, D., and Hanrahan, P. Multiscale visualization using data cubes. In INFOVIS 2002: Proceedings of the IEEE Symposium on Information Visualization (InfoVis 2002) (2002), IEEE Computer Society, p. 7.

    Google Scholar 

  72. Stolte, C., Tang, D., and Hanrahan, P. Polaris: A system for query, analysis, and visualization of multidimensional relational databases. IEEE Trans. Vis. Comput. Graph. 8, 1 (2002), 52–65.

    Article  Google Scholar 

  73. Stolte, C., Tang, D., and Hanrahan, P. Query, analysis, and visualization of hierarchically structured data using polaris. In KDD 2002: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining (2002), ACM, pp. 112–122.

    Google Scholar 

  74. Trotts, I. J., Hamann, B., Joy, K. I., and Wiley, D. F. Simplification of tetrahedral meshes. In Proceedings of Visualization 98 (Oct. 1998), D. Ebert, H. Hagen, and H. Rushmeier, Eds., IEEE Computer Society Press, Los Alamitos, CA, pp. 287–296.

    Google Scholar 

  75. Vitter, J. S. External memory algorithms and data structures: dealing with massive data. ACM Comput. Surv. 33, 2 (2001), 209–271.

    Article  Google Scholar 

  76. Wise, J. A., Thomas, J. J., Pennock, K., Lantrip, D., Pottier, M., Schur, A., and Crow, V. Visualizing the non-visual: spatial analysis and interaction with information for text documents. Morgan Kaufmann, San Francisco, CA, USA, 1999, pp. 442–450.

    Google Scholar 

  77. Wong, P. C., and Thomas, J. Visual analytics. IEEE Comput. Graph. Appl. 24, 5 (2004), 20–21.

    Article  Google Scholar 

  78. Xia, J. C., and Varshney, A. Dynamic view-dependent simplification for polygonal models. In Proceedings of IEEE Visualization 1996 (1996), IEEE Computer Society Press, pp. 327–334.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Joy, K.I. (2009). Massive Data Visualization: A Survey. In: Möller, T., Hamann, B., Russell, R.D. (eds) Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/b106657_15

Download citation

Publish with us

Policies and ethics