{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:37Z","timestamp":1725544777637},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_12","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"80-92","source":"Crossref","is-referenced-by-count":8,"title":["Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams"],"prefix":"10.1007","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BF02187749","volume":"4","author":"A. Aggarwal","year":"1989","unstructured":"Aggarwal, A., Guibas, L.J., Saxe, J.B., Shor, P.W.: A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom.\u00a04(6), 591\u2013604 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"12_CR2","unstructured":"Aronov, B., Bose, P., Demaine, E.D., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M.: Data structures for halfplane proximity queries and incremental voronoi diagrams, arXiv:cs.CG\/0512093, http:\/\/arXiv.org\/abs\/cs.CG\/0512093"},{"key":"12_CR3","unstructured":"Calling, T.: The adventures of Flarb Demingo! (2005), http:\/\/www.thecalling.co.za\/flarb_pictures.htm , See also the fan site, http:\/\/www2.fanscape.com\/thecalling\/streetteam\/flarb.html"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. In: Proc. 17th ACM-SIAM Sympos. Discrete Algorithms (2006)","DOI":"10.1145\/1109557.1109689"},{"issue":"9","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/5.163409","volume":"80","author":"Y.-J. Chiang","year":"1992","unstructured":"Chiang, Y.-J., Tamassia, R.: Dynamic algorithms in computational geometry. Proc. IEEE\u00a080(9), 1412\u20131434 (1992)","journal-title":"Proc. IEEE"},{"key":"12_CR6","volume-title":"Digital Cartography","author":"R.G. Cromley","year":"1991","unstructured":"Cromley, R.G.: Digital Cartography. Prentice-Hall, Englewood Cliffs (August 1991)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Daescu, O., Mi, N., Shin, C.-S., Wolff, A.: Farthest-point queries with geometric and combinatorial constraints. Computat. Geom. Theory Appl. (2006) (to appear)","DOI":"10.1016\/j.comgeo.2005.07.002"},{"key":"12_CR8","volume-title":"Computat. Geom. Theory Appl.","author":"M. Berg de","year":"1999","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computat. Geom. Theory Appl., 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"key":"12_CR9","unstructured":"Dent, B.D.: Cartography: Thematic Map Design, 5th edn. William C. Brown Pub. (July 1998)"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences\u00a038(1), 86\u2013124 (1989)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Guibas, L., Stolfi, J.: Optimal point location in a monotone subdivision. SIAM Journal on Computing\u00a015(2), 317\u2013340 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0925-7721(92)90013-I","volume":"1","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D.: The farthest point Delaunay triangulation minimizes angles. Computat. Geom. Theory Appl.\u00a01(3), 143\u2013148 (1992)","journal-title":"Computat. Geom. Theory Appl."},{"key":"12_CR13","unstructured":"McMaster, R.B., Shea, K.S.: Generalization in Digital Cartography. Association of American Cartographers, Washington D.C. (1992)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"The Design of Dynamic Data Structures","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The Design of Dynamic Data Structures. LNCS, vol.\u00a0156. Springer, Heidelberg (1983)"},{"key":"12_CR15","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1993","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1993)"},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences\u00a026(3), 362\u2013391 (1983)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:49Z","timestamp":1555445929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11682462_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}