{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:16Z","timestamp":1725474976911},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_20","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"183-192","source":"Crossref","is-referenced-by-count":9,"title":["Optimal Construction of the City Voronoi Diagram"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]},{"given":"Jae-Hoon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacrist\u00e1n, V.: Proximity problems for time metrics induced by the L\n 1 metric and isothetic networks. In: IX Encuetros en Geometria Computacional (2001)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Aurenhammer, F., Palop, B.: Quickest paths, straight skeletons, and the city Voronoi diagram. In: Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 151\u2013159 (2002)","DOI":"10.1145\/513400.513420"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/11602613_100","volume-title":"Algorithms and Computation","author":"S.W. Bae","year":"2005","unstructured":"Bae, S.W., Chwa, K.-Y.: Shortest paths and Voronoi diagrams with transportation networks under general distances. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 1007\u20131018. Springer, Heidelberg (2005)"},{"issue":"2\u20133","key":"20_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1142\/S0218195906001963","volume":"16","author":"S.W. Bae","year":"2006","unstructured":"Bae, S.W., Chwa, K.-Y.: Voronoi diagrams for a transportation network on the Euclidean plane. Internat. J. Comp. Geom. Appl.\u00a016(2\u20133), 117\u2013144 (2006)","journal-title":"Internat. J. Comp. Geom. Appl."},{"key":"20_CR5","unstructured":"Bae, S.W., Kim, J.-H., Chwa, K.-Y.: L\n 1 shortest paths with isothetic roads. Technical Report CS-TR-2005-241, KAIST (2005)"},{"key":"20_CR6","unstructured":"G\u00f6rke, R., Wolff, A.: Computing the city Voronoi diagram faster. In: Proc. 21st Euro. Workshop on Comput. Geom., pp. 155\u2013158 (2005)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01758836","volume":"8","author":"J.S.B. Mitchell","year":"1992","unstructured":"Mitchell, J.S.B.: L\n 1 shortest paths among polygonal obstacles in the plane. Algorithmica\u00a08, 55\u201388 (1992)","journal-title":"Algorithmica"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"J.S.B. Mitchell","year":"1996","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Internat. J. Comput. Geom. Appl.\u00a06(3), 309\u2013331 (1996)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"20_CR9","unstructured":"Ostrovsky-Berman, Y.: Computing transportation Voronoi diagrams in optimal time. In: Proc. 21st Euro. Workshop on Comput. Geom., pp. 159\u2013162 (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:46Z","timestamp":1619495386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11940128_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}