{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:29:37Z","timestamp":1742981377851,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642252488"},{"type":"electronic","value":"9783642252495"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25249-5_5","type":"book-chapter","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T01:36:36Z","timestamp":1320802596000},"page":"129-150","source":"Crossref","is-referenced-by-count":1,"title":["Continuous-Time Moving Network Voronoi Diagram"],"prefix":"10.1007","author":[{"given":"Chenglin","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"K.P. Agarwal","year":"1995","unstructured":"Agarwal, K.P., Sharir, M.: Davenport\u2013Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/11940128_20","volume-title":"Algorithms and Computation","author":"S.W. Bae","year":"2006","unstructured":"Bae, S.W., Kim, J.-H., Chwa, K.-Y.: Optimal Construction of the City Voronoi Diagram. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 183\u2013192. Springer, Heidelberg (2006)"},{"issue":"9","key":"5_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput.\u00a028(9), 643\u2013647 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"5_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational geometry algorithms and applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational geometry algorithms and applications. Springer, Heidelberg (1997)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-57273-2_50","volume-title":"Algorithms - ESA \u201993","author":"O. Devillers","year":"1993","unstructured":"Devillers, O., Golin, M.J.: Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. In: Lengauer, T. (ed.) ESA 1993. LNCS, vol.\u00a0726, pp. 133\u2013144. Springer, Heidelberg (1993)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L","volume":"36","author":"M. Erwig","year":"2000","unstructured":"Erwig, M.: The graph voronoi diagram with application. Networks\u00a036, 156\u2013163 (2000)","journal-title":"Networks"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/10515.10516","volume-title":"SCG 1986: Proceedings of the Second Annual Symposium on Computational Geometry","author":"L. Guibas","year":"1986","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside simple polygons. In: SCG 1986: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 1\u201313. ACM, New York (1986)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1287\/ijoc.4.4.412","volume":"4","author":"S. Hakimi","year":"1992","unstructured":"Hakimi, S., Labbe, M., Schmeiche, E.: The voronoi partition of a network and its implications in location theory. INFIRMS Journal on Computing\u00a04, 412\u2013417 (1992)","journal-title":"INFIRMS Journal on Computing"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10707-005-4575-8","volume":"9","author":"M.R. Kolahdouzan","year":"2005","unstructured":"Kolahdouzan, M.R., Shahabi, C.: Alternative solutions for continuous k nearest neighbor queries in spatial network databases. GeoInformatica\u00a09(4), 321\u2013341 (2005)","journal-title":"GeoInformatica"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/322217.322219","volume":"27","author":"D.T. Lee","year":"1980","unstructured":"Lee, D.T.: Two-dimensional voronoi diagrams in the lp-metric. J. ACM\u00a027(4), 604\u2013618 (1980)","journal-title":"J. ACM"},{"issue":"9","key":"5_CR11","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1080\/13658810701587891","volume":"22","author":"A. Okabe","year":"2008","unstructured":"Okabe, A., Satoh, T., Furuta, T., Suzuki, A., Okano, K.: Generalized network voronoi diagrams: Concepts, computational methods, and applications. Int. J. Geogr. Inf. Sci.\u00a022(9), 965\u2013994 (2008)","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/0220029","volume":"20","author":"J. Pach","year":"1991","unstructured":"Pach, J., Sharir, M.: On vertical visibility in arrangements of segments and the queue size in the bentley-ottmann line sweeping algorithm. SIAM J. Comput.\u00a020(3), 460\u2013470 (1991)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms\u00a021(2), 267\u2013305 (1996)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Science XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25249-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T07:57:26Z","timestamp":1593244646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25249-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642252488","9783642252495"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25249-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}