{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:21:07Z","timestamp":1740108067577,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["31701517"],"award-info":[{"award-number":["31701517"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Philosophy and Social Science Foundation of Beijing Province","award":["17GLC060"],"award-info":[{"award-number":["17GLC060"]}]},{"DOI":"10.13039\/501100012435","name":"Project of High-level Teachers in Beijing Municipal Universities in the Period of 13th Five-year Plan","doi-asserted-by":"publisher","award":["CIT&TCD201704039"],"award-info":[{"award-number":["CIT&TCD201704039"]}],"id":[{"id":"10.13039\/501100012435","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s00521-021-05825-x","type":"journal-article","created":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T04:35:01Z","timestamp":1615610101000},"page":"3483-3494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast overlap removal for location-related representation elements"],"prefix":"10.1007","volume":"34","author":[{"given":"Hongqian","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6046-1421","authenticated-orcid":false,"given":"Hui","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,13]]},"reference":[{"issue":"2004","key":"5825_CR1","doi-asserted-by":"publisher","first-page":"2941","DOI":"10.1109\/IGARSS.2004.1370311","volume":"20\u201324","author":"Huide Liu","year":"2004","unstructured":"Liu Huide, Yang Dabing (2004) Research on the geographic spatio-temporal information visualization on web [C]. IEEE Int Geosci Remote Sens Symp, Anchorage, AK, SEP 20\u201324(2004):2941\u20132944. https:\/\/doi.org\/10.1109\/IGARSS.2004.1370311","journal-title":"IEEE Int Geosci Remote Sens Symp, Anchorage, AK, SEP"},{"key":"5825_CR2","unstructured":"Riccardo Albertoni, Alessio Bertone, Monica De Martino, M. De Martino. (2003) A visualization-based approach to explore geographic metadata [C]. 11th International Conference on Computer Graphics, Visualization and Computer Vision 2003, Plzen, Czech Republic, February 3-7 pp 9-12."},{"key":"5825_CR3","unstructured":"Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry. (2019) Node overlap removal algorithms: A Comparative Study, arXiv: 1908.07363v2 [cs.CG]. 5 Sep 2019"},{"key":"5825_CR4","doi-asserted-by":"publisher","unstructured":"Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander Holroyd. Node overlap removal by growing a tree [J]. Lecture Notes in Computer Science v(9801)International Symposium on Graph Drawing and Network Visualization (GD 2016): pp 33-43, DOI: https:\/\/doi.org\/10.1007\/978-3-319-50106-2_3","DOI":"10.1007\/978-3-319-50106-2_3"},{"key":"5825_CR5","doi-asserted-by":"publisher","unstructured":"Thony, Matthias, Schnurer, Raimund, Sieber, Rene, and etc. (2018) Storytelling in interactive 3D geographic visualization systems\u201d [J]. ISPRS International Journal of Geo-Information, v7(n3): No 123 DOI: https:\/\/doi.org\/10.3390\/ijgi7030123","DOI":"10.3390\/ijgi7030123"},{"key":"5825_CR6","doi-asserted-by":"publisher","unstructured":"Rie Ishida, Shigeo Takahashi, Hsiang-Yun Wu. (2016) Adaptive blending of multiple network layouts for overlap-free labeling [C]. 20th International Conference Information Visualization, Lisbon, Portugal, 19-22 July 2016: v1: pp 15-20, DOI: https:\/\/doi.org\/10.1109\/IV.2016.25","DOI":"10.1109\/IV.2016.25"},{"key":"5825_CR7","doi-asserted-by":"publisher","unstructured":"Quang Vinh Nguyen, Mao Lin Huang. (2003) A fast focus+context viewing technique for the navigation of classical hierarchical layout [C]. Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003, London, UK,: July 18, 2003, v1&2 : pp 188-192, DOI:https:\/\/doi.org\/10.1109\/IV.2003.1217955","DOI":"10.1109\/IV.2003.1217955"},{"key":"5825_CR8","unstructured":"A. Robert Marceau, B. Karen Daniels, and C. Georges Grinstein. (2016) A visualization framework to eliminate cluster overlap [C]. International Conference on Modeling, Simulation and Visualization Methods (MSV'16): pp 57-62"},{"key":"5825_CR9","doi-asserted-by":"publisher","unstructured":"Emden R. Gansner and Yifan Hu. (2009) Efficient node overlap removal using a proximity stress model [J]. Lecture Notes in Computer Science 5417, International Symposium on Graph Drawing 2008, Springer-Verlag Berlin Heidelberg: pp. 206-217, DOI: https:\/\/doi.org\/10.1007\/978-3-642-00219-9_20","DOI":"10.1007\/978-3-642-00219-9_20"},{"key":"5825_CR10","doi-asserted-by":"publisher","unstructured":"van Garderen, M, Pampel, B, Nocaj, A, Brandes, U. (2017) Minimum-displacement overlap removal for geo-referenced data visualization [J]. Computer Graphics Forum, v36(n3), 19th Eurographics\/IEEE VGTC Conference on Visualization (EuroVis), June 2017: pp 423-433, DOI: https:\/\/doi.org\/10.1111\/cgf.13199","DOI":"10.1111\/cgf.13199"},{"key":"5825_CR11","doi-asserted-by":"publisher","unstructured":"Hsiang-Yun Wu, Shigeo Takahashi, Chun-Cheng Lin and Hsu-Chun Yen. (2013) voronoi-based label placement for metro maps [C]. 17th International Conference on Information Visualization, v1: pp 96-101, DOI: https:\/\/doi.org\/10.1109\/IV.2013.11","DOI":"10.1109\/IV.2013.11"},{"key":"5825_CR12","doi-asserted-by":"crossref","unstructured":"Tim Dwyer, Kim Marriott, and Peter J. Stuckey. Fast node overlap removal [J]. (2005) Lecture Notes in Computer Science 3843, International Symposium on Graph Drawing 2005, Springer-Verlag Berlin Heidelberg: pp. 153-164","DOI":"10.1007\/11618058_15"},{"key":"5825_CR13","doi-asserted-by":"crossref","unstructured":"Antoine L huillier, Mereke van Garderen, Daniel Weiskopf. (2019) Density-based label placement [J]. The Visual Computer 35: 1041\u20131052, DOI: 10.1007\/ s00371-019-01686-7","DOI":"10.1007\/s00371-019-01686-7"},{"key":"5825_CR14","doi-asserted-by":"crossref","unstructured":"Meng, Y., Zhang, H., Liu, M., Liu, S. (2015) Clutter-aware label layout [C]. Proceedings of 2015 IEEE Pacific Visualization Symposium (PacificVis): pp. 207-214","DOI":"10.1109\/PACIFICVIS.2015.7156379"},{"key":"5825_CR15","doi-asserted-by":"publisher","unstructured":"Kimm Arriott, Peter Stuckey,Vincent Tam, Weiqing He. (2003) Removing node overlapping in graph layout using constrained optimization [J]. Constraints, v8: pp 143\u2013171, DOI: https:\/\/doi.org\/10.1023\/A:1022371615202","DOI":"10.1023\/A:1022371615202"},{"key":"5825_CR16","doi-asserted-by":"publisher","unstructured":"Xiaodi Huang, A.S.M. Sajeev, Wei Lai. (2006) A scalable algorithm for adjusting node-node overlaps [C]. Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06), 26-28 July, Sydney, Qld., Australia, v1: pp 43-48, DOI: https:\/\/doi.org\/10.1109\/CGIV.2006.9","DOI":"10.1109\/CGIV.2006.9"},{"key":"5825_CR17","doi-asserted-by":"publisher","unstructured":"Strobelt, Hendrik, Spicker, Marc, Stoffel, Andreas, Keim, Daniel, Deussen, Oliver. (2012) Rolled-out wordles: a heuristic method for overlap removal of 2D data representatives [J]. Computer Graphics Forum, v31 (n3): pp 1135-1144, DOI: https:\/\/doi.org\/10.1111\/j.1467-8659.2012. 03106.x","DOI":"10.1111\/j.1467-8659.2012"},{"key":"5825_CR18","doi-asserted-by":"publisher","unstructured":"Xiaodi Huang a, Wei Lai b, A.S.M. Sajeev a, Junbin Gao. (2007) A new algorithm for removing node overlapping in graph visualization [J]. Information Sciences, v177: pp 2821\u20132844, DOI: https:\/\/doi.org\/10.1016\/j.ins.2007.02.016","DOI":"10.1016\/j.ins.2007.02.016"},{"key":"5825_CR19","doi-asserted-by":"publisher","unstructured":"Walter Didimo, Evgenios M. Kornaropoulos, Fabrizio Montecchiani and Ioannis G. Tollis. (2018) A visualization framework and user studies for overloaded orthogonal drawings [J]. Computer Graphics Forum, v37(n1): pp. 288-300, DOI: https:\/\/doi.org\/10.1111\/cgf.13266","DOI":"10.1111\/cgf.13266"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-05825-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-05825-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-05825-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T06:32:47Z","timestamp":1645684367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-05825-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,13]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["5825"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-05825-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2021,3,13]]},"assertion":[{"value":"6 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The Authors declare that they have no Conflicts of Interest","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}