{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:07Z","timestamp":1725663667483},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540522928"},{"type":"electronic","value":"9783540469506"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52292-1_24","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:30:12Z","timestamp":1330205412000},"page":"330-340","source":"Crossref","is-referenced-by-count":2,"title":["k \u2014 Nearest \u2014 Neighbor Voronoi diagrams for sets of convex polygons, line segments and points"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Roos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"11","key":"24_CR1","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1109\/TC.1987.5009474","volume":"C-36","author":"B. Chazelle","year":"1987","unstructured":"B. Chazelle and H. Edelsbrunner, An Improved Algorithm for Constructing k th \u2014 Order Voronoi Diagrams, IEEE Transactions on Computers, Nov. 1987, Vol. C-36, No. 11, pp 1349\u20131354","journal-title":"IEEE Transactions on Computers"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"F. Dehne, An O(n 4) Algorithm to Construct all Voronoi Diagrams for k Nearest Neighbor Searching, Proc. 10th Colloquium on Automata, Languages and Programming, 1983","DOI":"10.1007\/BFb0036906"},{"key":"24_CR3","unstructured":"R.L. Drysdale III and D.T. Lee, Generalized Voronoi Diagrams in the Plane, Proc. 16th Annual Allerton Conference on Communications, Control and Computing, Oct. 1978, pp 833\u2013842"},{"key":"24_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorical Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner, Algorithms in Combinatorical Geometry, EATCS Monographs in Computer Science, Springer-Verlag, Berlin-Heidelberg, 1987"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01840438","volume":"1","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, Edge-Skeletons in Arrangements with Applications, Algorithmica 1986, Vol. 1, pp 93\u2013109","journal-title":"Algorithmica"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner and R. Seidel, Voronoi Diagrams and Arrangements, Proc. 2nd Annual ACM Symp. Computational Geometry, Yorktown Heights, 1986","DOI":"10.1007\/BF02187681"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"S. Fortune, A Sweepline Algorithm for Voronoi Diagrams, Proc. 2nd Annual ACM Symp. Computational Geometry, Yorktown Heights, 1986, pp 313\u2013322","DOI":"10.1145\/10515.10549"},{"issue":"6","key":"24_CR8","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1982.1676031","volume":"C-31","author":"D.T. Lee","year":"1982","unstructured":"D.T. Lee, On k-Nearest Neighbor Voronoi Diagrams in the Plane, IEEE Transactions on Computers, June 1982, Vol. C-31, No. 6, pp 478\u2013487","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0210006","volume":"10","author":"D.T. Lee","year":"1981","unstructured":"D.T. Lee and R.L. Drysdale III, Generalisation of Voronoi Diagrams in the Plane, SIAM J. Comput., Feb. 1981, Vol. 10, No. 1, pp 73\u201387","journal-title":"SIAM J. Comput."},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F.P. Preparata","year":"1977","unstructured":"F.P. Preparata and S.J. Hong, Convex Hulls of Finite Sets of Points in Two and Three Dimensions, Comm. ACM, Feb. 1977, Vol. 20, No. 2, pp 87\u201393","journal-title":"Comm. ACM"},{"key":"24_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry \u2014 An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry \u2014 An Introduction, Springer-Verlag, New York, 1985"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"M.I. Shamos and D. Hoey, Closest \u2014 Point Problems, Proc. 16th Annual Symp. on FOCS, 1975, pp 151\u2013162","DOI":"10.1109\/SFCS.1975.8"},{"key":"24_CR13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C.K. Yap","year":"1987","unstructured":"C.K. Yap, An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments, Discrete & Computational Geometry, 1987, Vol. 2, pp 365\u2013393","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52292-1_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:52Z","timestamp":1605648232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52292-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540522928","9783540469506"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-52292-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}