{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:24:57Z","timestamp":1725665097126},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642280757"},{"type":"electronic","value":"9783642280764"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28076-4_6","type":"book-chapter","created":{"date-parts":[[2012,2,27]],"date-time":"2012-02-27T08:53:14Z","timestamp":1330332794000},"page":"28-39","source":"Crossref","is-referenced-by-count":1,"title":["Farthest Voronoi Diagrams under Travel Time Metrics"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_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. IX Encuetros en Geometria Computacional (2001)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0020-0190(02)00505-7","volume":"86","author":"M. Abellanas","year":"2003","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacrist\u00e1n, V.: Voronoi diagram for services neighboring a highway. Information Processing Letters\u00a086, 283\u2013288 (2003)","journal-title":"Information Processing Letters"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00454-003-2947-0","volume":"31","author":"O. Aichholzer","year":"2004","unstructured":"Aichholzer, O., Aurenhammer, F., Palop, B.: Quickest paths, straight skeletons, and the city Voronoi diagram. Discrete Comput. Geom.\u00a031(1), 17\u201335 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"6_CR4","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-3","key":"6_CR5","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-3), 117\u2013144 (2006)","journal-title":"Internat. J. Comp. Geom. Appl."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bae, S.W., Chwa, K.Y.: The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. In: Proc. 25th ACM Annu. Sympos. Comput. Geom. (SoCG), pp. 198\u2013207 (2009)","DOI":"10.1145\/1542362.1542402"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S021819590900285X","volume":"19","author":"S.W. Bae","year":"2009","unstructured":"Bae, S.W., Kim, J.H., Chwa, K.Y.: Optimal construction of the city Voronoi diagram. International Journal of Computational Geometry and Applications\u00a019(2), 95\u2013117 (2009)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Moshe, B., Katz, M.J., Mitchell, J.S.B.: Farthest neighbors and center points in the presence of rectangular obstacles. In: Symposium on Computational Geometry, pp. 164\u2013171 (2001)","DOI":"10.1145\/378583.378657"},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computationsl Geometry: Alogorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computationsl Geometry: Alogorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.comgeo.2010.11.004","volume":"44","author":"O. Cheong","year":"2011","unstructured":"Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.S.: Farthest-polygon Voronoi diagrams. Comput. Geom.: Theory and Appl.\u00a044(4), 234\u2013247 (2011)","journal-title":"Comput. Geom.: Theory and Appl."},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J. Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput.\u00a028(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52055-4","volume-title":"Concrete and Abstract Voronoi Diagrams","author":"R. Klein","year":"1989","unstructured":"Klein, R.: Concrete and Abstract Voronoi Diagrams. LNCS, vol.\u00a0400. Springer, Heidelberg (1989)"},{"issue":"6","key":"6_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1142\/S0218195901000663","volume":"11","author":"K. Mehlhorn","year":"2001","unstructured":"Mehlhorn, K., Meiser, S., Rasch, R.: Furthest site abstract Voronoi diagrams. Internat. J. Comput. Geom. Appl.\u00a011(6), 583\u2013616 (2001)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"6_CR14","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":"6_CR15","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":"6_CR16","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier (2000)","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM\u00a038(1), 18\u201373 (1991)","journal-title":"Journal of the ACM"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Moet, E., van Kreveld, M.J., van der Stappen, A.F.: On realistic terrains. In: Symposium on Computational Geometry, pp. 177\u2013186 (2006)","DOI":"10.1145\/1137856.1137885"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0747-7171(08)80064-8","volume":"10","author":"K. Mulmuley","year":"1990","unstructured":"Mulmuley, K.: A fast planar partition algorithm. J. Symbolic Comput.\u00a010, 253\u2013280 (1990)","journal-title":"J. Symbolic Comput."},{"key":"6_CR20","unstructured":"Palop, B.: Algorithmic problems on proximity and location under metric constraints. Ph.D. thesis, U. Polit\u00e9cnica de Catalunya (2003)"},{"key":"6_CR21","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28076-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T03:00:49Z","timestamp":1556420449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28076-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280757","9783642280764"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28076-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}