{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:30Z","timestamp":1740160290957,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T00:00:00Z","timestamp":1453852800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["51274144"],"award-info":[{"award-number":["51274144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61300121","61170107"],"award-info":[{"award-number":["61300121","61170107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s13042-015-0491-x","type":"journal-article","created":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T08:48:12Z","timestamp":1453884492000},"page":"679-688","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weighted Node Network Voronoi Diagram and its application to optimization of chain stores layout"],"prefix":"10.1007","volume":"7","author":[{"given":"Jingna","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyun","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shujuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,27]]},"reference":[{"key":"491_CR1","volume-title":"Urbanization and urban GIS [M]","author":"S Chen","year":"1999","unstructured":"Chen S (1999) Urbanization and urban GIS [M]. Science Press, Beijing"},{"issue":"3","key":"491_CR2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1145\/882262.882296","volume":"22","author":"P Alliez","year":"2003","unstructured":"Alliez P, Cohen-Steiner D, Devillers O, L\u00e9vy B, Desbrun M (2003) Anisotropic polygonal remeshing. ACM Trans Graph (TOG) [C] 22(3):485\u2013493","journal-title":"ACM Trans Graph (TOG) [C]"},{"key":"491_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1080\/02693799408901986","volume":"8","author":"A Okabe","year":"1994","unstructured":"Okabe A, Boots B, Sugihara K (1994) Nearest neighborhood operations with generalized Voronoi Diagram [J]. Int J Geogr Inf Syst 8:43\u201371","journal-title":"Int J Geogr Inf Syst"},{"key":"491_CR4","doi-asserted-by":"crossref","unstructured":"Boissonnat J-D, Oudot S (2006) Provably good sampling and meshing of Lipschitz surfaces. In: Proceedings of the twenty-second annual symposium on computational geometry [C], Sedona","DOI":"10.1145\/1137856.1137906"},{"issue":"4","key":"491_CR5","first-page":"675","volume":"7","author":"Y Tan","year":"2012","unstructured":"Tan Y, Zhao Y, Wang Y (2012) Power network Voronoi Diagram and dynamic construction [J]. J Netw 7(4):675\u2013682","journal-title":"J Netw"},{"key":"491_CR6","doi-asserted-by":"crossref","unstructured":"Edetsbrunner H (1995) Smooth surfaces for multiscale shape representation. In: Proceedings of the 15th conference on foundations of software technology and theoretical computer science, Bangalore, pp 391\u2013412","DOI":"10.1007\/3-540-60692-0_63"},{"issue":"3","key":"491_CR7","first-page":"77-1","volume":"28","author":"D Bommes","year":"2009","unstructured":"Bommes D, Zimmer H, Kobbelt L (2009) Mixed-integer quadrangulation. ACM Trans Graph (TOG) [C] 28(3):77-1\u201377-10","journal-title":"ACM Trans Graph (TOG) [C]"},{"issue":"1","key":"491_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s40708-015-0009-z","volume":"2","author":"Z Yao","year":"2015","unstructured":"Yao Z, Hu B, Xie Y et al (2015) A review of structural and functional brain networks: small world and atlas [J]. Brain Inform 2(1):45\u201352","journal-title":"Brain Inform"},{"key":"491_CR9","doi-asserted-by":"crossref","unstructured":"Xuan K, Zhao G, Taniar D, Srinivasan B, Safar M, Gavrilova M (2009) Node Voronoi Diagram based range search. In: Proceedings of the 2009 international conference on advanced information nodeing and applications [C], pp 741\u2013748","DOI":"10.1109\/AINA.2009.82"},{"issue":"10","key":"491_CR10","first-page":"1","volume":"56","author":"GA Rosi","year":"2015","unstructured":"Rosi GA, Walker AM, Rival DE (2015) Lagrangian coherent structure identification using a Voronoi tessellation-based networking algorithm [J]. Exp Fluids 56(10):1\u201314","journal-title":"Exp Fluids"},{"key":"491_CR11","doi-asserted-by":"crossref","unstructured":"Chen Z, Shen HT, Zhou X, Zheng Y, Xie X (2010) Searching trajectories by locations: an efficiency study. In: Proceedings of the 2010 international conference on management of data [C], Indianapolis","DOI":"10.1145\/1807167.1807197"},{"key":"491_CR12","doi-asserted-by":"crossref","unstructured":"Qinghong Z, Ye Z (2012) Dynamic construction of network Voronoi diagram for lines. J Converg Inf Technol [C] 7(22):245\u2013253","DOI":"10.4156\/jcit.vol7.issue22.29"},{"key":"491_CR13","doi-asserted-by":"crossref","unstructured":"Mozosa OM, Boleab JA, Ferrandezc JM, Ahneltd PK, Fernandez E (2010) V-proportion: a method based on the Voronoi diagram to study spatial relations in neuronal mosaics of the retina [C], pp 1165\u20131174","DOI":"10.1016\/j.neucom.2011.02.001"},{"key":"491_CR14","doi-asserted-by":"crossref","unstructured":"Liu Y, Wang W, L\u00e9vy B, Sun F, Yan D-M, Lu L, Yang C (2009) On centroidal Voronoi tessellation\u2014energy smoothness and fast computation. ACM Trans Graph (TOG) [C] 28(4):1\u201317","DOI":"10.1145\/1559755.1559758"},{"key":"491_CR15","doi-asserted-by":"crossref","unstructured":"Zhao Y, Zhang Y (2009) Dynamic construction of Voronoi diagram for figures. In: Proceeding 2009 IEEE 10th international conference on computer-aided industrial design and conceptual design: E-business, creative design, manufacturing-CAID & CD [C], pp 2189\u20132192","DOI":"10.1109\/CAIDCD.2009.5375126"},{"key":"491_CR16","doi-asserted-by":"crossref","unstructured":"Zhao Y, Liu S, Tan Y (2010) Discrete construction of order-k Voronoi diagram. In: Proceedings of the first international conference on information computing and applications (ICICA\u201910). Springer, Berlin","DOI":"10.1007\/978-3-642-16167-4_11"},{"key":"491_CR17","doi-asserted-by":"crossref","unstructured":"Zhao Y, Zhang Y-J, Zhang Q-H (2010) Discrete construction of Voronoi diagrams for cross generators. In: 2010 international conference on machine learning and cybernetics, (ICMLC\u201910) [C], vol 3, pp 1556\u20131559","DOI":"10.1109\/ICMLC.2010.5580811"},{"key":"491_CR18","unstructured":"Ran W, Zhao Y (2010) Discrete construction of node Voronoi diagram. In: ICMCI\u201910 [C], pp 630\u2013632"},{"key":"491_CR19","doi-asserted-by":"crossref","unstructured":"Prasad JR, Kulkarni U (2015) Gujrati character recognition using weighted\u00a0k-NN and\u00a0mean \u03c72\u00a0distance measure. Int J Mach Learn Cybern [J] 6:69\u201382","DOI":"10.1007\/s13042-013-0187-z"},{"key":"491_CR20","doi-asserted-by":"crossref","unstructured":"Zhang L, Qiao L\u00a0(2015) A graph optimization method for dimensionality reduction with pairwise constraints. Int J Mach Learn Cybern [J] 9:1\u20137","DOI":"10.1007\/s13042-014-0321-6"},{"key":"491_CR21","doi-asserted-by":"crossref","unstructured":"Yang Y, Wang G, Yang Y (2014) Parameters optimization of polygonal fuzzy neural networks based on GA-BP hybrid algorithm. Int J Mach Learn Cybern [J] 5:815\u2013822","DOI":"10.1007\/s13042-013-0224-y"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0491-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0491-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0491-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T21:33:59Z","timestamp":1567546439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0491-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,27]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["491"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0491-x","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2016,1,27]]}}}