{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:49Z","timestamp":1763467489750},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":7382,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/0304-3975(93)90024-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"339-354","source":"Crossref","is-referenced-by-count":49,"title":["On the randomized construction of the Delaunay tree"],"prefix":"10.1016","volume":"112","author":[{"given":"Jean-Daniel","family":"Boissonnat","sequence":"first","affiliation":[]},{"given":"Monique","family":"Teillaud","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90024-N_BIB1","series-title":"Computational Geometry","first-page":"153","article-title":"Practical use of bucketing techniques in computational geometry","author":"Asano","year":"1985"},{"key":"10.1016\/0304-3975(93)90024-N_BIB2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Vorono\u00ef diagrams \u2014 a survey of a fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(93)90024-N_BIB3","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\/0304-3975(93)90024-N_BIB4_1","article-title":"A semi-dynamic construction of higher order Vorono\u00ef diagrams and its randomized analysis","author":"Boissonnat","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(93)90024-N_BIB4_2","first-page":"278","article-title":"Tech. Report INRIA 1207","author":"Boissonnat","year":"1990","journal-title":"2nd Canadian Conf. on Computational Geometry"},{"key":"10.1016\/0304-3975(93)90024-N_BIB5","series-title":"2nd ACM Symp. on Computational Geometry","first-page":"260","article-title":"A hierarchical representation of objects: the Delaunay tree","author":"Boissonnat","year":"1986"},{"issue":"2","key":"10.1016\/0304-3975(93)90024-N_BIB6","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1093\/comjnl\/24.2.162","article-title":"Computing Dirichlet tesselations","volume":"24","author":"Bowyer","year":"1981","journal-title":"Comput. J."},{"issue":"5","key":"10.1016\/0304-3975(93)90024-N_BIB7","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\/0304-3975(93)90024-N_BIB8","series-title":"Computational Geometry Theory and Applications","article-title":"Fully dynamic Delaunay triangulation in logarithmic expected time per operation","volume":"Vol. 519","author":"Devillers","year":"1991"},{"key":"10.1016\/0304-3975(93)90024-N_BIB9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02574694","article-title":"Higher-dimensional Vorono\u00ef diagrams in linear expected time","volume":"6","author":"Dwyer","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0304-3975(93)90024-N_BIB10","series-title":"Algorithms on Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0304-3975(93)90024-N_BIB11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Vorono\u00ef diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(93)90024-N_BIB12","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1093\/comjnl\/21.2.168","article-title":"Computing Dirichlet tesselations in the plane","volume":"21","author":"Green","year":"1978","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(93)90024-N_BIB13","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01758770","article-title":"Randomized incremental construction of Delaunay and Vorono\u00ef diagrams","volume":"7","author":"Guibas","year":"1992","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/0304-3975(93)90024-N_BIB14","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 Vorono\u00ef diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0304-3975(93)90024-N_BIB15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01224932","article-title":"On the complexity of d-dimensional Vorono\u00ef diagrams","volume":"34","author":"Klee","year":"1980","journal-title":"Arch. Math."},{"key":"10.1016\/0304-3975(93)90024-N_BIB16","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1982.1676031","article-title":"On k-nearest neighbor Vorono\u00ef diagrams in the plane","volume":"C-31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0304-3975(93)90024-N_BIB17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","article-title":"Two algorithms for constructing a Delaunay triangulation","volume":"9","author":"Lee","year":"1980","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0304-3975(93)90024-N_BIB18","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02574686","article-title":"On the construction of abstract Vorono\u00ef diagrams","volume":"6","author":"Mehlhorn","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0304-3975(93)90024-N_BIB19","series-title":"Proc. IEEE Symp. on Foundations of Computer Science","first-page":"592","article-title":"On obstruction in relation to a fixed viewpoint","author":"Mulmuley","year":"1989"},{"key":"10.1016\/0304-3975(93)90024-N_BIB20","series-title":"Ph.D. Thesis","article-title":"Konvexe Polytope und Dirichletsche Zellenkomplexe","author":"Paschinger","year":"1982"},{"issue":"20","key":"10.1016\/0304-3975(93)90024-N_BIB21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"2","author":"Preparata","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(93)90024-N_BIB22","series-title":"Computational Geometry: an Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0304-3975(93)90024-N_BIB23","series-title":"Packing and Covering","author":"Rogers","year":"1964"},{"key":"10.1016\/0304-3975(93)90024-N_BIB24","series-title":"Tech. Report 14","article-title":"A convex hull algorithm optimal for point sites in even dimensions","author":"Seidel","year":"1981"},{"key":"10.1016\/0304-3975(93)90024-N_BIB25","first-page":"94","article-title":"The complexity of Vorono\u00ef diagrams in higher dimensions","author":"Seidel","year":"1982","journal-title":"Proc. 20th Ann. Allerton Conf. on Communication, Control, Computing"},{"key":"10.1016\/0304-3975(93)90024-N_BIB26","series-title":"Ph.D. Thesis","article-title":"Computational geometry","author":"Shamos","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390024N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390024N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:22:37Z","timestamp":1555114957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390024N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["030439759390024N"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90024-n","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}