{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:53:41Z","timestamp":1742961221529,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623948"},{"type":"electronic","value":"9783319623955"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62395-5_31","type":"book-chapter","created":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T00:52:59Z","timestamp":1499302379000},"page":"455-464","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Nearest Neighbour Graph and Locally Minimal Triangulation"],"prefix":"10.1007","author":[{"given":"Ivana","family":"Kolingerov\u00e1","sequence":"first","affiliation":[]},{"given":"Andrej","family":"Ferko","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Vom\u00e1\u010dka","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Ma\u0148\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,7]]},"reference":[{"issue":"4","key":"31_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF02712872","volume":"16","author":"O Aichholzer","year":"1996","unstructured":"Aichholzer, O., Aurenhammer, F., Cheng, S.W., Katoh, N., Rote, G., Taschwer, M., Xu, Y.F.: Triangulations intersect nicely. Discrete Comput. Geom. 16(4), 339\u2013359 (1996)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1998.0988","volume":"31","author":"J Basch","year":"1999","unstructured":"Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms 31(1), 1\u201328 (1999)","journal-title":"J. Algorithms"},{"unstructured":"Bayer, T.: Department of Applied Geoinformatics and Cartography, Faculty of Science, Charles University, Prague, Czech Republic. https:\/\/web.natur.cuni.cz\/~bayertom. Accessed 15 May 2017","key":"31_CR3"},{"doi-asserted-by":"crossref","unstructured":"Beirouti, R., Snoeyink, J.: Implementations of the LMT heuristic for minimum weight triangulation. In: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, SCG 1998, pp. 96\u2013105. ACM, New York (1998)","key":"31_CR4","DOI":"10.1145\/276884.276895"},{"issue":"06","key":"31_CR5","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1142\/S0218195902000979","volume":"12","author":"P Bose","year":"2002","unstructured":"Bose, P., Devroye, L., Evans, W.: Diamonds are not a minimum weight triangulation\u2019s best friend. Int. J. Comput. Geom. Appl. 12(06), 445\u2013453 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1\u20133","key":"31_CR6","first-page":"50","volume":"5","author":"HG Cho","year":"1997","unstructured":"Cho, H.G.: On the expected number of common edges in Delaunay and greedy triangulation. J. WSCG 5(1\u20133), 50\u201359 (1997)","journal-title":"J. WSCG"},{"key":"31_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546860","volume-title":"Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics)","author":"TK Dey","year":"2006","unstructured":"Dey, T.K.: Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics). Cambridge University Press, New York (2006)"},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/PL00009320","volume":"18","author":"MT Dickerson","year":"1997","unstructured":"Dickerson, M.T., Keil, J.M., Montague, M.H.: A large subgraph of the minimum weight triangulation. Discrete Comput. Geom. 18(3), 289\u2013304 (1997)","journal-title":"Discrete Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Dickerson, M.T., Montague, M.H.: A (usually?) connected subgraph of the minimum weight triangulation. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, SCG 1996, pp. 204\u2013213. ACM, New York (1996)","key":"31_CR9","DOI":"10.1145\/237218.237364"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0167-8396(98)00039-9","volume":"16","author":"M Gavrilova","year":"1999","unstructured":"Gavrilova, M., Rokne, J.: Swap conditions for dynamic Voronoi diagrams for circles and line segments. Comput. Aided Geom. Des. 16(2), 89\u2013106 (1999)","journal-title":"Comput. Aided Geom. Des."},{"issue":"4","key":"31_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0167-8396(03)00027-X","volume":"20","author":"M Gavrilova","year":"2003","unstructured":"Gavrilova, M., Rokne, J.: Updating the topology of the dynamic Voronoi diagram for spheres in euclidean d-dimensional space. Comput. Aided Geom. Des. 20(4), 231\u2013242 (2003)","journal-title":"Comput. Aided Geom. Des."},{"doi-asserted-by":"crossref","unstructured":"Guibas, L., Russel, D.: An empirical comparison of techniques for updating Delaunay triangulations. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, SCG 2004, pp. 170\u2013179. ACM, New York (2004)","key":"31_CR12","DOI":"10.1145\/997817.997846"},{"unstructured":"Kim, Y.S., Park, D.G., Jung, H.Y., Cho, H.G., Dong, J.J., Ku, K.J.: An improved TIN compression using Delaunay triangulation. In: Proceedings of Seventh Pacific Conference on Computer Graphics and Applications (Cat. No. PR00293), pp. 118\u2013125 (1999)","key":"31_CR13"},{"key":"31_CR14","series-title":"Probability and Statistics","doi-asserted-by":"publisher","DOI":"10.1002\/9780470317013","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"A Okabe","year":"2000","unstructured":"Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Probability and Statistics, 2nd edn. Wiley, New York (2000)","edition":"2"},{"key":"31_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"issue":"5","key":"31_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0925-7721(96)00025-9","volume":"7","author":"P Su","year":"1997","unstructured":"Su, P., Drysdale, R.L.S.: A comparison of sequential Delaunay triangulation algorithms. Comput. Geom. 7(5), 361\u2013385 (1997)","journal-title":"Comput. Geom."},{"issue":"1","key":"31_CR17","first-page":"49","volume":"59","author":"D \u0160peli\u010d","year":"2008","unstructured":"\u0160peli\u010d, D., Novak, F., \u017dalik, B.: Delaunay triangulation benchmarks. J. Electr. Eng. 59(1), 49\u201352 (2008)","journal-title":"J. Electr. Eng."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62395-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:57:28Z","timestamp":1710327448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62395-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623948","9783319623955"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62395-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"7 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}