Information Technology Reference
In-Depth Information
References
1. Agarwal, P.K., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning
trees and bichromatic closest pairs. Discrete & Comput. Geom. 6(1), 407-422 (1991)
2. Alper, B., Riche, N.H., Ramos, G., Czerwinski, M.: Designstudy of LineSets, a novel set
visualization technique. IEEE Trans. Vis. Comput. Graphics 17(12), 2259-2267 (2011)
3. Arora, S., Chang, K.: Approximation schemes for degree-restricted MST and red-blue sepa-
ration problems. Algorithmica 40(3), 189-210 (2004)
4. Boyack, K.W., Klavans, R., B orner, K.: Mapping the backbone of science. Scientometrics 64,
351-374 (2005)
5. Chung, F., Graham, R.: A new bound for Euclidean Steiner minimal trees. Annals of the New
York Academy of Sciences 440(1), 328-346 (1985)
6. Collins, C., Penn, G., Carpendale, S.: Bubble sets: Revealing set relations with isocontours
over existing visualizations. IEEE Trans. Vis. Comput. Graphics 15(6), 1009-1016 (2009)
7. Dinkla, K., van Kreveld, M.J., Speckmann, B., Westenberg, M.A.: Kelp diagrams: Point set
membership visualization. Comput. Graph. Forum 31(3, pt1), 875-884 (2012)
8. Dwyer, T., Nachmanson, L.: Fast edge-routing for large graphs. In: Eppstein, D., Gansner,
E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 147-158. Springer, Heidelberg (2010)
9. Hu, Y., Gansner, E.R., Kobourov, S.G.: Visualizinggraphs and clustersasmaps.IEEECom-
put. Graphics and Appl. 30(6), 54-66 (2010)
10. Hurtado, F., Korman, M., van Kreveld, M., L offler, M., Sacristan, V., Silveira, R.I., Speck-
mann, B.: Colored spanninggraphs for set visualization. In: Wismath, S., Wolff, A. (eds.)
GD 2013. LNCS, vol. 8242, pp. 280-291. Springer, Heidelberg (2013)
11. Jianu,R.,Rusu,A.,Hu,Y.,Taggart, D.: How to display group information on node-link
diagrams: An evaluation. IEEE Trans. Vis. Comput. Graphics 20(11), 1530-1541 (2014)
12. Kanizsa, G., Gerbino, W.: Convexity and symmetry in figure-ground organization. Vision
and Artifact, 25-32 (1976)
13. Kobourov, S.G., Pupyrev, S., Simonetto, P.: Visualizinggraphs as maps with contiguous
regions. Comput. Graph. Forum (2014)
14. Kratochvıl, J., Nesetril, J.: Independent set and clique problems in intersection-defined
classes of graphs. Commentationes Math. Univ. Carolinae 31(1), 85-93 (1990)
15. Meulemans, W., Riche, N., Speckmann, B., Alper, B., Dwyer, T.: KelpFusion: A hybrid set
visualization technique. IEEE Trans. Vis. Comput. Graphics 19(11), 1846-1858 (2013)
16. Mitchell, J.S.: Geometric shortest paths and network optimization. Handbook of Computa-
tional Geometry 334, 633-702 (2000)
17. Novembre, et al.: Genes mirror geography within Europe. Nature 456(7218), 98-101 (2008)
18. Pupyrev, S., Nachmanson, L., Bereg, S., Holroyd, A.E.: Edgerouting with ordered bun-
dles. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 136-147.
Springer, Heidelberg (2011)
19. Purves, D., Lotto, R.B.: Why we see what we do: An empirical theory of vision. Sinauer
Associates (2003)
20. Riche, N.H., Dwyer, T.: Untangling Euler diagrams. IEEE Trans. Vis. Comput. Graph-
ics 16(6), 1090-1099 (2010)
21. Simonetto, P., Auber, D., Archambault, D.: Fully automatic visualisation of overlapping sets.
Comput. Graph. Forum 28(3), 967-974 (2009)
22. Skupin, A., Fabrikant, S.I.: Spatialization methods: a cartographic research agenda for non-
geographic information visualization. Cartogr. Geogr. Inform. 30, 95-119 (2003)
23. Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis, and Machine Vision.
Thomson-Engineering (2007)
24. Zunic, J., Rosin, P.L.: A convexity measurement for polygons. IEEE Trans. Pattern Anal.
Mach. Intell. 26, 173-182 (2002)
