{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:14:28Z","timestamp":1740158068856,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"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":["Project-ID 251654672"],"award-info":[{"award-number":["Project-ID 251654672"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010583","name":"Universit\u00e4t Konstanz","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100010583","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Vis"],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:sec>\n                <jats:title>Abstract<\/jats:title>\n                <jats:p>We instrument Group Diagrams (GDs) to reduce clutter in sets of eye-tracking scanpaths. Group Diagrams consist of trajectory subsets that cover, or represent, the whole set of trajectories with respect to some distance measure and an adjustable distance threshold. The original GDs allow for an application of various distance measures. We implement the GD framework and evaluate it on scanpaths that were collected by a former user study on public transit maps. We find that the Fr\u00e9chet distance is the most appropriate measure to get meaningful results, yet it is flexible enough to cover outliers. We discuss several implementation-specific challenges and improve the scalability of the algorithm. To evaluate our results, we conducted a qualitative study with a group of eye-tracking experts. Finally, we note that our enhancements are also beneficial within the original problem setting, suggesting that our approach might be applicable to various types of input data.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Graphical abstract<\/jats:title>\n                <jats:p>Eye tracking on a public transit map of Warsaw. Input scanpaths (left), and simplified Group Diagram (right). <\/jats:p>\n              <\/jats:sec>","DOI":"10.1007\/s12650-023-00924-4","type":"journal-article","created":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T14:52:55Z","timestamp":1683039175000},"page":"1173-1187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Group Diagrams for simplified representation of scanpaths"],"prefix":"10.1007","volume":"26","author":[{"given":"Peter","family":"Sch\u00e4fer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nils","family":"Rodrigues","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Weiskopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Storandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"key":"924_CR1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195995000064","author":"H Alt","year":"1995","unstructured":"Alt H, Godau M (1995) Computing the Fr\u00e9chet distance between two polygonal curves. Int J Comput Geom Appl. https:\/\/doi.org\/10.1142\/S0218195995000064","journal-title":"Int J Comput Geom Appl"},{"issue":"4","key":"924_CR2","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.3758\/s13428-014-0550-3","volume":"47","author":"NC Anderson","year":"2015","unstructured":"Anderson NC, Anderson F, Kingstone A, Bischof WF (2015) A comparison of scanpath comparison methods. Behav Res Methods 47(4):1377\u20131392. https:\/\/doi.org\/10.3758\/s13428-014-0550-3","journal-title":"Behav Res Methods"},{"issue":"12","key":"924_CR3","doi-asserted-by":"publisher","first-page":"2889","DOI":"10.1109\/tvcg.2012.276","volume":"18","author":"G Andrienko","year":"2012","unstructured":"Andrienko G, Andrienko N, Burch M, Weiskopf D (2012) Visual analytics methodology for eye movement studies. IEEE Trans Vis Comput Gr 18(12):2889\u20132898. https:\/\/doi.org\/10.1109\/tvcg.2012.276","journal-title":"IEEE Trans Vis Comput Gr"},{"key":"924_CR4","doi-asserted-by":"publisher","unstructured":"Bringmann K, K\u00fcnnemann M, Nusser A (2019) Walking the dog fast in practice: algorithm engineering of the Fr\u00e9chet distance. In: Barequet G, Wang Y (eds) 35th International symposium on computational geometry (SoCG 2019). Leibniz international proceedings in informatics (LIPIcs), vol 129. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp 17\u201311721. https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.17.. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/10421","DOI":"10.4230\/LIPIcs.SoCG.2019.17."},{"key":"924_CR5","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-540-92182-0_57","volume-title":"Algorithms and computation","author":"K Buchin","year":"2008","unstructured":"Buchin K, Buchin M, Gudmundsson J, L\u00f6ffler M, Luo J (2008) Detecting commuting patterns by clustering subtrajectories. In: Hong S-H, Nagamochi H, Fukunaga T (eds) Algorithms and computation. Springer, Berlin, pp 644\u2013655"},{"issue":"3","key":"924_CR6","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00453-012-9654-2","volume":"66","author":"K Buchin","year":"2013","unstructured":"Buchin K, Buchin M, van Kreveld M, L\u00f6ffler M, Silveira RI, Wenk C, Wiratma L (2013) Median trajectories. Algorithmica 66(3):595\u2013614","journal-title":"Algorithmica"},{"key":"924_CR7","first-page":"101","volume":"9","author":"M Buchin","year":"2014","unstructured":"Buchin M, Dodge S, Speckmann B (2014) Similarity of trajectories taking into account geographic context. J Spatial Inf Sci 9:101\u2013124","journal-title":"J Spatial Inf Sci"},{"issue":"12","key":"924_CR8","doi-asserted-by":"publisher","first-page":"2401","DOI":"10.1080\/13658816.2019.1684498","volume":"34","author":"M Buchin","year":"2020","unstructured":"Buchin M, Kilgus B, K\u00f6lzsch A (2020) Group Diagrams for representing trajectories. Int J Geogr Inf Sci 34(12):2401\u20132433. https:\/\/doi.org\/10.1080\/13658816.2019.1684498","journal-title":"Int J Geogr Inf Sci"},{"key":"924_CR10","doi-asserted-by":"crossref","unstructured":"Gudmundsson J, van Kreveld M (2006) Computing longest duration flocks in trajectory data. In: Proceedings of the 14th annual ACM international symposium on advances in geographic information systems, pp 35\u201342","DOI":"10.1145\/1183471.1183479"},{"key":"924_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-72680-7_22","volume-title":"Springer handbook of geographic information","author":"J Gudmundsson","year":"2011","unstructured":"Gudmundsson J, Laube P, Wolle T (2011) Computational movement analysis. In: Kresse W, Danko DM (eds) Springer handbook of geographic information. Springer, Berlin, pp 423\u2013438"},{"key":"924_CR11","doi-asserted-by":"crossref","unstructured":"He S, Bastani F, Abbar S, Alizadeh M, Balakrishnan H, Chawla S, Madden S (2018) Roadrunner: improving the precision of road network inference from GPS trajectories. In: Proceedings of the 26th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 3\u201312","DOI":"10.1145\/3274895.3274974"},{"key":"924_CR12","doi-asserted-by":"crossref","unstructured":"Huang Y, Chen C, Dong P (2008) Modeling herds and their evolvements from trajectory data. In: International conference on geographic information science, pp 90\u2013105","DOI":"10.1007\/978-3-540-87473-7_6"},{"issue":"12","key":"924_CR13","doi-asserted-by":"publisher","first-page":"2129","DOI":"10.1109\/TVCG.2013.194","volume":"19","author":"K Kurzhals","year":"2013","unstructured":"Kurzhals K, Weiskopf D (2013) Space-time visual analytics of eye-tracking data for dynamic stimuli. IEEE Trans Vis Comput Gr 19(12):2129\u20132138. https:\/\/doi.org\/10.1109\/TVCG.2013.194","journal-title":"IEEE Trans Vis Comput Gr"},{"key":"924_CR14","doi-asserted-by":"crossref","unstructured":"Li Z, Ding B, Han J, Kays R (2010) Swarm: mining relaxed temporal moving object clusters. Illinois University at Urbana-Champaign, Department of Computer Science, Technical report","DOI":"10.14778\/1920841.1920934"},{"key":"924_CR15","unstructured":"Max Planck Institute for Animal Behavior (2022) Movebank for animal tracking data. https:\/\/www.movebank.org"},{"issue":"1\u20132","key":"924_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1080\/13875868.2016.1226839","volume":"17","author":"R Netzel","year":"2016","unstructured":"Netzel R, Ohlhausen B, Kurzhals K, Woods R, Burch M, Weiskopf D (2016) User performance and reading strategies for metro maps: an eye tracking study. Spatial Cognit Comput 17(1\u20132):39\u201364. https:\/\/doi.org\/10.1080\/13875868.2016.1226839","journal-title":"Spatial Cognit Comput"},{"key":"924_CR17","doi-asserted-by":"publisher","DOI":"10.16910\/jemr.10.5.9","author":"V Peysakhovich","year":"2017","unstructured":"Peysakhovich V, Hurter C (2017) Scanpath visualization and comparison using visual aggregation techniques. J Eye Mov Res. https:\/\/doi.org\/10.16910\/jemr.10.5.9","journal-title":"J Eye Mov Res"},{"key":"924_CR18","doi-asserted-by":"crossref","unstructured":"Raschke M, Herr D, Blascheck T, Ertl T, Burch M, Willmann S, Schrauf M (2014) A visual approach for scan path comparison. In: Proceedings of the symposium on eye tracking research and applications, pp 135\u2013142","DOI":"10.1145\/2578153.2628810"},{"key":"924_CR19","doi-asserted-by":"crossref","unstructured":"Rodrigues N, Netzel R, Spalink J, Weiskopf D (2018) Multiscale scanpath visualization and filtering. In: Proceedings of the 3rd workshop on eye tracking and visualization, pp 1\u20135","DOI":"10.1145\/3205929.3205931"},{"key":"924_CR20","unstructured":"Sch\u00e4fer P (2022) Group Diagrams. https:\/\/gitlab.inf.uni-konstanz.de\/ag-storandt\/group-diagrams-public"},{"key":"924_CR21","doi-asserted-by":"publisher","unstructured":"Sch\u00e4fer P, Rodrigues N, Weiskopf D, Storandt S (2022) Group Diagrams for simplified representation of scanpaths. In: VINCI\u201922. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3554944.3554971","DOI":"10.1145\/3554944.3554971"},{"issue":"1","key":"924_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10462-016-9477-7","volume":"47","author":"G Yuan","year":"2017","unstructured":"Yuan G, Sun P, Zhao J, Li D, Wang C (2017) A review of moving object trajectory clustering algorithms. Artif Intell Rev 47(1):123\u2013144","journal-title":"Artif Intell Rev"}],"container-title":["Journal of Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-023-00924-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12650-023-00924-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-023-00924-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T05:20:20Z","timestamp":1692681620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12650-023-00924-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,2]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["924"],"URL":"https:\/\/doi.org\/10.1007\/s12650-023-00924-4","relation":{},"ISSN":["1343-8875","1875-8975"],"issn-type":[{"type":"print","value":"1343-8875"},{"type":"electronic","value":"1875-8975"}],"subject":[],"published":{"date-parts":[[2023,5,2]]},"assertion":[{"value":"6 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}