{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T20:36:21Z","timestamp":1790714181750,"version":"4.1.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["251654672 - TRR 161"],"award-info":[{"award-number":["251654672 - TRR 161"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009534","name":"Universit\u00e4t Stuttgart","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009534","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Vis"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:sec>\n                <jats:title>Abstract<\/jats:title>\n                <jats:p>A common enhancement of scatterplots represents points as small multiples, glyphs, or thumbnail images. As this encoding often results in overlaps, a general strategy is to alter the position of the data points, for instance, to a grid-like structure. Previous approaches rely on solving expensive optimization problems or on dividing the space that alter the global structure of the scatterplot. To find a good balance between efficiency and neighborhood and layout preservation, we propose <jats:sc>Hagrid<\/jats:sc>, a technique that uses space-filling curves (SFCs) to \u201cgridify\u201d a scatterplot without employing expensive collision detection and handling mechanisms. Using SFCs ensures that the points are plotted close to their original position, retaining approximately the same global structure. The resulting scatterplot is mapped onto a rectangular or hexagonal grid, using Hilbert and Gosper curves. We discuss and evaluate the theoretic runtime of our approach and quantitatively compare our approach to three state-of-the-art gridifying approaches, <jats:sc>DGrid<\/jats:sc>, Small multiples with gaps <jats:sc>SMWG<\/jats:sc>, and CorrelatedMultiples <jats:sc>CMDS<\/jats:sc>, in an evaluation comprising 339 scatterplots. Here, we compute several quality measures for neighborhood preservation together with an analysis of the actual runtimes. The main results show that, compared to the best other technique, <jats:sc>Hagrid<\/jats:sc> is faster by a factor of four, while achieving similar or even better quality of the gridified layout. Due to its computational efficiency, our approach also allows novel applications of gridifying approaches in interactive settings, such as removing local overlap upon hovering over a scatterplot.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Graphical abstract<\/jats:title>\n                \n              <\/jats:sec>","DOI":"10.1007\/s12650-022-00854-7","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T07:05:04Z","timestamp":1657609504000},"page":"1291-1307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Hagrid: using Hilbert and Gosper curves to gridify scatterplots"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0395-2448","authenticated-orcid":false,"given":"Rene","family":"Cutura","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cristina","family":"Morariu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhanglin","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunhai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Weiskopf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Sedlmair","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"issue":"11","key":"854_CR1","doi-asserted-by":"publisher","first-page":"1820","DOI":"10.1109\/TVCG.2013.91","volume":"19","author":"D Auber","year":"2013","unstructured":"Auber D, Huet C, Lambert A, Renoust B, Sallaberry A, Saulnier A (2013) GosperMap: using a gosper curve for laying out hierarchical data. IEEE Trans Vis Comput Graph (TVCG) 19(11):1820\u20131832. https:\/\/doi.org\/10.1109\/TVCG.2013.91","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"key":"854_CR2","doi-asserted-by":"publisher","unstructured":"Aupetit M, Sedlmair M (2016) SepMe: 2002 New visual separation measures. In: IEEE Pacific Vis Symp (PacificVis). https:\/\/doi.org\/10.1109\/PACIFICVIS.2016.7465244","DOI":"10.1109\/PACIFICVIS.2016.7465244"},{"key":"854_CR3","doi-asserted-by":"publisher","unstructured":"Bader M (2012) Space-filling curves: an introduction with applications in scientific computing. Vol. 9. Springer Science & Business Media. https:\/\/doi.org\/10.1007\/978-3-642-31046-1","DOI":"10.1007\/978-3-642-31046-1"},{"issue":"6","key":"854_CR4","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15(6):1373\u20131396. https:\/\/doi.org\/10.1162\/089976603321780317","journal-title":"Neural Comput"},{"key":"854_CR5","doi-asserted-by":"publisher","unstructured":"Bingham E, Mannila H (2001) Random projection in dimensionality reduction: applications to image and text data. In: Proceedings of ACM international conference on knowledge discovery and data mining (SIGKDD). pp 245\u2013250. https:\/\/doi.org\/10.1145\/502512.502546","DOI":"10.1145\/502512.502546"},{"issue":"3","key":"854_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1111\/j.1745-3984.2003.tb01108.x","volume":"4","author":"I Borg","year":"2003","unstructured":"Borg I, Groenen P (2003) Modern multidimensional scaling: theory and applications. J Educ Meas (JEM) 4(3):277\u2013280. https:\/\/doi.org\/10.1111\/j.1745-3984.2003.tb01108.x","journal-title":"J Educ Meas (JEM)"},{"key":"854_CR7","doi-asserted-by":"publisher","unstructured":"Brehmer M, Sedlmair M, Ingram S, Munzner T (2014) Visualizing dimensionally-reduced data: Interviews with analysts and a characterization of task sequences. In: Proceedings of beyond time and errors: novel evaluation methods for visualization (BELIV). pp 1\u20138. https:\/\/doi.org\/10.1145\/2669557.2669559","DOI":"10.1145\/2669557.2669559"},{"issue":"1","key":"854_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/TVCG.2018.2865049","volume":"25","author":"J Buchm\u00fcller","year":"2018","unstructured":"Buchm\u00fcller J, J\u00e4ckle D, Cakmak E, Brandes U, Keim DA (2018) MotionRugs: visualizing collective trends in space and time. IEEE Trans Vis Comput Graph (TVCG) 25(1):76\u201386. https:\/\/doi.org\/10.1109\/TVCG.2018.2865049","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"issue":"3","key":"854_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s EJ, Li X, Ma Y, Wright J (2011) Robust principal component analysis? J ACM 58(3):37. https:\/\/doi.org\/10.1145\/1970392.1970395","journal-title":"J ACM"},{"key":"854_CR10","unstructured":"Cormen TH, Leiserson CE, Rivest RL (2009) Introduction to algorithms. MIT Press"},{"key":"854_CR11","doi-asserted-by":"crossref","unstructured":"Crowley E, Zisserman A (2014) The state of the art: object retrieval in paintings using discriminative regions, In: Proc. British Machine Vision Conf, BMVA Press","DOI":"10.5244\/C.28.38"},{"key":"854_CR12","doi-asserted-by":"publisher","unstructured":"Cutura R, Morariu C, Cheng Z, Wang Y, Weiskopf D, Sedlmair M (2021) Hagrid: gridify scatterplots with hilbert and gosper curves. In: International symposium on visual information communication and interaction. pp 1\u20138. https:\/\/doi.org\/10.1145\/3481549.3481569","DOI":"10.1145\/3481549.3481569"},{"issue":"6","key":"854_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng L (2012) The MNIST database of handwritten digit images for machine learning research. IEEE Sign Process Mag 29(6):141\u2013142. https:\/\/doi.org\/10.1109\/MSP.2012.2211477","journal-title":"IEEE Sign Process Mag"},{"issue":"4","key":"854_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1137\/S0036144599352836","volume":"41","author":"Q Du","year":"1999","unstructured":"Du Q, Faber V, Gunzburger M (1999) Centroidal voronoi tessellations: applications and algorithms. SIAM Rev 41(4):637\u2013676. https:\/\/doi.org\/10.1137\/S0036144599352836","journal-title":"SIAM Rev"},{"issue":"12","key":"854_CR15","doi-asserted-by":"publisher","first-page":"2063","DOI":"10.1109\/TVCG.2014.2346276","volume":"20","author":"FSLG Duarte","year":"2014","unstructured":"Duarte FSLG, Sikansi F, Fatore FM, Fadel SG, Paulovich FV (2014) Nmap: a novel neighborhood preservation space-filling algorithm. IEEE Trans Vis Comput Graph (TVCG) 20(12):2063\u20132071. https:\/\/doi.org\/10.1109\/TVCG.2014.2346276","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"key":"854_CR16","doi-asserted-by":"publisher","unstructured":"Dwyer T, Marriott K, Stuckey PJ (2006) Fast node overlap removal-correction. In: International symposium on graph drawing, Springer, pp 446\u2013447. https:\/\/doi.org\/10.1007\/978-3-540-70904-6_44","DOI":"10.1007\/978-3-540-70904-6_44"},{"issue":"2","key":"854_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/S0218195915500077","volume":"25","author":"D Eppstein","year":"2015","unstructured":"Eppstein D, van Kreveld M, Speckmann B, Staals F (2015) Improved grid map layout by point set matching. Int J Comp Geom Appl 25(2):101\u2013122. https:\/\/doi.org\/10.1142\/S0218195915500077","journal-title":"Int J Comp Geom Appl"},{"key":"854_CR18","doi-asserted-by":"publisher","unstructured":"Fried O, DiVerdi S, Halber M, Sizikova E, Finkelstein A (2015) IsoMatch: creating informative grid layouts. In: Computer graphics forum, Vol. 34. Wiley Online Library, pp 155\u2013166. https:\/\/doi.org\/10.1111\/cgf.12549","DOI":"10.1111\/cgf.12549"},{"key":"854_CR19","doi-asserted-by":"publisher","unstructured":"Gansner ER, Hu Y (2008) Efficient node overlap removal using a proximity stress model. In: International Symposium on Graph Drawing, Springer, pp 206\u2013217. https:\/\/doi.org\/10.1007\/978-3-642-00219-9_20","DOI":"10.1007\/978-3-642-00219-9_20"},{"issue":"6","key":"854_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1038\/scientificamerican1276-124","volume":"235","author":"M Gardner","year":"1976","unstructured":"Gardner M (1976) Mathematical games-in which \u201cmonster\u201d curves force redefinition of the word \u201ccurve\u201d. Sci Am 235(6):124\u2013133","journal-title":"Sci Am"},{"issue":"8","key":"854_CR21","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.1002\/mop.27682","volume":"55","author":"R Ghatak","year":"2013","unstructured":"Ghatak R, Pal M, Goswami C, Poddar DR (2013) Moore curve fractal-shaped miniaturized complementary spiral resonator. Microw Opt Technol Lett 55(8):1950\u20131954. https:\/\/doi.org\/10.1002\/mop.27682","journal-title":"Microw Opt Technol Lett"},{"key":"854_CR22","doi-asserted-by":"publisher","unstructured":"Gomez-Nieto E, Casaca W, Nonato LG, Taubin G (2013) Mixed integer optimization for layout arrangement. In: Symposium on graphics, patterns and images (SIBGRAPI). IEEE, pp 115\u2013122. https:\/\/doi.org\/10.1109\/SIBGRAPI.2013.25","DOI":"10.1109\/SIBGRAPI.2013.25"},{"issue":"3","key":"854_CR23","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1109\/TVCG.2013.242","volume":"20","author":"E Gomez-Nieto","year":"2013","unstructured":"Gomez-Nieto E, Roman FS, Pagliosa P, Casaca W, Helou ES, de Oliveira MCF, Nonato LG (2013) Similarity preserving snippet-based visualization of web search results. IEEE Trans Vis Comput Graph (TVCG) 20(3):457\u2013470. https:\/\/doi.org\/10.1109\/TVCG.2013.242","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"key":"854_CR24","unstructured":"Hilasaca G, Paulovich FV (2019) Distance preserving grid layouts. arXiv preprint arXiv:1903.06262"},{"key":"854_CR25","doi-asserted-by":"publisher","unstructured":"Hilbert D (1935) \u00dcber die stetige Abbildung einer Linie auf ein Fl\u00e4chenst\u00fcck. In: Dritter band: analysis grundlagen der mathematik physik verschiedenes, Springer, pp 1\u20132. https:\/\/doi.org\/10.1007\/978-3-662-38452-7_1","DOI":"10.1007\/978-3-662-38452-7_1"},{"key":"854_CR26","doi-asserted-by":"publisher","unstructured":"Je\u017eowicz T, Gajdo\u0161 P, Ochodkov\u00e1 E, Sn\u00e1\u0161el V (20140 A New iterative approach for finding nearest neighbors using space-filling curves for fast graphs visualization. In: International Joint Conference SOCO\u201914-CISIS\u201914-ICEUTE\u201914. Springer, pp 11\u201320. https:\/\/doi.org\/10.1007\/978-3-319-07995-0_2","DOI":"10.1007\/978-3-319-07995-0_2"},{"issue":"4","key":"854_CR27","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1109\/TVCG.2020.2969060","volume":"26","author":"D Kammer","year":"2020","unstructured":"Kammer D, Keck M, Gr\u00fcnder T, Maasch A, Thom T, Kleinsteuber M, Groh R (2020) Glyphboard: visual exploration of high-dimensional data combining glyphs with dimensionality reduction. IEEE Trans Vis Comput Graph (TVCG) 26(4):1661\u20131671. https:\/\/doi.org\/10.1109\/TVCG.2020.2969060","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"key":"854_CR28","doi-asserted-by":"publisher","unstructured":"Keim DA, Herrmann A (1998) The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data. In: Proc. Visualization. pp 181\u2013188. https:\/\/doi.org\/10.1109\/VISUAL.1998.745301","DOI":"10.1109\/VISUAL.1998.745301"},{"issue":"1","key":"854_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"JB Kruskal","year":"1964","unstructured":"Kruskal JB (1964) Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 29(1):1\u201327. https:\/\/doi.org\/10.1007\/BF02289565","journal-title":"Psychometrika"},{"issue":"2015","key":"854_CR30","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.neucom.2014.12.095","volume":"169","author":"JA Lee","year":"2015","unstructured":"Lee JA, Peluffo-Ord\u00f3\u00f1ez DH, Verleysen Michel (2015) Multi-scale similarities in stochastic neighbour embedding: reducing dimensionality while preserving both local and global structure. Neurocomputing 169(2015):246\u2013261. https:\/\/doi.org\/10.1016\/j.neucom.2014.12.095","journal-title":"Neurocomputing"},{"key":"854_CR31","doi-asserted-by":"publisher","unstructured":"Liu X, Hu Y, North S, Shen H-W (2018) CorrelatedMultiples: spatially coherent small multiples with constrained multi-dimensional scaling. In: Computer graphics forum, Vol. 37. Wiley Online Library, pp 7\u201318. https:\/\/doi.org\/10.1111\/cgf.12526","DOI":"10.1111\/cgf.12526"},{"issue":"4","key":"854_CR32","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1177\/1473871619845093","volume":"18","author":"WE Marc\u00edlio-Jr","year":"2019","unstructured":"Marc\u00edlio-Jr WE, Eler DM, Garcia RE, Pola IRV (2019) Evaluation of approaches proposed to avoid overlap of markers in visualizations based on multidimensional projection techniques. Inf Vis 18(4):426\u2013438. https:\/\/doi.org\/10.1177\/1473871619845093","journal-title":"Inf Vis"},{"key":"854_CR33","doi-asserted-by":"crossref","unstructured":"McInnes L, Healy J, Melville J (2018) UMAP: uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426","DOI":"10.21105\/joss.00861"},{"key":"854_CR34","doi-asserted-by":"publisher","unstructured":"McNeill G, Hale SA (2017) Generating tile maps. In: Computer graphics forum, Vol. 36. Wiley Online Library, pp 435\u2013445. https:\/\/doi.org\/10.1111\/cgf.13200","DOI":"10.1111\/cgf.13200"},{"key":"854_CR35","unstructured":"Meulemans W, Dykes J, Slingsby A, Turkay C, Wood J. Small multiples with gaps. http:\/\/www.gicentre.org\/smwg\/. Accessed 1 Dec 2020"},{"issue":"1","key":"854_CR36","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TVCG.2016.2598542","volume":"23","author":"W Meulemans","year":"2016","unstructured":"Meulemans W, Dykes J, Slingsby A, Turkay C, Wood J (2016) Small multiples with gaps. IEEE Trans Vis Comput Graph (TVCG) 23(1):381\u2013390. https:\/\/doi.org\/10.1109\/TVCG.2016.2598542","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"key":"854_CR37","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3028953","author":"W Meulemans","year":"2020","unstructured":"Meulemans W, Sondag M, Speckmann B (2020) A simple pipeline for coherent grid maps. IEEE Trans Vis Comput Graph (TVCG). https:\/\/doi.org\/10.1109\/TVCG.2020.3028953","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"issue":"6","key":"854_CR38","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1109\/TVCG.2008.158","volume":"14","author":"C Muelder","year":"2008","unstructured":"Muelder C, Ma K-L (2008) Rapid graph layout using space filling curves. IEEE Trans Vis Comput Graph (TVCG) 14(6):1301\u20131308. https:\/\/doi.org\/10.1109\/TVCG.2008.158","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"key":"854_CR39","doi-asserted-by":"publisher","unstructured":"Nachmanson L, Nocaj A, Bereg S, Zhang L, Holroyd A (2016) Node overlap removal by growing a tree. In: International symposium on graph drawing and network visualization, Springer, pp 33\u201343. https:\/\/doi.org\/10.1007\/978-3-319-50106-2_3","DOI":"10.1007\/978-3-319-50106-2_3"},{"key":"854_CR40","unstructured":"Nene SA, Nayar SK, Murase H et\u00a0al. (1996) Columbia object image library (coil-20)"},{"key":"854_CR41","doi-asserted-by":"publisher","unstructured":"Nilsback M-E, Zisserman A (2008) Automated flower classification over a large number of classes. In: Conference on Computer Vision, Graphics and Image Processing. IEEE, pp 722\u2013729. https:\/\/doi.org\/10.1109\/ICVGIP.2008.47","DOI":"10.1109\/ICVGIP.2008.47"},{"issue":"6","key":"854_CR42","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1109\/TVCG.2008.138","volume":"14","author":"FV Paulovich","year":"2008","unstructured":"Paulovich FV, Minghim R (2008) HiPP: a novel hierarchical point placement strategy and its application to the exploration of document collections. IEEE Trans Vis Comput Graph (TVCG) 14(6):1229\u20131236. https:\/\/doi.org\/10.1109\/TVCG.2008.138","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"issue":"11","key":"854_CR43","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"2","author":"K Pearson","year":"1901","unstructured":"Pearson K (1901) LIII. On lines and planes of closest fit to systems of points in space. London Edinb Dublin Philos Mag J Sci 2(11):559\u2013572. https:\/\/doi.org\/10.1080\/14786440109462720","journal-title":"London Edinb Dublin Philos Mag J Sci"},{"key":"854_CR44","doi-asserted-by":"publisher","unstructured":"Pinho R, de Oliveira MCF, de Lopes AA (2009) Incremental board: a grid-based space for visualizing dynamic data sets. In: ACM Symposium on Applied Computing (SAC). pp 1757\u20131764. https:\/\/doi.org\/10.1145\/1529282.1529679","DOI":"10.1145\/1529282.1529679"},{"issue":"10","key":"854_CR45","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1109\/TPAMI.2009.184","volume":"32","author":"N Quadrianto","year":"2010","unstructured":"Quadrianto N, Smola AJ, Song L, Tuytelaars T (2010) Kernelized sorting. IEEE Trans Patt Anal Mach Intell 32(10):1809\u20131821. https:\/\/doi.org\/10.1109\/TPAMI.2009.184","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"issue":"5500","key":"854_CR46","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323\u20132326. https:\/\/doi.org\/10.1126\/science.290.5500.2323","journal-title":"Science"},{"key":"854_CR47","doi-asserted-by":"publisher","unstructured":"Schulz C, Nocaj A, El-Assady M, Frey S, Hlawatsch M, Hund M, Karch G, Netzel R, Sch\u00e4tzle C, Butt M, Keim DA, Ertl T, Brandes U, Weiskopf D (2016) Generative data models for validation and evaluation of visualization techniques. In: Proceedings of beyond time and errors: novel evaluation methods for visualization (BELIV). pp 112\u2013124. https:\/\/doi.org\/10.1145\/2993901.2993907","DOI":"10.1145\/2993901.2993907"},{"key":"854_CR48","doi-asserted-by":"publisher","unstructured":"Sedlmair M, Tatu A, Munzner T, Tory M (2012) A taxonomy of visual cluster separation factors. In: Computer graphics forum, Vol. 31. Wiley Online Library, pp 1335\u20131344. https:\/\/doi.org\/10.1111\/j.1467-8659.2012.03125.x","DOI":"10.1111\/j.1467-8659.2012.03125.x"},{"key":"854_CR49","doi-asserted-by":"publisher","unstructured":"Strobelt H, Spicker M, Stoffel A, Keim D, Deussen O (2012) Rolled: out Wordles\u2014a heuristic method for overlap removal of 2D data representatives. In: Computer graphics forum, Vol. 31. Wiley Online Library, pp 1135\u20131144. https:\/\/doi.org\/10.1111\/j.1467-8659.2012.03106.x","DOI":"10.1111\/j.1467-8659.2012.03106.x"},{"issue":"4","key":"854_CR50","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/TMM.2014.2306183","volume":"16","author":"G Strong","year":"2014","unstructured":"Strong G, Gong M (2014) Self-sorting map: an efficient algorithm for presenting multimedia data in structured layouts. IEEE Trans Multimed 16(4):1045\u20131058. https:\/\/doi.org\/10.1109\/TMM.2014.2306183","journal-title":"IEEE Trans Multimed"},{"issue":"5500","key":"854_CR51","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum JB, De Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319\u20132323. https:\/\/doi.org\/10.1126\/science.290.5500.2319","journal-title":"Science"},{"issue":"6","key":"854_CR52","doi-asserted-by":"publisher","first-page":"731","DOI":"10.3390\/sym11060731","volume":"11","author":"U Vojt\u011bch","year":"2019","unstructured":"Vojt\u011bch U, Petr G, V\u00e1clav S, Yu-Chi L, Michal Radeck\u1ef3 (2019) Hierarchical hexagonal clustering and indexing. Symmetry 11(6):731. https:\/\/doi.org\/10.3390\/sym11060731","journal-title":"Symmetry"},{"key":"854_CR53","unstructured":"van\u00a0der Maaten L, Hinton G (2008) Visualizing data using t-SNE. 9, pp 2579\u20132605. http:\/\/jmlr.org\/papers\/v9\/vandermaaten08a.html"},{"key":"854_CR54","doi-asserted-by":"publisher","unstructured":"Vollmer JO, D\u00f6llner J (2020) 2.5D Dust and magnet visualization for large multivariate data. In: International symposium on visual information communication and interaction. pp 21\u20131. https:\/\/doi.org\/10.1145\/3430036.3430045","DOI":"10.1145\/3430036.3430045"},{"issue":"3\u20134","key":"854_CR55","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1057\/PALGRAVE.IVS.9500025","volume":"1","author":"MO Ward","year":"2002","unstructured":"Ward MO (2002) A taxonomy of glyph placement strategies for multidimensional data visualization. Inf Vis 1(3\u20134):194\u2013210. https:\/\/doi.org\/10.1057\/PALGRAVE.IVS.9500025","journal-title":"Inf Vis"},{"key":"854_CR56","doi-asserted-by":"publisher","unstructured":"M Wattenberg (2005) A note on space-filling visualizations and space-filling curves. In: Proceedings of the IEEE information visualization symposium. IEEE, pp 181\u2013186. https:\/\/doi.org\/10.1109\/INFVIS.2005.1532145","DOI":"10.1109\/INFVIS.2005.1532145"},{"key":"854_CR57","doi-asserted-by":"publisher","unstructured":"Wilkinson L, Anand A, Grossman R (2005) Graph-theoretic scagnostics. In: Proceedings of the IEEE information visualization symposium. IEEE, pp 157\u2013164. https:\/\/doi.org\/10.1109\/INFVIS.2005.1532142","DOI":"10.1109\/INFVIS.2005.1532142"},{"issue":"6","key":"854_CR58","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TVCG.2008.165","volume":"14","author":"J Wood","year":"2008","unstructured":"Wood J, Dykes J (2008) Spatially ordered treemaps. IEEE Trans Vis Comput Graph (TVCG) 14(6):1348\u20131355. https:\/\/doi.org\/10.1109\/TVCG.2008.165","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"},{"key":"854_CR59","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3030473","author":"L Zhou","year":"2020","unstructured":"Zhou L, Johnson CR, Weiskopf D (2020) Data-driven space-filling curves. IEEE Trans Vis Comput Graph (TVCG). https:\/\/doi.org\/10.1109\/TVCG.2020.3030473","journal-title":"IEEE Trans Vis Comput Graph (TVCG)"}],"container-title":["Journal of Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-022-00854-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12650-022-00854-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-022-00854-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T07:59:09Z","timestamp":1666339149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12650-022-00854-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":59,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["854"],"URL":"https:\/\/doi.org\/10.1007\/s12650-022-00854-7","relation":{},"ISSN":["1343-8875","1875-8975"],"issn-type":[{"value":"1343-8875","type":"print"},{"value":"1875-8975","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"1 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}