Adjacency-preserving spatial treemaps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6844 LNCS, Issue , 2011, Pages 159-170

  Buchin, Kevin ^a   Eppstein, David ^b   Löffler, Maarten ^b   Nöllenburg, Martin ^c   Silveira, Rodrigo I ^d  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b Irvine   (United States)

^c KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^d UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL STRUCTURES; SPATIAL INFORMATIONS; TREE-MAPS; TREEMAP;

DATA STRUCTURES; GEOMETRY;

CLUSTERING ALGORITHMS;

EID: 80052107066     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22300-6_14     Document Type: Conference Paper

References (18)

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs (1993)
2. Birkhoff, G.: Rings of sets. Duke Mathematical Journal 3(3), 443-454 (1937)
3. Buchin, K., Eppstein, D., Löffler, M., Nöllenburg, M., Silveira, R.I.: Adjacency-preserving spatial treemaps. Arxiv report, arXiv:1105.0398 (cs.CG) (May 2011)
4. Buchin, K., Speckmann, B., Verdonschot, S.: Optimizing regular edge labelings. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 117-128. Springer, Heidelberg (2011)
5. Eppstein, D., Mumford, E.: Orientation-constrained rectangular layouts. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 266-277. Springer, Heidelberg (2009)
6. Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal rectangular layouts. In: Proc. SoCG, pp. 267-276 (2009)
7. Fusy, É.: Transversal structures on triangulations: A combinatorial study and straight-line drawings. Discrete Mathematics 309(8), 1870-1894 (2009)
8. Heilmann, R., Keim, D.A., Panse, C., Sips, M.: Recmap: Rectangular map approximations. In: Proceedings of the IEEE Symposium on Information Visualization, pp. 33-40. IEEE Computer Society, Washington, DC, USA (2004)
9. Kant, G., He, X.: Two algorithms for finding rectangular duals of planar graphs. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 396-410. Springer, Heidelberg (1994) (Pubitemid 126060138)
10. Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science 172(1-2), 175-193 (1997)
11. Kozminski, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 5(2) (1985)
12. Mansmann, F., Keim, D.A., North, S.C., Rexroad, B., Sheleheda, D.: Visual analysis of network traffic for resource planning, interactive monitoring, and interpretation of security threats. IEEE Transactions on Visualization and Computer Graphics 13, 1105-1112 (2007)
13. Raisz, E.: The rectangular statistical cartogram. Geographical Review 24(2), 292-296 (1934)
14. Shneiderman, B.: Tree visualization with tree-maps: 2-d space-filling approach. ACM Trans. Graph. 11(1), 92-99 (1992)
15. Slingsby, A., Dykes, J., Wood, J.: Configuring hierarchical layouts to address research questions. IEEE Trans. Vis. Comput. Graph. 15(6), 977-984 (2009)
16. Slingsby, A., Dykes, J., Wood, J.: Rectangular hierarchical cartograms for socio-economic data. Journal of Maps v2010, 330-345 (2010), doi:10.4113/jom.2010.1090
17. van Kreveld, M., Speckmann, B.: On rectangular cartograms. CGTA 37(3) (2007)
18. Wood, J., Dykes, J.: Spatially ordered treemaps. IEEE Trans. Vis. Comput. Graph. 14(6), 1348-1355 (2008)