{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:37:05Z","timestamp":1787495825070,"version":"build-2736575974"},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7290,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0925-7721(93)90033-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:31Z","timestamp":1027640491000},"page":"157-184","source":"Crossref","is-referenced-by-count":94,"title":["Randomized incremental construction of abstract Voronoi diagrams"],"prefix":"10.1016","volume":"3","author":[{"given":"Rolf","family":"Klein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Meiser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90033-3_BIB1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/0216006","article-title":"Power diagrams: Properties, algorithms and applications","volume":"16","author":"Aurenhammer","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(93)90033-3_BIB2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi diagrams\u2014A survey of fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/0925-7721(93)90033-3_BIB3","article-title":"On the randomized construction of the Delaunay tree","author":"Boissonnat","year":"1989","journal-title":"Technical Report 1140"},{"key":"10.1016\/0925-7721(93)90033-3_BIB4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02293035","article-title":"Applications of random sampling to on-line algorithms in computational geometry","volume":"8","author":"Boissonnat","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90033-3_BIB5","first-page":"278","article-title":"An on-line construction of higher order Voronoi diagrams and its randomized analysis","author":"Boissonnat","year":"1990","journal-title":"Proc. of the 2nd Canadian Conference on Computational Geometry"},{"key":"10.1016\/0925-7721(93)90033-3_BIB6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(79)90074-7","article-title":"Voronoi diagrams from convex hulls","volume":"9","author":"Brown","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(93)90033-3_BIB7","first-page":"463","article-title":"Four results on randomized incremental constructions","volume":"LNCS 577","author":"Clarkson","year":"1992"},{"key":"10.1016\/0925-7721(93)90033-3_BIB8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry, II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90033-3_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","article-title":"Voronoi diagrams and arrangements","volume":"1","author":"Edelsbrunner","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90033-3_BIB10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90033-3_BIB11","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01758770","article-title":"Randomized incremental construction of Delaunay and Voronoi diagrams","volume":"7","author":"Guibas","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90033-3_BIB12","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0925-7721(93)90033-3_BIB13","first-page":"148","article-title":"Abstract Voronoi diagrams and their applications","volume":"LNCS 333","author":"Klein","year":"1988"},{"key":"10.1016\/0925-7721(93)90033-3_BIB14","first-page":"434","article-title":"Voronoi diagrams in the Moscow metric","volume":"LNCS 344","author":"Klein","year":"1988","journal-title":"Proc. of the Workshop on Graphtheoretic Concepts in Computer Science, Amsterdam"},{"key":"10.1016\/0925-7721(93)90033-3_BIB15","first-page":"356","article-title":"Combinatorial properties of abstract Voronoi diagrams","volume":"LNCS 411","author":"Klein","year":"1989"},{"key":"10.1016\/0925-7721(93)90033-3_BIB16","volume":"LNCS 400","author":"Klein","year":"1989"},{"key":"10.1016\/0925-7721(93)90033-3_BIB17","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/322217.322219","article-title":"Two-dimensional Voronoi diagrams in the Lp-metric","volume":"27","author":"Lee","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0925-7721(93)90033-3_BIB18","article-title":"Intersection and proximity problems and Voronoi diagrams","volume":"Vol. 1","author":"Leven","year":"1986"},{"key":"10.1016\/0925-7721(93)90033-3_BIB19","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02574686","article-title":"On the construction of abstract Voronoi diagrams","volume":"6","author":"Mehlhorn","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90033-3_BIB20","series-title":"Technical Report MPI-I-92-135","article-title":"Furthest site abstract Voronoi diagrams","author":"Mehlhorn","year":"1992"},{"key":"10.1016\/0925-7721(93)90033-3_BIB21","first-page":"151","article-title":"Closet point problems","author":"Shamos","year":"1975","journal-title":"Proc. of the 16th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(93)90033-3_BIB22","series-title":"Master's Thesis","article-title":"Die Konstruktion abstrakter Voronoidiagramme","author":"Zimmer","year":"1992"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:55:52Z","timestamp":1555124152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772193900333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0925772193900333"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90033-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}