{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:13:58Z","timestamp":1760440438856},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01759056","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:43:56Z","timestamp":1118918636000},"page":"490-521","source":"Crossref","is-referenced-by-count":9,"title":["Order-k voronoi diagrams of sites with additive weights in the plane"],"prefix":"10.1007","volume":"6","author":[{"given":"Harald","family":"Rosenberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01759056_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF00164401","volume":"20","author":"P. F. Ash","year":"1986","unstructured":"Ash, P. F. and Bolker, E. D. Generalized Dirichlet tessellations.Geometriae Dedicata 20 (1986), 209\u2013243.","journal-title":"Geometriae Dedicata"},{"key":"BF01759056_CR2","unstructured":"Aurenhammer, F. Efficient computation of low-order Voronoi diagrams via convex hulls. Report 216, Institute f\u00fcr Informationsverarbeitung Graz, Technische Universit\u00e4t Graz, 1985."},{"key":"BF01759056_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0031-3203(84)90064-5","volume":"17","author":"F. Aurenhammer","year":"1984","unstructured":"Aurenhammer, F. and Edelsbrunner, H. An optimal algorithm for constructing the weighted Voronoi diagram in the plane.Pattern Recognition 17 (1984), 251\u2013257.","journal-title":"Pattern Recognition"},{"key":"BF01759056_CR4","doi-asserted-by":"crossref","unstructured":"Chazelle, B. and Edelsbrunner, H. An improved algorithm for constructingkth-order Voronoi diagrams.Proceedings of the ACM Symposium on Computational Geometry, 1985, pp. 228\u2013234.","DOI":"10.1145\/323233.323263"},{"key":"BF01759056_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01840438","volume":"1","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H. Edge-skeletons in arrangements with applications.Algorithmica 1 (1986), 93\u2013109.","journal-title":"Algorithmica"},{"key":"BF01759056_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987."},{"key":"BF01759056_CR7","unstructured":"Edelsbrunner, H. and M\u00fccke, E. P. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. To appear inTransactions on Graphics."},{"key":"BF01759056_CR8","series-title":"Technical Report UIUCDCS-R-88-1400","volume-title":"Circles through two points that always enclose many points","author":"H. Edelsbrunner","year":"1988","unstructured":"Edelsbrunner, H., Hasan, N., Seidel, R. and Shen, X. J. Circles through two points that always enclose many points. Technical Report UIUCDCS-R-88-1400, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois, 1988."},{"key":"BF01759056_CR9","doi-asserted-by":"crossref","unstructured":"Fortune, S. A sweepline algorithm for Voronoi diagrams.Proceedings of the 2nd Annual ACM Symposium on Computational Geometry, 1986, pp. 313\u2013322.","DOI":"10.1145\/10515.10549"},{"key":"BF01759056_CR10","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L. Guibas","year":"1985","unstructured":"Guibas, L. and Stolfi, J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams.ACM Transactions on Graphics 4 (1985), 74\u2013123.","journal-title":"ACM Transactions on Graphics"},{"key":"BF01759056_CR11","first-page":"478","volume":"31","author":"D.-T. Lee","year":"1982","unstructured":"Lee, D.-T. Onk-nearest neighbor Voronoi diagrams in the plane.IEEE Transactions on Computers 31 (1982), 478\u2013487.","journal-title":"IEEE Transactions on Computers"},{"key":"BF01759056_CR12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0210006","volume":"10","author":"D.-T. Lee","year":"1981","unstructured":"Lee, D.-T. and Drysdale, R. L. III. Generalization of Voronoi diagrams in the plane.SIAM Journal on Computing 10 (1981), 73\u201387.","journal-title":"SIAM Journal on Computing"},{"key":"BF01759056_CR13","volume-title":"Master Thesis","author":"H. Rosenberger","year":"1988","unstructured":"Rosenberger, H. Order-k Voronoi diagrams of sites with additive weights in the plane. Master Thesis, University of Illinois at Urbana-Champagign, Illinois, 1988."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759056.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01759056\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:27:09Z","timestamp":1586287629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01759056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":13,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01759056"],"URL":"https:\/\/doi.org\/10.1007\/bf01759056","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}