Bibliography

  1. [AbsInt 07] AbsInt. “aiSee: Graph Visualization.” Available online (http://www.absint.com/aisee/), 2007.

  2. [Adobe Systems Incorporated 07] Adobe Systems Incorporated. “Adobe Acrobat Family.” Available online (http://www.adobe.com/products/acrobat/), 2007.

  3. [AGD 06] AGD. “AGD: A Library of Algorithms for Graph Drawing.” Available online (http://www.ads.tuwien.ac.at/AGD/), 2006.

  4. [Ambardar 06] A. Ambardar. Digital Signal Processing: A Modern Introduction. Toronto: Thomson Engineering, 2006.

  5. [Arcelli et al. 11] C. Arcelli, G. S. di Baja, and L. Serino. “Distance-Driven Skeletonization in Voxel Images.” IEEE TPAMI 33:4 (2011), 709–720.

  6. [Arya et al. 98] S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. “An Optimal Algorithm for Approximate Nearest Neighbor Searching.” J. of the ACM 45:6 (1998), 891–923.

  7. [Au et al. 08] O. Au, C. Tai, H. Chu, D. Cohen-Or, and T. Lee. “Skeleton Extraction by Mesh Contraction.” ACM TOG (Proc. ACM SIGGRAPH) 27:3 (2008), 441– 449. Available online (http://visgraph.cse.ust.hk/projects/skeleton).

  8. [Auber 07] D. Auber. “Tulip Graph Visualization Software System.” Available online (http://www.tulip-software.org/), 2007.

  9. [AVS, Inc. 06] AVS, Inc. AVS/Express Developer’s Reference. Waltham, MA: Advanced Visual Systems, Inc., 2006.

  10. [Bajaj and Xu 03] C. L. Bajaj and G. Xu. “Anisotropic Diffusion of Surfaces and Functions on Surfaces.” ACM Transactions on Graphics (TOG) 22:1 (2003), 4–32.

  11. [Banks and Singer 95] D. C. Banks and B. A. Singer. “A Predictor-Corrector Technique for Visualizing Unsteady Flow.” IEEE Transactions on Visualization and Computer Graphics 1:2 (1995), 151–163.

  12. [Baudel and Broeksema 12] T. Baudel and B. Broeksema. “Capturing the Design Space of Sequential Space-Filling Layouts.” IEEE TVCG 18:12 (2012), 2593– 2602.

  13. [Bavoil et al. 05] L. Bavoil, S. P. Callahan, P. J. Crossno, J. Freire, C. E. Scheidegger, C. T. Silva, and H. T. Vo. “VisTrails: Enabling Interactive Multiple-View Visualizations.” In Proc. IEEE Visualization, pp. 135–142, 2005. http://www.vistrails.org.

  14. [Bederson and Shneiderman 03] B. Bederson and B. Shneiderman. The Craft of Information Visualization: Readings and Reflections. San Francisco, CA: Morgan Kaufmann, 2003.

  15. [Bederson et al. 02] B. Bederson, B. Shneiderman, and M. Wattenberg. “Ordered and Quantum Treemaps: Making Effective Use of 2D Space to Display Hierarchies.” ACM Transactions of Graphics 21:4 (2002), 833–854.

  16. [Bellard 06] F. Bellard. “The FFmpeg Multimedia System.” Available online (http://ffmpeg.mplayerhq.hu/), 2006.

  17. [Belytschko et al. 96] T. Belytschko, Y. Krongauz, D. Organ, M. Fleming, and P. Krysl. “Meshless Methods: An Overview and Recent Developments.” Computer Methods in Applied Mechanics and Engineering 139:1 (1996), 3–47.

  18. [Bentley 75] J. L. Bentley. “Multidimensional Binary Search Trees Used for Associative Searching.” Comm. of the ACM 18:9 (1975), 509–517.

  19. [Bentley 90] J. L. Bentley. “K-d Trees for Semidynamic Point Sets.” In Proc. 6th Ann. ACM Symposium on Computational Geometry, pp. 187–197. New York: ACM Press, 1990.

  20. [Bergman et al. 95] L. D. Bergman, B. E. Rogowitz, and L. A. Treinish. “A Rule-Based Tool for Assisting Colormap Selection.” In Proc. IEEE Visualization, pp. 118–125. Los Alamitos, CA: IEEE Press, 1995.

  21. [Bern and Eppstein 92] M. Bern and D. Eppstein. “Mesh Generation and Optimal Triangulation.” In Computing and Euclidean Geometry, pp. 23–90. River Edge, NJ: World Scientific, 1992.

  22. [Bernardini et al. 99] F. Bernardini, J. Mittleman, H. Rushmeier, C. Silva, and G. Taubin. “The Ball-Pivoting Algorithm for Surface Reconstruction.” IEEE TVCG 5:4 (1999), 349–359.

  23. [Bertin 77] J. Bertin. La graphique et le traitement graphique de l’information. Paris: Flammarion, 1977.

  24. [Bertin 83] J. Bertin. Semiology of Graphics. Madison, WI: University of Wisconsin Press, 1983.

  25. [Bitter et al. 00] I. Bitter, M. Sato, M. Bender, K. T. McDonnell, A. Kaufman, and M. Wan. “CEASAR: A Smooth, Accurate and Robust Centerline Extraction Algorithm.” In Proc. IEEE Visualization, pp. 45–52. Los Alamitos, CA: IEEE Press, 2000.

  26. [Bloesch 93] A. Bloesch. “Aesthetic Layout of Generalized Trees.” Software—Practice and Experience 23:8 (1993), 817–827.

  27. [Blum 67] H. Blum. “A Transformation for Extracting New Descriptors of Shape.” In Models for the Perception of Speech and Visual Form, pp. 362–380. Cambridge, MA: MIT Press, 1967.

  28. [Boardman 00] R. Boardman. “Bubble Trees: The Visualization of Hierarchical Information Structures.” In Proc. ACM CHI, pp. 315–316. New York: ACM Press, 2000.

  29. [Borg and Groenen 97] I. Borg and P. J. F. Groenen. Modern Multidimensional Scaling: Theory and Applications. New York: Springer, 1997.

  30. [Borland and Taylor 07] D. Borland and R. M. Taylor. “Rainbow Color Map (Still) Considered Harmful.” IEEE Computer Graphics and Applications 27:2 (2007), 14–17.

  31. [Botha 13] C. P. Botha. “DeVIDE Visualization Framework.” Available online (http://www.cg.its.tudelft.nl/Projects/DeVIDE), 2013.

  32. [Botsch et al. 10] M. Botsch, L. Kobbelt, M. Pauly, P. Alliez, and B. Levy. Polygon Mesh Processing. Natick, MA: A K Peters, Ltd., 2010.

  33. [Böttger et al. 14] J. Böttger, A. Sch¨afer, G. Lohmann, A. Villringer, and D. Margulies. “Three-Dimensional Mean-Shift Edge Bundling for the Visualization of Functional Connectivity in the Brain.” IEEE TVCG 20:3 (2014), 471–480.

  34. [Brandenburg 03] A. Brandenburg. “Computational Aspects of Astrophysical MHD and Turbulence.” In Advances in Nonlinear Dynamics, edited by A. Ferriz-Mas and M. Nú nez, pp. 269–337. Boca Raton, FL: Taylor and Francis Group, 2003.

  35. [Brandes and Pich 07] U. Brandes and C. Pich. “Eigensolver methods for progressive multidimensional scaling of large data.” In Graph Drawing: 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18–20, 2006, Revised Papers, number 4372 in Lecture Notes in Computer Science, pp. 42–53. Berlin: Springer, 2007.

  36. [Brewer and Harrower 13] C. Brewer and M. Harrower. “ColorBrewer.” Available online (http://www.colorbrewer.org/), 2013.

  37. [Broeksema et al. 13] B. Broeksema, T. Baudel, A. C. Telea, and P. Crisafulli. “Decision Exploration Lab: A Visual Analytics Solution for Decision Management.” IEEE TVCG 19:12 (2013), 1972–1981.

  38. [Bruls et al. 00] M. Bruls, K. Huizing, and J. J. van Wijk. “Squarified Treemaps.” In Proc. VisSym, pp. 33–42. Berlin: Springer, 2000.

  39. [Burch and Diehl 08] M. Burch and S. Diehl. “TimeRadarTrees: Visualizing Dynamic Compound Digraphs.” Computer Graphics Forum 27:3 (2008), 823–830.

  40. [Burch et al. 10] M. Burch, M. Fritz, F. Beck, and S. Diehl. “TimeSpiderTrees: A Novel Visual Metaphor for Dynamic Compound Digraphs.” In Proceedings of the International Symposium on Visual Languages and Human-Centric Computing, pp. 168–175. Los Alamitos, CA: IEEE Press, 2010.

  41. [Bürkle et al. 01] D. Bürkle, T. Preusser, and M. Rumpf. “Transport and Diffusion in Time-Dependent Flow Visualization.” In Proc. IEEE Visualization, pp. 61–68. Los Alamitos, CA: IEEE Press, 2001.

  42. [Byelas and Telea 06] H. Byelas and A. Telea. “Visualization of Areas of Interest in Software Architecture Diagrams.” In Proceedings of the 2006 ACM Symposium on Software Visualization, pp. 105–114. New York: ACM Press, 2006.

  43. [Cabral and Leedom 93] B. Cabral and L. C. Leedom. “Imaging Vector Fields using Line Integral Convolution.” In Proceedings of SIGGRAPH 93, Computer Graphics Proceedings, Annual Conference Series, pp. 263–270. New York: ACM Press, 1993.

  44. [Cao et al. 10a] J. Cao, A. Tagliasacchi, M. Olson, H. Zhang, and Z. Su. “Point Cloud Skeletons via Laplacian Based Contraction.” In Proceedings of International Conference on Shape Modeling and Applications (SMI), pp. 187–197. Los Alamitos, CA: IEEE Press, 2010.

  45. [Cao et al. 10b] T. Cao, K. Tang, A. Mohamed, and T. Tan. “Parallel Banding Algorithm to Compute Exact Distance Transform with the GPU.” In Proc. ACM SIGGRAPH Symp. on Interactive 3D Graphics and Games, pp. 134–141, 2010. Available online (http://www.comp.nus.edu.sg/~tants/pba.html).

  46. [Card et al. 99] S. Card, J. Mackinlay, and B. Shneiderman. Readings in Information Visualization: Using Vision to Think. San Francisco, CA: Morgan Kaufmann, 1999.

  47. [Castleman 96] K. R. Castleman. Digital Image Processing. Englewood Cliffs, NJ: Prentice Hall, 1996.

  48. [CGAL 13] CGAL. “CGAL – Computational Geometry Algorithms Library.” Available online (http://www.cgal.org/), 2013.

  49. [Chalmers 96] M. Chalmers. “A Linear Iteration Time Layout Algorithm for Visualising High-Dimensional Data.” In Proc. IEEE Visualization, pp. 127–131. Los Alamitos, CA: IEEE Press, 1996.

  50. [Chamberlin and Boyce 74] D. D. Chamberlin and R. F. Boyce. “SEQUEL: A Structured English Query Language.” In Proc. International Conference on Management of Data (ACM SIGFIDET) Workshop on Data Description, Access and Coontrol, pp. 249–264. New York: ACM Press, 1974.

  51. [Chang et al. 09] M.-C. Chang, F. Leymarie, and B. Kimia. “Surface Reconstruction from Point Clouds by Transforming the Medial Scaffold.” CVIU 113:11 (2009), 1130–1146.

  52. [Chen and Carroll 00] S. J. Chen and S. D. Carroll. “3-D Reconstruction of Coronary Arterial Tree to Optimize Angiographic Visualization.” IEEE Transactions on Medical Imaging 19:4 (2000), 318–336.

  53. [Chen et al. 00] M. Chen, A. E. Kaufman, and R. Yagel. Volume Graphics. New York: Springer, 2000.

  54. [Chi 00] E. H. Chi. “A Taxonomy of Visualization Techniques using the Data State Reference Model.” In Proc. IEEE InfoVis, pp. 69–75. Los Alamitos, CA: IEEE Press, 2000.

  55. [Chi 02] E. H. Chi. A Framework for Visualizing Information. Human-Computer Interaction Series, Amsterdam: Elsevier, 2002.

  56. [Christensen et al. 10] J. H. Christensen, M. B. T. Soerensen, Z. Linghui, S. Chen, and M. O. Jensen. “Pre-Diagnostic Digital Imaging Prediction Model to Discriminate between Malignant Melanoma and Benign Pigmented Skin Lesion.” Skin Research and Technology 16:1 (2010), 98–108.

  57. [Clarenz et al. 04] U. Clarenz, M. Rumpf, and A. Telea. “Surface Processing Methods for Point Sets using Finite Elements.” Computers and Graphics 28:6 (2004), 851– 868.

  58. [Cleveland 85] W. S. Cleveland. The Elements of Graphing Data. Monterey, CA: Wadsworth Advanced Books and Software, 1985.

  59. [Cline et al. 88] H. E. Cline, W. E. Lorensen, S. Ludke, C. R. Crawford, and B. C. Teeter. “Two Algorithms for the Three-Dimensioal Construction of Tomograms.” Medical Physics 15:3 (1988), 320–327.

  60. [Coffman and Graham 72] E. G. Coffman and R. L. Graham. “Optimal Scheduling for Two-Processor Systems.” Acta Informatica 1:3 (1972), 200–213.

  61. [Cohen et al. 96] J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F. Brooks, and W. Wright. “Simplification Envelopes.” In Proceedings of SIGGRAPH 96, Computer Graphics Proceedings, Annual Conference Series, pp. 119– 128. Reading, MA: Addison Wesley, 1996.

  62. [Cohen et al. 07] J. Cohen, A. Varshney, and G. Turk. “Simplification Envelopes Software.” Available online (http://www.cs.unc.edu/~geom/envelope.html), 2007.

  63. [Comaniciu and Meer 02] D. Comaniciu and P. Meer. “Mean Shift: A Robust Approach Toward Feature Space Analysis.” IEEE TPAMI 24:5 (2002), 603–619.

  64. [Corbi 99] T. A. Corbi. “Program Understanding: Challenge for the 1990s.” IBM Systems Journal 28:2 (1999), 294–306.

  65. [Cormen et al. 01] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. An Introduction to Algorithms, Second edition. Cambridge, MA: MIT Press, 2001.

  66. [Cornea et al. 05] N. D. Cornea, M. F. Demirci, D. Silver, A. Shokoufandeh, and S. Dickinson. “3D Object Retrieval using Many-to-many Matching of Curve Skeletons.” In Proc. Shape Modeling and Applications (SMI’05), pp. 368–373. New York: ACM Press, 2005.

  67. [Cornea et al. 07] N. D. Cornea, D. Silver, and P. Min. “Curve-Skeleton Properties, Applications, and Algorithms.” IEEE TVCG 13:3 (2007), 87–95.

  68. [Costa and Cesar 01] L. Costa and R. Cesar. Shape Analysis and Classification. Boca Raton, FL: CRC Press, 2001.

  69. [Cox and Cox 01] T. F. Cox and M. A. A. Cox. Multidimensional Scaling. Boca Raton, FL: CRC Press, 2001.

  70. [Cui et al. 08] W. Cui, H. Zhou, H. Qu, P. Wong, and X. Li. “Geometry-Based Edge Clustering for Graph Visualization.” IEEE TVCG 14:6 (2008), 1277–1284.

  71. [Cuisenaire and Macq 97] O. Cuisenaire and B. M. Macq. “Applications of the Region Growing Euclidean Distance Transform: Anisotropy and Skeletons.” In Proc. ICIP, pp. 200–203. Washington, D.C.: IEEE Computer Society, 1997.

  72. [CUMULVS 07] CUMULVS. “CUMULVS Visualization System.” Available online (http://www.csm.ornl.gov/cs/cumulvs.html), 2007.

  73. [Danielsson 80] P. E. Danielsson. “Euclidean Distance Mapping.” Computer Graphics and Image Processing 14:3 (1980), 227–248.

  74. [de Berg et al. 00] M. de Berg, M. van Krefeld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications, Second edition. Berlin: Springer-Verlag, 2000.

  75. [de Silva and Tenenbaum 03] V. de Silva and J. B. Tenenbaum. “Global versus Local Methods in Nonlinear Dimensionality Reduction.” In Advances in Neural Information Processing Systems, 15, 15, pp. 705–712. Cambridge, MA: MIT Press, 2003.

  76. [Devita et al. 01] V. T. Devita, S. Hellman, and S. A. Rosenberg. Cancer: Principles & Practice of Oncology. Alphen aan den Rijn, the Netherlands: Lippincott Williams & Wilkins/Wolters Kluwer, 2001.

  77. [Dey and Sun 06] T. K. Dey and J. Sun. “Defining and Computing Curve-Skeletons with Medial Geodesic Function.” In Proc. Symposium on Geometry Processing, pp. 123–152. Aire-la-Ville, Switzerland: Eurographics Association, 2006.

  78. [Dey 06] T. K. Dey. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Cambridge Monographs on Applied and Computational Mathematics, Cambridge, UK: Cambridge University Press, 2006.

  79. [Di Battista et al. 99] G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Englewood Cliffs, NJ: Prentice Hall, 1999.

  80. [Diehl 04] S. Diehl. Software Visualization: International Seminar, Dagstuhl Castle, Germany, May 20–25, 2001, Lecture Notes in Computer Science 2269. New York: Springer, 2004.

  81. [Diehl 07] S. Diehl. Software Visualization: Visualizing the Structure, Behaviour, and Evolution of Software. New York: Springer, 2007.

  82. [Eades 84] P. Eades. “A Heuristic for Graph Drawing.” Congressus Numerantium 42 (1984), 149–160.

  83. [Edelsbrunner et al. 83] H. Edelsbrunner, D. Kirkpatrick, and R. Seidel. “On the Shape of a Set of Points in the Plane.” IEEE Transactions on Information Theory 29:4 (1983), 551–559.

  84. [Eick et al. 92] S. G. Eick, J. L. Steffen, and E. E. Sumner. “Seesoft—A Tool for Visualizing Line Oriented Software Statistics.” IEEE Transactions on Software Engineering 18:11 (1992), 957–968.

  85. [Engel 02] K. Engel. “Interactive High-Quality Volume Rendering with Flexible Consumer Graphics Hardware.” In Eurographics State-of-the-Art (STAR) Reports, pp. 9–16. New York: ACM Press, 2002. See also the software available at http://www.vis.uni-stuttgart.de/~engel/pre-integrated.

  86. [Ersoy et al. 11] O. Ersoy, C. Hurter, F. Paulovich, G. Cantareiro, and A. Telea. “Skeleton-Based Edge Bundles for Graph Visualization.” IEEE TVCG 17:2 (2011), 2364–2373.

  87. [Ester et al. 96] M. Ester, H. P. Kriegel, J. Sander, and X. Xu. “A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise.” In Proc. KDD, pp. 226–231. Menlo Park, CA: AAAI Press, 1996.

  88. [Falc˜ao et al. 04] A. X. Falc˜ao, J. Stolfi, and R. A. Lotufo. “The Image Foresting Transform: Theory, Algorithms, and Applications.” IEEE TPAMI 26:1 (2004), 19–29.

  89. [Faloutsos and Lin 95] C. Faloutsos and K. Lin. “FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets.” ACM SIGMOD Record 2:2 (1995), 163–174.

  90. [Fisher et al. 96] R. Fisher, S. Perkins, A. Walker, and E. Wolfart. Hypermedia Image Processing Reference. New York: J. Wiley and Sons, 1996.

  91. [Foley et al. 95] J. D. Foley, A. van Dam, S. K. Feiner, and J. F. Hughes. Computer Graphics: Principles and Practice in C, Second edition. Reading, MA: Addison-Wesley Professional, 1995.

  92. [Frank and Asuncion 13] A. Frank and A. Asuncion. “UCI machine learning repository.”, 2013. Available online (http://www.ics.uci.edu/~mlearn).

  93. [Frey 01] P. Frey. “Yams: A Fully Automatic Adaptive Isotropic Surface Remeshing Procedure.” Technical Report 0252, INRIA, 2001. Available online (http://www.ann.jussieu.fr/frey/software.html).

  94. [Frick et al. 94] A. Frick, A. Ludwig, and H. Mehldau. “A Fast Adaptive Layout Algorithm for Undirected Graphs.” In Proc. Graph Drawing, pp. 388–403. New York: Springer, 1994.

  95. [Friedman et al. 77] J. H. Friedman, J. L. Bentley, and R. A. Finkel. “An Algorithm for Finding Best Matches in Logarithmic Expected Time.” ACM Transactions on Mathematical Software 3:3 (1977), 209–226.

  96. [Friendly 08] M. Friendly. “Milestones in the History of Thematic Cartography, Statistical Graphics, and Data Visualization.” Available online (http://www.math.yorku.ca/SCS/Gallery/milestone/milestone.pdf), 2008.

  97. [Frigo 14] M. Frigo. “Fast Fourier Transform C Software Library.” Available online (http://www.fftw.org/), 2014.

  98. [Frishman and Tal 08] Y. Frishman and A. Tal. “Online Dynamic Graph Drawing.” IEEE TVCG 14:4 (2008), 727–740.

  99. [Fruchterman and Reingold 91] T. M. J. Fruchterman and E. M. Reingold. “Graph Drawing by Force-Directed Placement.” Software—Practice and Experience 21:11 (1991), 1129–1164.

  100. [Fua et al. 99] Y. Fua, M. O. Ward, and E. A. Rundensteiner. “Hierarchical Parallel Coordinates for Visualizing Large Multivariate Data Sets.” In Proc. IEEE Visualization, pp. 43–50. Los Alamitos, CA: IEEE Press, 1999.

  101. [Fukunaga 90] K. Fukunaga. Introduction to Statistical Pattern Recognition, Second edition. San Diego, CA: Academic Press, 1990.

  102. [Gansner and Koren 07] E. R. Gansner and Y. Koren. “Improved Circular Layouts.” In Proc. Graph Drawing, pp. 386–398. Berlin: Springer Verlag, 2007.

  103. [Gansner et al. 93] E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. “A Technique for Drawing Directed Graphs.” IEEE Transactions on Software Engineering 19:3 (1993), 214–230.

  104. [Garland and Heckbert 97] M. Garland and P. Heckbert. “Simplification using Quadric Error Metrics.” In Proceedings of SIGGRAPH 97, Computer Graphics Proceedings, Annual Conference Series, pp. 209–216. Reading, MA: Addison Wesley, 1997.

  105. [Garland 99] M. Garland. “Multiresolution Modeling: Survey and Future Opportunities.” In Eurographics’99 State-of-the-Art (STAR) Reports. Aire-la-Ville, Switzerland: Eurographics Association, 1999.

  106. [Ge and Fitzpatrick 96] Yaorong Ge and J. Michael Fitzpatrick. “On the Generation of Skeletons from Discrete Euclidean Distance Maps.” IEEE Trans. Pattern Anal. Mach. Intell. 18:11 (1996), 1055–1066.

  107. [Geist et al. 97] G. A. Geist, J. A. Kohl, and P. M. Papadopoulos. “CUMULVS: Providing Fault-Tolerance, Visualization and Steering of Parallel Applications.” International Journal of High Performance Computing Applications 11:3 (1997), 224–236.

  108. [GEM 07] GEM. “Graph Embedder (GEM) Software.” Available online (http://i44ftp.info.uni-karlsruhe.de/pub/papers/frick/gem1.0a.tar.gz), 2007.

  109. [Gephi 14] Gephi. “An Open Graph Visualization Platform.” Available online (http://gephi.org), 2014.

  110. [GIMP 14] GIMP. “GIMP—The GNU Image Manipulation Program.” Available online (http://www.gimp.org/), 2014.

  111. [Golub and van Loan 89] G. H. Golub and C. F. van Loan. Matrix Computations, Second edition. Baltimore, MD: John Hopkins Univ. Press, 1989.

  112. [Gonzalez and Woods 02] R. C. Gonzalez and R. E. Woods. Digital Image Processing, Second edition. Englewood Cliffs, NJ: Prentice Hall, 2002.

  113. [Gonzalez et al. 04] R. C. Gonzalez, R. E. Woods, and S. L. Eddins. Digital Image Processing using MATLAB. Englewood Cliffs, NJ: Prentice Hall, 2004.

  114. [GPGPU 14] GPGPU. “General-Purpose Computation Using Graphics Hardware.” Available online (http://www.gpgpu.org/), 2014.

  115. [GraphViz 14] GraphViz. “The GraphViz Graph Visualization Software.” Available online (http://www.graphviz.org/), 2014.

  116. [Greilich et al. 09] M. Greilich, M. Burch, and S. Diehl. “Visualizing the Evolution of Compound Digraphs with TimeArcTrees.” Computer Graphics Forum 28:3 (2009), 975–982.

  117. [Griebel and Schweitzer 06] M. Griebel and M. A. Schweitzer. Meshfree Methods for Partial Differential Equations. New York: Springer, 2006.

  118. [Griebel et al. 04] M. Griebel, T. Preusser, M. Rumpf, M. A. Schweitzer, and A. Telea. “Flow Field Clustering via Algebraic Multigrid.” In Proc. IEEE Visualization, pp. 35–42. Los Alamitos, CA: IEEE Press, 2004.

  119. [Grivet et al. 04] S. Grivet, D. Auber, J. P. Domenger, and G. Melançon. “Bubble Tree Drawing Algorithm.” In Proc. International Conference on Computer Vision and Graphics (ICCVG), pp. 633–641. Berlin: Springer, 2004.

  120. [GTS 13] GTS. “The GNU Triangulated Surface Library.” Available online (http://gts.sourceforge.net/), 2013.

  121. [Hansen and Johnson 05] C. Hansen and C. J. Johnson. The Visualization Handbook. Amsterdam: Elsevier, 2005.

  122. [Harel and Koren 00] D. Harel and Y. Koren. “A Fast Multi-Scale Method for Drawing Large Graphs.” In Proc. 8th International Symposium on Graph Drawing (GD00), pp. 183–196. Berlin: Springer, 2000.

  123. [Hartmann 99] E. Hartmann. “On the Curvature of Curves and Surfaces Defined by Normalforms.” Computer Aided Geometric Design 16 (1999), 355–376.

  124. [Hauser et al. 02] H. Hauser, F. Ledermann, and H. Doleisch. “Angular Brushing of Extended Parallel Coordinates.” In Proc. IEEE Visualization, pp. 127–135. Los Alamitos, CA: IEEE Press, 2002.

  125. [Havre et al. 02] S. Havre, E. Hetzler, P. Whitney, and L. Nowell. “ThemeRiver: Visualizing Thematic Changes in Large Document Collections.” IEEE TVCG 8:1 (2002), 9–20.

  126. [Heckbert and Garland 97] P. Heckbert and M. Garland. “Survey of Polygonal Surface Simplification Algorithms.” In SIGGRAPH’97 Course Notes on Multiresolution Surface Modeling. New York: ACM Press, 1997.

  127. [Heckel et al. 99] B. Heckel, G. H. Weber, B. Hamann, and K. I. Joy. “Construction of Vector Field Hierarchies.” In Proc. IEEE Visualization, pp. 19–25. Los Alamitos, CA: IEEE Press, 1999.

  128. [Helman and Hesselink 89] J. L. Helman and L. Hesselink. “Representation and Display of Vector Field Topology in Fluid Flow Data Sets.” IEEE Computer 22:9 (1989), 27–36.

  129. [Helman and Hesselink 91] J. L. Helman and L. Hesselink. “Visualizing Vector Field Topology in Fluid Flows.” IEEE Computer Graphics and Applications 11:3 (1991), 36–46.

  130. [Henderson 04] A. Henderson. The ParaView Guide. Clifton Park, NY: Kitware, Inc., 2004.

  131. [Herman et al. 00] I. Herman, G. Melançon, and M. S. Marshall. “Graph Visualization and Navigation in Information Visualization: A Survey.” IEEE Transactions on Visualization and Computer Graphics 6:1 (2000), 24–43.

  132. [Holten and van Wijk 08] D. Holten and J. J. van Wijk. “Visual Comparison of Hierarchically Organized Data.” Comp. Graph. Forum 27:3 (2008), 759–766.

  133. [Holten and van Wijk 09] D. Holten and J. J. van Wijk. “Force-Directed Edge Bundling for Graph Visualization.” Computer Graphics Forum 28:3 (2009), 670– 677.

  134. [Holten 06] D. H. R. Holten. “Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data.” IEEE Transactions on Visualization and Computer Graphics (Proc. InfoVis 2006) 12:5 (2006), 741–748.

  135. [Hoppe et al. 92] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle. “Surface Reconstruction from Unorganized Points.” Proc. ACM SIGGRAPH 26:2 (1992), 71–78.

  136. [Hoppe 97] H. Hoppe. “View-Dependent Refinement of Progressive Meshes.” In Proceedings of SIGGRAPH 97, Computer Graphics Proceedings, Annual Conference Series, pp. 189–198. Reading, MA: Addison Wesley, 1997.

  137. [Hoppe 98] H. Hoppe. “Efficient Implementation of Progressive Meshes.” Computers & Graphics 22:1 (1998), 27–36.

  138. [Hoppe 99] H. Hoppe. “New Quadric Metrics for Simplifying Meshes with Appearance Attributes.” In Proc. IEEE Visualization, pp. 59–66. Los Alamitos, CA: IEEE Press, 1999.

  139. [Hotz et al. 10] I. Hotz, J. Sreevalsan-Nair, H. Hagen, and B. Hamann. “Tensor Field Reconstruction Based on Eigenvector and Eigenvalue Interpolation.” In Scientific Visualization: Advanced Concepts, 1, edited by H. Hagen, 1, pp. 110–123. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.

  140. [Hurter et al. 12] C. Hurter, O. Ersoy, and A. Telea. “Graph Bundling by Kernel Density Estimation.” Computer Graphics Forum 31:3 (2012), 435–443.

  141. [Hurter et al. 13] C. Hurter, O. Ersoy, and A. Telea. “Smooth Bundling of Large Streaming and Sequence Graphs.” In Proc. PacificVis, pp. 41–48. Los Alamitos, CA: IEEE Press, 2013.

  142. [ICC 14] ICC. “International Color Consortium.” Available online (http://www.color.org), 2014.

  143. [ImageJ 13] ImageJ. “ImageJ Image Processing Software.” Available online (http://rsbweb.nih.gov/ij/), 2013.

  144. [InfoWiki 14] InfoWiki. “The Information Visualization Community Platform.” Available online (http://www.infovis-wiki.net/), 2014.

  145. [Inselberg and Dimsdale 90] A. Inselberg and B. Dimsdale. “Parallel Coordinates: A Tool for Visualizing Multidimensional Geometry.” In Proc. IEEE Visualization, pp. 361–378. Los Alamitos, CA: IEEE Press, 1990.

  146. [Inselberg 98] A. Inselberg. “A Survey of Parallel Coordinates.” In Mathematical Visualization, pp. 167–179. New York: Springer, 1998.

  147. [Inselberg 09] A. Inselberg. Parallel Coordinates – Visual Multidimensional Geometry and its Applications. New York: Springer, 2009.

  148. [Jain and Murty 99] A. K. Jain and M. N. Murty. “Data Clustering: A Review.” ACM Computing Surveys 31:3 (1999), 264–323.

  149. [Jain et al. 95] R. Jain, R. Kasturi, and B. G. Shunck. Machine Vision. New York: McGraw-Hill, 1995.

  150. [Jain 89] A. Jain. Fundamentals of Digital Image Processing. Englewood Cliffs, NJ: Prentice Hall, 1989.

  151. [Jalba et al. 13] A. Jalba, J. Kustra, and A. Telea. “Surface and Curve Skeletonization of Large 3D Models on the GPU.” IEEE TPAMI 35:6 (2013), 1495–1508.

  152. [Jankun-Kelly et al. 06] M. Jankun-Kelly, M. Jiang, D. Thompson, and R. Machiraju. “Vortex Visualization for Practical Engineering Applications.” IEEE Transactions on Visualization and Computer Graphics 12:5 (2006), 957–964.

  153. [Jansing et al. 99] E. D. Jansing, T. A. Albert, and D. L. Chenoweth. “Two-Dimensional Entropic Segmentation.” Pattern Recognition Letters 20:3 (1999), 329–336.

  154. [Jobard and Lefer 97] B. Jobard and W. Lefer. “Creating Evenly-Spaced Streamlines of Arbitrary Density.” In Proc. EG Workshop on Visualization in Scientific Computing, pp. 43–56. New York: Springer, 1997.

  155. [Johnson and Shneiderman 91] B. Johnson and B. Shneiderman. “Tree-Maps: A Space-Filling Approach to the Visualization of Hierarchical Information Structures.” In Proc. IEEE InfoVis, pp. 284–291. Los Alamitos, CA: IEEE Press, 1991.

  156. [Joia et al. 11] P. Joia, D. Coimbra, J. A. Cuminato, F. V. Paulovich, and L. G. Nonato. “Local Affine Multidimensional Projection.” IEEE TVCG 17:12 (2011), 2563–2571.

  157. [Jünger and Mutzel 03] M. Jünger and P. Mutzel. Graph Drawing Software. New York: Springer, 2003.

  158. [Kamada and Kawai 89] T. Kamada and S. Kawai. “An Algorithm for Drawing General Undirected Graphs.” Information Processing Letters 31:1 (1989), 7–15.

  159. [Kass et al. 88] M. Kass, A. Witkin, and D. Terzopoulos. “Snakes: Active Contour Models.” International Journal of Computer Vision 1:4 (1988), 321–331.

  160. [Kazhdan et al. 06] M. Kazhdan, M. Bolitho, and H. Hoppe. “Poisson Surface Reconstruction.” In Proc. Symp. Geometry Processing (SGP), pp. 61–70, 2006. http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4.51.

  161. [Kindlmann et al. 00] G. Kindlmann, D.Weinstein, and D. Hart. “Strategies for Direct Volume Rendering of Diffusion Tensor Fields.” IEEE TVCG 6:2 (2000), 124–138.

  162. [Kindlmann 04a] G. Kindlmann. “Superquadric Tensor Glyphs.” In Proc. EG/IEEE Symposium on Visualization (VisSym’04), pp. 147–154. Aire-la-Ville, Switzerland: Eurographics Association, 2004.

  163. [Kindlmann 04b] Gordon Kindlmann. “Visualization and Analysis of Diffusion Tensor Fields.” PhD thesis, School of Computing, University of Utah, 2004.

  164. [Kindlmann 06] G. Kindlmann. “The Teem Tensor Visualization Software Package.” Available online (http://teem.sourceforge.net/), 2006.

  165. [Kitware, Inc. 04] Kitware, Inc. The VTK User’s Guide. Clifton Park, NY: Kitware, Inc., 2004.

  166. [Kitware, Inc. 13] Kitware, Inc. “VTK Home Page.” Available online (http://www.kitware.com/vtk), 2013.

  167. [Koike 93] H. Koike. “The Role of Another Spatial Dimension in Software Visualization.” ACM Transactions of Information Systems 11:3 (1993), 266–286.

  168. [Koren et al. 03] Y. Koren, L. Carmel, and D. Harel. “Drawing Huge Graphs by Algebraic Multigrid Optimization.” Multiscale Modeling and Simulation 1:4 (2003), 645–673.

  169. [Koschke 03] R. Koschke. “Software Visualization in Software Maintenance, Reverse Engineering, and Re-Engineering: A Research Survey.” J. Soft. Maint. and Evol. 15:2 (2003), 87–109.

  170. [Kruskal and Landwehr 83] J. B. Kruskal and J. M. Landwehr. “Icicle Plots: Better Displays for Hierarchical Clustering.” JSTOR 37:2 (1983), 162–168.

  171. [Lambert et al. 10] A. Lambert, R. Bourqui, and D. Auber. “Winding Roads: Routing Edges into Bundles.” Computer Graphics Forum 29:3 (2010), 432–439.

  172. [Lanza and Marinescu 06] M. Lanza and R. Marinescu. Object-Oriented Metrics in Practice. New York: Springer, 2006.

  173. [Laramee et al. 04] R. S. Laramee, H. Hauser, H. Doleisch, B. Vrolijk, F. H. Post, and D. Weiskopf. “The State of the Art in Flow Visualization: Dense and Texture-Based Techniques.” Computer Graphics Forum 23:2 (2004), 203–221.

  174. [Laramee et al. 07] R. S. Laramee, H. Hauser, L. Zhao, and F. Post. “Topology-Based Flow Visualization – The State of the Art.” In Topology-Based Methods in Visualization, edited by H. Hauser, H. Hagen, and H. Theisel, pp. 1–19. Berlin: Springer, 2007.

  175. [Larkin and Simon 87] J. Larkin and H. Simon. “Why a Diagram Is (Sometimes) Worth 10,000 Words.” Cognitive Science 11 (1987), 65–99.

  176. [Lederman 12] F. Lederman. “Parvis Parallel Coordinates Visualisation.” Available online (http://home.subnet.at/flo/mv/parvis/), 2012.

  177. [Levoy 88] Marc Levoy. “Display of Surfaces from Volume Data.” IEEE Computer Graphics and Applications 8:3 (1988), 29–37.

  178. [Li and Shen 07] L. Li and H.-W. Shen. “Image-Based Streamline Generation and Rendering.” IEEE TVCG 13:3 (2007), 630–640.

  179. [Li et al. 10] C. Li, C. Xu, C. Gui, and M. D. Fox. “Distance Regularized Level Set Evolution and Its Application to Image Segmentation.” IEEE TPAMI 19:12 (2010), 3243–3254.

  180. [Lichtenbelt et al. 98] B. Lichtenbelt, R. Crane, and S. Naqvi. Introduction to Volume Rendering. Upper Saddle River, NJ: Prentice Hall - Hewlett-Packard Professional Books, 1998.

  181. [Linsen and Prautzsch 01] L. Linsen and H. Prautzsch. “Local versus Global Triangulation.” In Proc. Eurographics, pp. 201–208. Aire-la-Ville, Switzerland: Euro-graphics Association, 2001.

  182. [Liu et al. 10] L. Liu, E. Chambers, D. Letscher, and T. Ju. “A Simple and Robust Thinning Algorithm on Cell Complexes.” Computer Graphics Forum 29:7 (2010), 2253–2260.

  183. [Loop 87] C. T. Loop. “Smooth Subdivision Surfaces Based on Triangles.” Master’s thesis, Dept. of Mathematics, University of Utah, 1987. Available online (http://research.microsoft.com/en-us/um/people/cloop/thesis.pdf).

  184. [Lorensen and Cline 87] W. E. Lorensen and H. E. Cline. “Marching Cubes: A High Resolution 3D Surface Construction Algorithm.” Proc. SIGGRAPH ‘87, Computer Graphics 21:4 (1987), 163–169.

  185. [Lorensen 04] B. Lorensen. “On the Death of Visualization.” In Proc. NIH/NSF Fall Workshop on Visualization Research Challenges. Los Alamitos, CA: IEEE Press, 2004.

  186. [Lotufo et al. 00] R. A. Lotufo, A. X. Falc˜ao, and F. Zampirolli. “Fast Euclidean Distance Transform using a Graph-Search Algorithm.” In Proc. SIBGRAPI, pp. 269– 275. Washington, D.C.: IEEE Computer Society, 2000.

  187. [Low and Tan 97] K. L. Low and T.S. Tan. “Model Simplification using Vertex Clustering.” In Proc. ACM Symposium on Interactive 3D Graphics, pp. 75–82. New York: ACM Press, 1997.

  188. [Luebke 01] D. Luebke. “A Developer’s Survey of Polygonal Simplification Algorithms.” IEEE Computer Graphics & Applications 21:3 (2001), 24–35.

  189. [Ma et al. 12] J. Ma, S. Bae, and S. Choi. “3D Medial Axis Point Approximation Using Nearest Neighbors and the Normal Field.” Visual Computer 28:1 (2012), 7–19.

  190. [Mackinlay 86] J. D. Mackinlay. “Automating the Design of Graphical Presentations of Relational Information.” ACM Transactions on Graphics 5:2 (1986), 110–141.

  191. [Majda et al. 01] A. J. Majda, A. L. Bertozzi, and D. G. Crighton. Vorticity and Incompressible Flow. Cambridge, UK: Cambridge University Press, 2001.

  192. [Manzanera et al. 99] A. Manzanera, T. Bernard, F. Preteux, and B. Longuet. “Medial Faces from a Concise 3D Thinning Algorithm.” In Proc. ICCV 99, pp. 337–343. Los Alamitos, CA: IEEE Press, 1999.

  193. [Mao et al. 98] X. Mao, Y. Hatanaka, H. Higashida, and A. Imamyia. “Image-Guided Streamline Placement on Curvilinear Grid Surfaces.” In Proc. IEEE Visualization, pp. 135–142. Los Alamitos, CA: IEEE Press, 1998.

  194. [Marcus et al. 03] A. Marcus, L. Feng, and J. I. Maletic. “3D Representations for Software Visualization.” In Proc. ACM SoftVis, pp. 27–36. New York: ACM Press, 2003.

  195. [Martins et al. 14] R. Martins, D. Coimbra, R. Minghim, and A. Telea. “Visual Analysis of Dimensionality Reduction Quality for Parameterized Projections.” Computers & Graphics 41 (2014), 26–42.

  196. [MathWorks, Inc. 14] MathWorks, Inc. “MATLAB.” Available online (http://www.mathworks.com/products/matlab), 2014.

  197. [MayaVi 13] MayaVi. “The MayaVi Visualization System.” Available online (http://mayavi.sourceforge.net), 2013.

  198. [McCormick et al. 87] B. H. McCormick, T. A. DeFanti, and M. D. Brown. “Visualization in Scientific Computing.” Computer Graphics 21:6.

  199. [McLoughlin et al. 10] T. McLoughlin, R. S. Laramee, and E. Zhang. “Constructing Streak Surfaces in 3D Unsteady Vector Fields.” In Proceedings of the 26th Spring Conference on Computer Graphics (SCCG), pp. 25–32. New York: ACM Press, 2010. Additional pseudocode available at http://cs.swan.ac.uk/~cstony/research/streaksurfaces/mcloughlin10streaksurfacessupplementary.pdf.

  200. [McReynolds and Blythe 99] T. McReynolds and D. Blythe. “Advanced Graphics Programming Techniques using OpenGL.” In SIGGRAPH ‘99 Course Notes. New York: ACM Press, 1999. Available online (http://www.opengl.org/resources/code/samples/sig99/).

  201. [Mead 92] A. Mead. “Review of the Development of Multidimensional Scaling Methods.” The Statistician 33 (1992), 27–35.

  202. [Mebarki et al. 05] A. Mebarki, P. Alliez, and O. Devillers. “Farthest Point Seeding for Efficient Placement of Streamlines.” In Proc. IEEE Visualization, pp. 479–486. Los Alamitos, CA: IEEE CS Press, 2005.

  203. [Meijster et al. 00] A. Meijster, J. Roerdink, and W. Hesselink. “A General Algorithm for Computing Distance Transforms in Linear Time.” In Mathematical Morphology and Its Applications to Image and Signal Processing, pp. 331–340. Dordrecht: Kluwer, 2000.

  204. [MeshLab 14] MeshLab. “MeshLab Mesh Processing Tool.” Available online (http://meshlab.sourceforge.net), 2014.

  205. [MeVis Inc. 13] MeVis Inc. “The MeVisLab Visualization Framework.” Available online (http://www.mevislab.de), 2013.

  206. [Meyer et al. 12] J. Meyer, J. Thomas, S. Diehl, B. Fisher, D. Keim, D. Laidlaw, S. Miksch, K. Mueller, W. Ribarsky, B. Preim, and A. Ynnerman. “From Visualization to Visually Enabled Reasoning.” In Scientific Visualization: Advanced Concepts (Dagstuhl Follow-up Series), pp. 227–245. Wadern, Germany: Leigniz Center for Informatics / Dagstuhl Publishing, 2012.

  207. [Moreland 09] K. Moreland. “Diverging Color Maps for Scientific Visualization.” In Proceedings of the 5th International Symposium on Advances in Visual Computing, pp. 92–103. Berlin: Springer, 2009.

  208. [Morse et al. 02] E. Morse, M. Lewis, and K. A. Olsen. “Testing Visual Information Retrieval Methodologies Case Study: Comparative Analysis of Textual, Icon, Graphical, and ‘Spring’ Displays.” Journal of the American Society for Information Science and Technology 53:1 (2002), 28–40.

  209. [Mount 06] D. M. Mount. “ANN Programming Manual.” Available online (http://www.cs.umd.edu/~mount/ANN/Files/1.1/ANNmanual\1.1.pdf), 2006.

  210. [Mullikin 92] J. Mullikin. “The Vector Distance Transform in Two and Three Dimensions.” CVGIP: Graphical Models and Image Processing 54:6 (1992), 526–535.

  211. [Munzner 09] T. Munzner. “A Nested Model for Visualization Design and Validation.” IEEE TVCG 15:6 (2009), 921–928.

  212. [Myler and Weeks 93] H. R. Myler and A. R. Weeks. Computer Imaging Recipes in C. Englewood Cliffs, NJ: Prentice Hall, 1993.

  213. [National Library of Medicine 14] National Library of Medicine. “The Insight Segmentation and Registration Toolkit (ITK).” Available online (http://www.itk.org), 2014.

  214. [Nguyen et al. 12] Q. Nguyen, P. Eades, and S.-H. Hong. “StreamEB: Stream edge bundling.” In Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012, Revised Selected Papers, LNCS 7704, pp. 324–332. Berlin: Springer, 2012.

  215. [Nielson et al. 06] G. M. Nielson, G.-P. Bonneau, and T. Ertl. Scientific Visualization: The Visual Extraction of Knowledge from Data. New York: Springer, 2006.

  216. [Nooruddin and Turk 03] F. Nooruddin and G. Turk. “Simplification and Repair of Polygonal Models Using Volumetric Techniques.” IEEE TVCG 9:2 (2003), 191– 205. http://www.cs.princeton.edu/~min/binvox.

  217. [O’Donnel and Westin 05] L. O’Donnel and C.-F. Westin. “White Matter Tract Clustering and Correspondence in Populations.” In Proc. Medical Image Computing and Computer-Assisted Interventions (MICCAI’05), LNCS 3749. Berlin: Springer-Verlag, 2005.

  218. [Oeltze et al. 07] S. Oeltze, H. Doleisch, H. Hauser, P. Muigg, and B. Preim. “Inter-active Visual Analysis of Perfusion Data.” IEEE TVCG 13:6 (2007), 1392–1399.

  219. [Ogniewicz and Kubler 95] R. L. Ogniewicz and O. Kubler. “Hierarchic Voronoi Skeletons.” Pattern Recognition 28:3 (1995), 343–359.

  220. [Ohtake et al. 03] Y. Ohtake, A. Belyaev, M. Alexa, G. Turk, and H. P. Seidel. “Multi-Level Partition of Unity Implicits.” Proc. SIGGRAPH ‘03, Transactions on Graphics 22 (2003), 463–470.

  221. [Okabe et al. 92] A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Chichester, UK: John Wiley & Sons, 1992.

  222. [OpenCV 14] OpenCV. “The OpenCV Computer Vision Library.” Available online (http://opencvlibrary.sourceforge.net/), 2014.

  223. [Otsu 79] N. Otsu. “A Threshold Selection Method from Gray-level Histograms.” IEEE Transactions on Systems, Man and Cybernetics 9:1 (1979), 62–66.

  224. [Paiva et al. 11] J. G. Paiva, L. Florian, H. Pedrini, G. P. Telles, and R. Minghim. “Improved Similarity Trees and Their Application to Visual Data Classification.” IEEE TVCG 17:12 (2011), 2459–2468. Url-http://infoserver.lcad.icmc.usp.br/infovis2/Tools.

  225. [Palagyi and Kuba 99] K. Palagyi and A. Kuba. “Directional 3D Thinning using 8 Subiterations.” In Proc. DGCI 99, Lecture Notes in Computer Science 1568, pp. 325–333. London: Springer-Verlag, 1999.

  226. [Parolin et al. 10] A. Parolin, E. Herzer, and C. Jung. “Semi-automated Diagnosis of Melanoma through the Analysis of Dermatological Images.” In Proc. SIBGRAPI, pp. 71–78. Los Alamitos, CA: IEEE Press, 2010.

  227. [Paulovich et al. 07] F. V. Paulovich, M. C. F. Oliveira, and R. Minghim. “The Projection Explorer: A Flexible Tool for Projection-Based Multidimensional Visualization.” In Proc. 20th Brazilian Symp. on Computer Graphics and Image Processing (SIBGRAPI), pp. 27–36. Los Alamitos, CA: IEEE Press, 2007. http://infoserver.lcad.icmc.usp.br/infovis2/PEx.

  228. [Paulovich et al. 08] F. V. Paulovich, L. G. Nonato, R. Minghim, and H. Levkowitz. “Least Square Projection: A Fast High Precision Multidimensional Projection Technique and its Application to Document Mapping.” IEEE TVCG 14:3 (2008), 564–575.

  229. [Paulovich et al. 10] F. V. Paulovich, C. Silva, and L. G. Nonato. “Two-Phase Mapping for Projecting Massive Data Sets.” IEEE TVCG 16 (2010), 1281–1290.

  230. [Paulovich et al. 11] F. Paulovich, D. Eler, J. Poco, C. Botha, R. Minghim, and L. G. Nonato. “Piecewise Laplacian-based Projection for Interactive Data Exploration and Organization.” Computer Graphics Forum 30:3 (2011), 1091–1100.

  231. [Peeters et al. 09] T. Peeters, A. Vilanova, and B. ter Haar Romenij. “Interactive Fiber Structure Visualization of the Heart.” Computer Graphics Forum 28:8 (2009), 2140–2150.

  232. [Pekalska et al. 99] E. Pekalska, D. de Ridder, R. Duin, and M. Kraaijveld. “A New Method of Generalizing Sammon Mapping with Application to Algorithm Speedup.” In Proceedings of the 5th Annual Conference of the Advanced School for Computing and Imaging (ASCI), pp. 221–228. Delft, NL: ASCI Press, 1999.

  233. [Perona and Malik 90] P. Perona and J. Malik. “Scale-Space and Edge Detection using Anisotropic Diffusion.” IEEE Transactions on Pattern Analysis and Machine Intelligence 12:7 (1990), 629–639.

  234. [Pfleeger et al. 05] S. L. Pfleeger, C. Verhoef, and J. C. van Vliet. “Analyzing the Evolution of Large-Scale Software.” Journal of Software Maintenance 17:1 (2005), 1–2.

  235. [Pierpaoli and Basser 96] C. Pierpaoli and P. J. Basser. “Toward a Quantitative Assessment of Diffusion Anisotropy.” Magnetic Resonance in Medicine 36:6 (1996), 893–906.

  236. [Platt 05] J. C. Platt. “FastMap, MetricMap, and Landmark MDS are all Nyström Algorithms.” In Proc. 10th Intl. Workshop on Artificial Intelligence and Statistics, pp. 261–268. Society for Artificial Intelligence and Statistics, 2005.

  237. [Plaugher et al. 00] P. J. Plaugher, A. Stepanov, M. Lee, and D. R. Musser. The C++ Standard Template Library. Englewood Cliffs, NJ: Prentice Hall PTR, 2000.

  238. [Pobitzer et al. 11] A. Pobitzer, R. Peikert, R. Fuchs, B. Schindler, A. Kuhn, H. Theisel, K. Matkovic, and H. Hauser. “The State of the Art in Topology-Based Visualization of Unsteady Flow.” Computer Graphics Forum 30:6 (2011), 1789–1811.

  239. [Post et al. 02] F. H. Post, B. Vrolijk, H. Hauser, R. S. Laramee, and H. Doleisch. “Feature Extraction and Visualization of Flow Fields.” In EUROGRAPHICS 2002 State of the Art Reports, pp. 69–100. Aire-la-Ville, Switzerland: Eurographics Association, 2002.

  240. [Post et al. 03a] F. H. Post, G.-P. Bonneau, and G. M. Nielson. Data Visualization: The State of the Art. New York: Springer, 2003.

  241. [Post et al. 03b] F. H. Post, B. Vrolijk, H. Hauser, R. S. Laramee, and H. Doleisch. “The State of the Art in Flow Visualization: Feature Extraction and Tracking.” Computer Graphics Forum 22:4 (2003), 775–792.

  242. [Preim and Bartz 07] B. Preim and D. Bartz. Visualization in Medicine: Theory, Algorithms, and Applications. San Francisco, CA: Morgan Kaufmann, 2007.

  243. [Press et al. 02] W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C++, Second edition. Cambridge, UK: Cambridge University Press, 2002.

  244. [Preusser and Rumpf 99] T. Preusser and M. Rumpf. “Anisotropic Nonlinear Diffusion in Flow Visualization.” In Proc. IEEE Visualization, pp. 323–332. Los Alamitos, CA: IEEE Press, 1999.

  245. [Prewitt and Mendelsohn 66] J. M. S. Prewitt and M. L. Mendelsohn. “The Analysis of Cell Images.” Annals of the New York Academy of Science 128:3 (1966), 1035– 1053.

  246. [Rao and Card 94] R. Rao and S. K. Card. “The Table Lens: Merging Graphical and Symbolic Representations in an Interactive Focus+Context Visualization for Tabular Information.” In Proc. ACM Conference on Human Factors in Computing Systems (CHI), pp. 318–322. New York: ACM Press, 1994.

  247. [Rauber et al. 13] P. E. Rauber, A. X. Falc˜ao, T. V. Spina, and P. J. de Rezende. “Interactive Segmentation by Image Foresting Transform on Superpixel Graphs.” In Proc. SIBGRAPI, pp. 133–140. Los Alamitos, CA: IEEE Press, 2013.

  248. [Reddy 93] J. N. Reddy. Introduction to the Finite Element Method, Second edition. New York: McGraw-Hill, 1993.

  249. [Reinders et al. 99] F. Reinders, F. H. Post, and H. J. W. Spoelder. “Attribute-Based Feature Tracking.” In Proc. Data Visualization (VisSym’99), pp. 63–72. New York: Springer, 1999.

  250. [Reinders et al. 00] F. Reinders, M. Jacobson, and F. Post. “Skeleton Graph Generation for Feature Shape Description.” In Proc. Data Visualization (VisSym’00), pp. 73–82. Aire-la-Ville, Switzerland: Eurographics Association, 2000.

  251. [Reiss 05] S. P. Reiss. “The Paradox of Software Visualizaton.” In Proc. 3rd Intl. Workshop on Visualizing Software for Understanding and Analysis (VISSOFT’05), pp. 59–63. Los Alamitos, CA: IEEE Press, 2005.

  252. [Reniers et al. 08] D. Reniers, J. J. van Wijk, and A. Telea. “Computing Multiscale Skeletons of Genus 0 Objects Using a Global Importance Measure.” IEEE TVCG 14:2 (2008), 355–368.

  253. [Reniers et al. 14] D. Reniers, L. Voinea, O. Ersoy, and A. Telea. “The Solid* Toolset for Software Visual Analytics of Program Structure and Metrics Comprehension: From Research Prototype to Product.” Science of Computer Programming 79:1 (2014), 224–240.

  254. [Rezk-Salama et al. 99] C. Rezk-Salama, P. Hastreiter, T. Christian, and T. Ertl. “Interactive Exploration of Volume Line Integral Convolution Based on 3D-Texture Mapping.” In Proc. IEEE Visualization, edited by David Ebert, Markus Gross, and Bernd Hamann, pp. 233–240. Los Alamitos, CA: IEEE Press, 1999.

  255. [Ribarsky et al. 94] W. Ribarsky, B. Brown, T. Myerson, R. Feldmann, S. Smith, and L. Treinish. “Object-Oriented, Dataflow Visualization Systems—A Paradigm Shift?” In Scientific Visualization: Advances and Challenges, pp. 251–263. New York: Academic Press, 1994.

  256. [Robertson et al. 91] G. Robertson, J. D. Mackinlay, and S. K. Card. “Cone Trees: Animated 3D Visualizations of Hierarchical Information.” In Proc. ACM Conference on Human Factors in Computing Systems (CHI), pp. 189–194. New York: ACM Press, 1991.

  257. [Roettger 06] S. Roettger. “The Volume Library.” Available online (http://www9.informatik.uni-erlangen.de/External/vollib/), 2006.

  258. [Roettger 08] S. Roettger. “V3: The Versatile Volume Viewer.” Available online (http://www.stereofx.org/volume.html), 2008.

  259. [Rossignac and Borrel 93] J. Rossignac and P. Borrel. “Multi-Resolution 3D Approximations for Rendering Complex Scenes.” In Geometric Modeling in Computer Graphics, pp. 455–465. New York: Springer, 1993.

  260. [Roweis and Saul 00] S. T. Roweis and L. K. Saul. “Nonlinear Dimensionality Reduction by Locally Linear Embedding.” Science 290:5500 (2000), 2323–2326.

  261. [Sakamoto and Takagi 88] M. Sakamoto and M. Takagi. “Patterns of Weighted Voronoi Tessellations.” Science on Form 3:2 (1988), 103–111.

  262. [Samet 90] H. Samet. The Design and Analysis of Spatial Data Structures. Reading, MA: Addision-Wesley, 1990.

  263. [Schalkoff 89] R. Schalkoff. Digital Image Processing and Computer Vision. New York: John Wiley & Sons, 1989.

  264. [Schneider and Seifert 06] O. Schneider and B. Seifert. “WinDirStat—Windows Directory Statistics.” Available online (http://windirstat.info/), 2006.

  265. [Schroeder et al. 92] W. Schroeder, J. Zarge, and W. Lorensen. “Decimation of Triangle Meshes.” Proc. SIGGRAPH ‘92,Computer Graphics 26:2 (1992), 65–70.

  266. [Schroeder et al. 06] W. Schroeder, K. Martin, and B. Lorensen. The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics, Fourth edition. Clifton Park, NY: Kitware, Inc., 2006.

  267. [Schroeder 97] W. Schroeder. “A Topology-Modifying Progressive Decimation Algorithm.” In Proc. IEEE Visualization, pp. 205–212. Los Alamitos, CA: IEEE Press, 1997.

  268. [SCIRun 07] SCIRun. “SCIRun: A Scientific Computing Problem Solving Environment, Scientific Computing and Imaging Institute (SCI).” Available online (http://software.sci.utah.edu/scirun.html), 2007.

  269. [Sethian 96] J. A. Sethian. Level Set Methods: Evolving Interfaces in Geometry, Fluid Mechanics, Computer Vision, and Materials Science. Cambridge, UK: Cambridge University Press, 1996.

  270. [Shepard 68] D. Shepard. “A Two-Dimensional Interpolation Function for Irregularly Spaced Data.” In Proc. 23rd ACM International Conference, pp. 517–724. New York: ACM Press, 1968.

  271. [Shewchuk 02] J. R. Shewchuk. “Delaunay Refinement Algorithms for Triangular Mesh Generation.” Computational Geometry: Theory and Applications 22:1–3 (2002), 21–74.

  272. [Shewchuk 06] J. R. Shewchuk. “Triangle Project Home Page.” Available online (http://www.cs.cmu.edu/~quake/triangle.html), 2006.

  273. [Shi and Malik 00] J. Shi and J. Malik. “Normalized Cuts and Image Segmentation.” IEEE TPAMI 22:8 (2000), 888–905.

  274. [Shirley and Marschner 09] P. Shirley and S. Marschner. Fundamentals of Computer Graphics, Third edition. Natick, MA: A K Peters, Ltd., 2009.

  275. [Shirley and Morley 03] P. Shirley and R. K. Morley. Realistic Ray Tracing, Second edition. Natick, MA: A K Peters, Ltd., 2003.

  276. [Shneiderman 92] B. Shneiderman. “Tree Visualization with Treemaps: 2-D Space-Filling Approach.” ACM Transactions on Graphics 11:1 (1992), 92–99.

  277. [Shneiderman 96] B. Shneiderman. “The Eyes Have It: A Task by Data Type Taxonomy for Information Visualizations.” In Proceedings of IEEE Symposium on Visual Languages, pp. 336–343. Los Alamitos, CA: IEEE Press, 1996.

  278. [Shneiderman 06] B. Shneiderman. “Treemaps for Space-Constrained Vsualization of Hierarchies.” Available online (http://www.cs.umd.edu/hcil/treemap-history/index.shtml), 2006.

  279. [Shreiner et al. 03] D. Shreiner, M. Woo, J. Neider, and T. Davis. The OpenGL Programming Guide: The Official Guide to Learning OpenGL. Reading, MA: Addison-Wesley Professional, 2003.

  280. [Shreiner 04] D. Shreiner. OpenGL Reference Manual. Reading, MA: Addison-Wesley Professional, 2004.

  281. [Siddiqi et al. 02] K. Siddiqi, S. Bouix, A. Tannenbaum, and S. Zucker. “Hamilton-Jacobi Skeletons.” IJCV 48:3 (2002), 215–231.

  282. [Sillion 94] F. Sillion. Radiosity and Global Illumination. San Francisco, CA: Morgan Kaufmann Inc., 1994.

  283. [Silva et al. 12] C. Silva, F. Paulovich, and L. G. Nonato. “User-Centered Multidimensional Projection Techniques.” Comput. Sci. Eng. 14:4 (2012), 74–81.

  284. [Slicer 13] Slicer. “3D Slicer.” Available online (http://www.slicer.org/), 2013.

  285. [SmartMoney 13] SmartMoney. “Map of the Market.” Available online (http://www.smartmoney.com/marketmap/), 2013.

  286. [Sobel and Feldman 73] I. Sobel and G. Feldman. “A 3 × 3 Isotropic Gradient Operator for Image Processing.” In Pattern Classification and Scene Analysis, edited by R. Duda and P. Hart, pp. 271–273. New York: John Wiley & Sons, 1973.

  287. [Sobiecki et al. 13] A. Sobiecki, H. Yasan, A. Jalba, and A. Telea. “Qualitative Comparison of Contraction-based Curve Skeletonization Methods.” In Proc. ISMM, pp. 425–439. Berlin: Springer, 2013.

  288. [Spence 07] R. Spence. Information Visualization: Design for Interaction, Second edition. Englewood Cliffs, NJ: Prentice Hall, 2007.

  289. [Spencer et al. 09] B. Spencer, R. S. Laramee, G. Chen, and E. Zhang. “Evenly-Spaced Streamlines for Surfaces: An Image-Based Approach.” Computer Graphics Forum 28:6 (2009), 1618–1631.

  290. [Sprenger et al. 00] T. Sprenger, R. Brunella, and M. Gross. “H-BLOB: A Hierarchical Visual Clustering Method Using Implicit Surfaces.” In Proc. IEEE Visualization, pp. 162–170. Los Alamitos, CA: IEEE Press, 2000.

  291. [SQL 14] SQL. “SQL Database Reference Material.” Available online (http://www.sql.org/), 2014.

  292. [Stam 98] J. Stam. “Exact Evaluation of Catmull-Clark Subdivision Surfaces at Arbitrary Parameter Values.” In Proc. ACM SIGGRAPH, pp. 395–404. New York: ACM Press, 1998.

  293. [Standish 84] T. A. Standish. “An Essay on Software Reuse.” IEEE Transactions on Software Engineering 10:5 (1984), 494–497.

  294. [Stasko et al. 98] J. T. Stasko, J. Domingue, M. H. Brown, and B. A. Price. Software Visualization: Programming as a Multimedia Experience. Cambridge, MA: MIT Press, 1998.

  295. [Stasko et al. 00] J. Stasko, R. Catrambone, M. Guzdial, and K. McDonald. “An Evaluation of Space-Filling Information Visualizations for Depicting Hierarchical Structures.” International Journal of Human-Computer Studies 53:5 (2000), 663–694.

  296. [Stone 03] Maureen Stone. A Field Guide to Digital Color. Natick, MA: A K Peters, Ltd., 2003.

  297. [Stroustrup 04] B. Stroustrup. The C++ Programming Language, Third edition. Reading, MA: Addison-Wesley, 2004.

  298. [Strzodka and Telea 04] R. Strzodka and A. Telea. “Generalized Distance Transforms and Skeletons in Graphics Hardware.” In Proc. EG/IEEE VisSym, pp. 221–230. Los Alamitos, CA: IEEE Press, 2004.

  299. [Sugiyama et al. 81] K. Sugiyama, S. Tagawa, and M. Toda. “Methods for Visual Understanding of Hierarchical Systems.” IEEE Trans. Syst. Man Cybern. 11:2 (1981), 109–125.

  300. [Tagliasacchi et al. 09] A. Tagliasacchi, H. Zhang, and D. Cohen-Or. “Curve Skeleton Extraction from Incomplete Point Cloud.” In ACM SIGGRAPH 2009 Papers, pp. 541–550. New York: ACM Press, 2009.

  301. [Telea and Ersoy 10] A. Telea and O. Ersoy. “Image-Based Edge Bundles: Simplified Visualization of Large Graphs.” Computer Graphics Forum 29:3 (2010), 543–551.

  302. [Telea and Jalba 12] A. Telea and A. Jalba. “Computing Curve Skeletons from Me-dial Surfaces of 3D Shapes.” In Proceedings of Theory and Practice of Computer Graphics (TPCG), pp. 56–74. Aire-la-Ville, Switzerland: Eurographics, 2012.

  303. [Telea and van Wijk 99] A. Telea and J. J. van Wijk. “VISSION: An Object-Oriented Dataflow System for Simulation and Visualization.” In Proc. VisSym, pp. 309–318. New York: Springer, 1999.

  304. [Telea and van Wijk 02] A. Telea and J. J. van Wijk. “An Augmented Fast Marching Method for Computing Skeletons and Centerlines.” In Proc. Data Visualization (VisSym’99), pp. 251–258. New York: Springer, 2002.

  305. [Telea and van Wijk 03] A. Telea and J. J. van Wijk. “3D IBFV: Hardware-Accelerated 3D Flow Visualization.” In Proc. IEEE Visualization, pp. 31–38. Los Alamitos, CA: IEEE Press, 2003.

  306. [Telea and Vilanova 03] A. Telea and A. Vilanova. “A Robust Level-Set Algorithm for Centerline Extraction.” In Proc. Data Visualization (VisSym’03), pp. 185–194. Aire-la-Ville, Switzerland: Eurographics Association, 2003.

  307. [Telea 04] A. Telea. “An Image Inpainting Technique Based on the Fast Marching Method.” Journal of Graphics Tools 9:1 (2004), 23–34.

  308. [Telea 06] A. Telea. “Combining Extended Table Lens and Treemap Techniques for Visualizing Tabular Data.” In Proc. EuroVis, pp. 51–58. Los Alamitos, CA: IEEE Press, 2006.

  309. [Tenenbaum et al. 00] J. B. Tenenbaum, V. de Silva, and J. C. Langford. “A Global Geometric Framework for Nonlinear Dimensionality Reduction.” Science 290:5500 (2000), 2319–2323.

  310. [Thiel and Montanevert 92] E. Thiel and A. Montanevert. “Chamfer Masks: Discrete Distance Functions, Geometrical Properties and Optimization.” In Proc. ICPR, pp. 244–247. Los Alamitos, CA: IEEE Press, 1992.

  311. [Thomas and Cook 05] J. A. Thomas and K. A. Cook, editors. Illuminating the Path: Research and Development Agenda for Visual Analytics. Los Alamitos, CA: IEEE Press, 2005.

  312. [Tobias and Seara 02] O. J. Tobias and R. Seara. “Image Segmentation by Histogram Thresholding Using Fuzzy Sets.” IEEE Transactions on Image Processing 11:12 (2002), 1457–1465.

  313. [Torgeson 65] W. S. Torgeson. “Multidimensional Scaling of Similarity.” Psychometrika 30 (1965), 379–393.

  314. [TortoiseSVN 07] TortoiseSVN. “TortoiseSVN.” Available online (http://tortoisesvn.tigris.org/), 2007.

  315. [Tory and Möller 04] M. Tory and T. Möller. “Rethinking Visualization: A High-Level Taxonomy.” In Proc. IEEE InfoVis, pp. 151–158. Los Alamitos, CA: IEEE Press, 2004.

  316. [Trottenberg et al. 01] U. Trottenberg, C. Oosterlee, and A. Schüller. Multigrid: Basics, Parallelism and Adaptivity. Amsterdam: Elsevier, 2001.

  317. [Trümper et al. 13] J. Trümper, A. Telea, and J. Döllner. “Multiscale Visual Comparison of Execution Traces.” In Proceedings of the International Conference on Program Comprehension (ICPC), pp. 53–62. Los Alamitos, CA: IEEE Press, 2013.

  318. [Tufte 90] E. R. Tufte. Envisioning Information. Cheshire, CT: Graphics Press, 1990.

  319. [Tufte 97] E. R. Tufte. Visual Explanations. Cheshire, CT: Graphics Press, 1997.

  320. [Tufte 01] E. R. Tufte. The Visual Display of Quantitative Information, Second edition. Cheshire, CT: Graphics Press, 2001.

  321. [Turk and Banks 96] G. Turk and D. Banks. “Image-Guided Streamline Placement.” In Proceedings of SIGGRAPH 96, Computer Graphics Proceedings, Annual Conference Series, pp. 453–460. Reading, MA: Addison Wesley, 1996.

  322. [Tutte 01] W. T. Tutte. Graph Theory. Cambridge, UK: Cambridge University Press, 2001.

  323. [van der Zwan et al. 13] M. van der Zwan, Y. Meiburg, and A. Telea. “A Dense Medial Descriptor for Image Analysis.” In Proc. VISAPP, pp. 133–140. Los Alamitos, CA: IEEE Press, 2013.

  324. [van Liere and de Leeuw 03] R. van Liere and W. de Leeuw. “Graphsplatting: Visualizing Graphs as Continuous Fields.” IEEE Transactions on Visualization and Computer Graphics 9:2 (2003), 206–212.

  325. [van Liere and van Wijk 96] R. van Liere and J. J. van Wijk. “CSE: A Modular Architecture for Computational Steering.” In Proc. EG Workshop on Scientific Visualization, pp. 257–266. Berlin: Springer, 1996.

  326. [van Liere et al. 12] R. van Liere, J. Mulder, K. Sharoudi, and J. van Wijk. “Computational Steering Environment.” Available online (http://www.cwi.nl/projects/cse/cse.html), 2012.

  327. [van Walsum et al. 96] T. van Walsum, F. H. Post, D. Silver, and F. J. Post. “Feature Extraction and Iconic Visualization.” IEEE TVCG 2:2 (1996), 111–119.

  328. [van Wijk and Telea 01] J. J. van Wijk and A. Telea. “Enridged Contour Maps.” In Proceedings of the Conference on Visualization ‘01, pp. 69–74. Washington, DC: IEEE Computer Society, 2001.

  329. [van Wijk and van de Wetering 99] J. J. van Wijk and H. van de Wetering. “Cushion Treemaps: Visualization of Hierarchical Information.” In Proc. IEEE InfoVis, pp. 73–78. Los Alamitos, CA: IEEE Press, 1999.

  330. [van Wijk 91] J. J. van Wijk. “Spot Noise Texture Synthesis for Data Visualization.” In Proc. ACM SIGGRAPH, pp. 309–318. New York: ACM Press, 1991.

  331. [van Wijk 93] J. J. van Wijk. “Implicit Stream Surfaces.” In Proc. IEEE Visualization, pp. 245–252. Los Alamitos, CA: IEEE Press, 1993.

  332. [van Wijk 02a] J. J. van Wijk. “Image Based Flow Visualization.” Proc. SIGGRAPH ‘02, Transactions on Graphics 21:3 (2002), 745–754.

  333. [van Wijk 02b] J. J. van Wijk. “Image Based Flow Visualization – Supplemental Material.” Proc. SIGGRAPH 21:3 (2002), http://www.win.tue.nl/~vanwijk/ibfv.

  334. [van Wijk 03] J. J. van Wijk. “Image Based Flow Visualization for Curved Surfaces.” In Proc. IEEE Visualization, pp. 17–24. Los Alamitos, CA: IEEE Press, 2003.

  335. [van Wijk 05] J. J. van Wijk. “The Value of Visualization.” In Proc. IEEE Visualization, pp. 79–86. Los Alamitos, CA: IEEE Press, 2005.

  336. [van Wijk 06] J. J. van Wijk. “The SequoiaView File System Visualization Tool.” Available online (http://www.win.tue.nl/sequoiaview/), 2006.

  337. [Verma et al. 00] V. Verma, D. Kao, and A. Pang. “A Flow-Guided Streamline Seeding Strategy.” In Proc. IEEE Visualization, pp. 163–170. Los Alamitos, CA: IEEE Press, 2000.

  338. [Viegas et al. 07] F. Viegas, M. Wattenberg, F. van Ham, and J. Kriss. “ManyEyes: A Site for Visualization at Internet Scale.” IEEE TVCG 13:6 (2007), 1121–1128.

  339. [ViewVC 07] ViewVC. “The ViewVC CVS Repository Browser.” Available online (http://www.viewvc.org/), 2007.

  340. [Vilanova et al. 99] A. Vilanova, A. König, and E. Gröller. “VirEn: A Virtual Endoscopy System.” Machine Graphics and Vision 8:3 (1999), 469–487.

  341. [Vliegen et al. 06] R. Vliegen, J. J. van Wijk, and E. J. van der Linden. “Visualizing Business Data with Generalized Treemaps.” IEEE TVCG 12:5 (2006), 789–796.

  342. [Voinea 12] L. Voinea. “The CVSgrab Software Evolution Visualization System.” Available online (http://www.cs.rug.nl/svcg/SoftVis/VCN), 2012.

  343. [Walton 04] J. P. Walton. “NAG’s IRIS Explorer.” In Visualization Handbook, edited by C. R. Johnson and C. D. Hansen. New York: Academic Press, 2004.

  344. [Wan et al. 01] M. Wan, F. Dachille, and A. Kaufman. “Distance-Field Based Skeletons for Virtual Navigation.” In Proc. IEEE Visualization, pp. 239–246. Los Alamitos, CA: IEEE Press, 2001.

  345. [Wang et al. 99] J. T.-L. Wang, X. Wang, K.-I. Lin, D. Shasha, B. A. Shapiro, and K. Zhang. “Evaluating a Class of Distance-Mapping Algorithms for Data Mining and Clustering.” In Proc. ACM KDD, pp. 307–311. New York: ACM Press, 1999.

  346. [Wang et al. 13] R. Wang, V. J. Wedeen, and A. A. Martinos. “The Diffusion Toolkit and TrackVis Software Toolset.” Available online (http://trackvis.org), 2013.

  347. [Ward et al. 10] M. O. Ward, G. Grinstein, and D. Keim. Interactive Data Visualization: Foundations, Techniques, and Applications. Natick, MA: A K Peters, 2010.

  348. [Ward 94] M. O. Ward. “XmdvTool: Integrating Multiple Methods for Visualizing Multivariate Data.” In Proc. IEEE Visualization, pp. 17–21. Los Alamitos, CA: IEEE Press, 1994.

  349. [Ware 04] C. Ware. Information Visualization: Perception for Design, Second edition. San Francisco, CA: Morgan Kaufmann, 2004.

  350. [Wattenberg 99] M. Wattenberg. “Visualizing the Stock Market.” In Proc. Conference on Human Factors in Computing Systems (CHI)—Extended abstracts, pp. 188– 189. New York: ACM Press, 1999.

  351. [Wegman 90] E. J. Wegman. “Hyperdimensional Data Analysis using Parallel Coordinates.” Journal of the American Statistical Association 411:85 (1990), 664–675.

  352. [Weickert 98] J. Weickert. Anisotropic Diffusion in Image Processing. Stuttgart: Teubner-Verlag, 1998.

  353. [Wendland 06] H. Wendland. Scattered Data Approximation. Cambridge, UK: Cambridge University Press, 2006.

  354. [Westin et al. 97] C. F. Westin, S. Peled, H. Gubjartsson, R. Kikinis, and F. A. Jolesz. “Geometrical Diffusion Measures for MRI from Tensor Basis Analysis.” In Proc. 5th Annual Meeting of the ISMRM, p. 1742. Berkeley, CA: International Society for Magnetic Resonance in Medicine, 1997.

  355. [Williams and Munzner 04] M. Williams and T. Munzner. “Steerable, Progressive Multidimensional Scaling.” In Proc. IEEE InfoVis, pp. 57–64. Los Alamitos, CA: IEEE Press, 2004.

  356. [Williams et al. 95] J. G. Williams, K. M. Sochats, and E. Morse. “Visualization.” Annual Review of Information Science and Technology (ARIST) 30 (1995), 161– 207.

  357. [Wolfram Research, Inc. 14] Wolfram Research, Inc. “Wolfram Mathematica.” Available online (http://www.wolfram.com/products/mathematica/index.html), 2014.

  358. [Wong and Thomas 04] P. C. Wong and J. Thomas. “Visual Analytics.” IEEE Computer Graphics and Applications 24:5 (2004), 20–21.

  359. [Xu and Prince 97] C. Xu and J. Prince. “Gradient Vector Flow: A New External Force for Snakes.” In Proc. IEEE CVPR, pp. 66–71. Los Alamitos, CA: IEEE Press, 1997.

  360. [Ye et al. 05] X. Ye, D. Kao, and A. Pang. “Strategies for Seeding 3D Streamlines.” In Proc. IEEE Visualization, pp. 471–478. Los Alamitos, CA: IEEE Press, 2005.

  361. [Zhou and Toga 99] Y. Zhou and A. W. Toga. “Efficient Skeletonization of Volumetric Objects.” Transactions of Visualization and Computer Graphics 5:3 (1999), 210– 225.

  362. [Zhou et al. 98] Y. Zhou, A. Kaufman, and A. W. Toga. “Three-Dimensional Skeleton and Centerline Generation Based on an Approximate Minimum Distance Field.” The Visual Computer 14:7 (1998), 303–314.

  363. [Zhukov and Barr 02] L. Zhukov and A. H. Barr. “Oriented Tensor Reconstruction: Tracing Neural Pathways from Diffusion Tensor MRI.” In Proceedins of IEEE Visualization 2002, pp. 387–394. Los Alamitos, CA: IEEE Press, 2002.