{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:31Z","timestamp":1725571291734},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_20","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"230-241","source":"Crossref","is-referenced-by-count":2,"title":["The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]},{"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(86)90055-4","volume":"22","author":"F. Aurenhammer","year":"1986","unstructured":"Aurenhammer, F.: The one-dimensional weighted Voronoi diagram. Inf. Process. Lett.\u00a022(3), 119\u2013123 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0031-3203(84)90064-5","volume":"17","author":"F. Aurenhammer","year":"1984","unstructured":"Aurenhammer, F., Edelsbrunner, H.: An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition\u00a017(2), 251\u2013257 (1984)","journal-title":"Pattern Recognition"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Chen, D.Z., Wang, H.: Locating an obnoxious line among planar objects. In: Proc. 20th Int. Sympos. Algo. Comput. (ISAAC), pp. 740\u2013749 (2009)","DOI":"10.1007\/978-3-642-10631-6_75"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"Cole, R.: Parallel merge sort. SIAM J. Comput.\u00a017(4), 770\u2013785 (1988)","journal-title":"SIAM J. Comput."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Cole, R., Yap, C.: Geometric retrieval problems. In: Proc. 24th IEEE Sympos. Foundation of Computer Science (FOCS), pp. 112\u2013121 (1983)","DOI":"10.1109\/SFCS.1983.22"},{"key":"20_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ejor.2006.06.013","volume":"181","author":"J.M. D\u00edaz-B\u00e1\u00f1ez","year":"2007","unstructured":"D\u00edaz-B\u00e1\u00f1ez, J.M., Ramos, P.A., Sabariego, P.: The maximin line problem with regional demand. European Journal of Operational Research\u00a0181(1), 20\u201329 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1057\/jors.1989.174","volume":"40","author":"Z. Drezner","year":"1989","unstructured":"Drezner, Z., Wesolowsky, G.: Location of an obnoxious route. Journal of Operational Research Society\u00a040(11), 1011\u20131018 (1989)","journal-title":"Journal of Operational Research Society"},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/0196-6774(83)90013-5","volume":"4","author":"R.L. Graham","year":"1983","unstructured":"Graham, R.L., Yao, F.F.: Finding the convex hull of a simple polygon. J. Algorithms\u00a04(4), 324\u2013331 (1983)","journal-title":"J. Algorithms"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of n line segments in o(n logn) time. Inf. Process. Lett.\u00a033(4), 169\u2013174 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"20_CR11","first-page":"231","volume":"1","author":"R. Janardan","year":"1994","unstructured":"Janardan, R., Preparata, F.P.: Widest-corridor problems. Nordic J. of Computing\u00a01(2), 231\u2013245 (1994)","journal-title":"Nordic J. of Computing"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","volume":"21","author":"D. Lee","year":"1985","unstructured":"Lee, D., Chiang, Y.: The power of geometric duality revisited. Inform. Process Lett.\u00a021, 117\u2013122 (1985)","journal-title":"Inform. Process Lett."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(02)00322-5","volume":"299","author":"S.C. Nandy","year":"2003","unstructured":"Nandy, S.C., Das, S., Goswami, P.P.: An efficient k nearest neighbors searching algorithm for a query line. Theoretical Computer Science\u00a0299, 273\u2013288 (2003)","journal-title":"Theoretical Computer Science"},{"key":"20_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)"},{"key":"20_CR15","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)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.comgeo.2004.03.006","volume":"28","author":"R. Oostrum van","year":"2004","unstructured":"van Oostrum, R., Veltkamp, R.C.: Parametric search made practical. Comput. Geom: Theory and Appl.\u00a028, 75\u201388 (2004)","journal-title":"Comput. Geom: Theory and Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T13:24:36Z","timestamp":1553261076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}