{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T06:35:22Z","timestamp":1720679722073},"reference-count":37,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"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":4672,"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":[[2000,10]]},"DOI":"10.1016\/s0925-7721(00)00017-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:16:12Z","timestamp":1027617372000},"page":"69-96","source":"Crossref","is-referenced-by-count":13,"title":["A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case"],"prefix":"10.1016","volume":"17","author":[{"given":"C.","family":"Lemaire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-M.","family":"Moreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(00)00017-1_BIB001","series-title":"Construction des diagrammes de Delaunay dans le plan et dans l'espace","author":"Adam","year":"1996"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB002","series-title":"Quatri\u00e8mes Journ\u00e9es de l'AFIG, Dijon, France","first-page":"215","article-title":"Construction du diagramme de Delaunay dans le plan en utilisant les m\u00e9langes de tris","author":"Adam","year":"1996"},{"issue":"3","key":"10.1016\/S0925-7721(00)00017-1_BIB003","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi diagrams \u2013 a survey of a fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB004","series-title":"Proc. of 11th IEEE Symposium on Computer Arithmetic, Windsor, Ontario","first-page":"242","article-title":"A lazy arithmetic library","author":"Benouamer","year":"1993"},{"issue":"9","key":"10.1016\/S0925-7721(00)00017-1_BIB005","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multi-dimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB006","series-title":"G\u00e9om\u00e9trie, 3. Convexes et polytopes poly\u00e8dres r\u00e9guliers, aires et volumes","author":"Berger","year":"1974"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB007","series-title":"Geometry, Vols. 1\u20132","author":"Berger","year":"1987"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB008","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1142\/S0218195991000074","article-title":"The expected extremes in a Delaunay triangulation","volume":"1","author":"Bern","year":"1991","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(00)00017-1_BIB009","series-title":"Proc. of Computational Geometry and its Applications","first-page":"113","article-title":"A divide-and-conquer algorithm for computing 4-dimensional convex hulls","volume":"333","author":"Buckley","year":"1988"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB010","series-title":"Proc. of 11th Annu. ACM Symposium on Computational Geometry","first-page":"C18","article-title":"Exact geometric computation in LEDA","author":"Burnikel","year":"1995"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB011","series-title":"Dewall: a fast divide-and-conquer Delaunay triangulation algorithm in Ed, Technical Report 95-22","author":"Cignoni","year":"1995"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB012","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB013","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01840356","article-title":"A faster divide-and-conquer algorithm for constructing Delaunay triangulations","volume":"2","author":"Dwyer","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB014","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02574694","article-title":"Higher-dimensional Voronoi diagrams in linear expected time","volume":"6","author":"Dwyer","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(00)00017-1_BIB015","series-title":"Algorithms in Combinatorial Geometry","volume":"10","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB016","series-title":"Les diagrammes de Voronoi et de Delaunay dans le plan et dans l'espace","author":"Elbaz","year":"1992"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB017","series-title":"On the design of CGAL, the computational geometry algorithms library, Technical Report MPI-I-98-007","author":"Fabri","year":"1998"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB018","series-title":"Proc. of 9th ACM Symposium on Computational Geometry, San Diego, CA","first-page":"163","article-title":"Efficient exact arithmetic for computational geometry","author":"Fortune","year":"1993"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB019","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding best matches in logarithmic expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB020","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\/S0925-7721(00)00017-1_BIB021","first-page":"306","article-title":"Improvements of the incremental method for the Voronoi diagram with computational comparison of various algorithms","volume":"27","author":"Iri","year":"1984","journal-title":"J. Oper. Res. Soc. Japan"},{"issue":"3","key":"10.1016\/S0925-7721(00)00017-1_BIB022","first-page":"275","article-title":"Constructing Delaunay triangulations by merging buckets in quadtree order","volume":"11","author":"Katajainen","year":"1988","journal-title":"Ann. Soc. Math. Polon. Ser. IV Fund. Inform."},{"key":"10.1016\/S0925-7721(00)00017-1_BIB023","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\/S0925-7721(00)00017-1_BIB024","series-title":"Triangulation de Delaunay et arbres multidimensionnels","author":"Lemaire","year":"1997"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB025","series-title":"Triangulation de Delaunay euclidienne dans le plan: optimisation du divide and conquer \u00e0 l'aide d'un tri selon deux directions, Technical Report 02D07669","author":"Lemaire","year":"1996"},{"issue":"4","key":"10.1016\/S0925-7721(00)00017-1_BIB026","first-page":"317","article-title":"Am\u00e9lioration de la complexit\u00e9 en moyenne de l'algorithme de Lee et Schachter par division et fusion bi-directionnelles","volume":"12","author":"Lemaire","year":"1997","journal-title":"Revue Internationale de CFAO et d'Informatique Graphique"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB027","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01937482","article-title":"Delaunay triangulation and the convex hull of n points in expected linear time","volume":"24","author":"Maus","year":"1984","journal-title":"BIT"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB028","series-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"Mehlhorn","year":"1999"},{"issue":"9","key":"10.1016\/S0925-7721(00)00017-1_BIB029","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1109\/12.620478","article-title":"Lazy arithmetic","volume":"46","author":"Michelucci","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0925-7721(00)00017-1_BIB030","series-title":"Proc. of 1st ACM Workshop on Applied and Computational Geometry","first-page":"113","article-title":"Designing the computational geometry algorithms library CGAL","volume":"1148","author":"Overmars","year":"1996"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB031","series-title":"Proc. of 16th Annu. IEEE Symposium on Foundations of Computer Science","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB032","series-title":"Proc. of 1st ACM Workshop on Applied and Computational Geometry","first-page":"124","article-title":"Triangle: engineering a 2d quality mesh generator and Delaunay triangulator","volume":"1148","author":"Shewchuck","year":"1996"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB033","series-title":"Proc. of 12th ACM Annu. Symposium on Computational Geometry","first-page":"141","article-title":"Robust adaptive floating-point geometric predicates","author":"Shewchuk","year":"1996"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB034","series-title":"Adaptive precision floating-point arithmetic and fast robust geometric predicates, Technical Report CMU-CS-96-140","author":"Shewchuk","year":"1996"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB035","series-title":"Proc. of 11th Annu. ACM Symposium on Computational Geometry","first-page":"61","article-title":"A comparison of sequential Delaunay triangulation algorithms","author":"Su","year":"1995"},{"key":"10.1016\/S0925-7721(00)00017-1_BIB036","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0925-7721(96)00025-9","article-title":"A comparison of sequential Delaunay triangulation algorithms","volume":"7","author":"Su","year":"1997","journal-title":"Computational Geometry"},{"issue":"9","key":"10.1016\/S0925-7721(00)00017-1_BIB037","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1109\/5.163412","article-title":"Construction of the Voronoi diagram for \u2018one million\u2019 generators in single-precision arithmetic","volume":"80","author":"Sugihara","year":"1992","journal-title":"Proc. of the IEEE"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772100000171?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772100000171?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T03:50:09Z","timestamp":1556164209000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772100000171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0925772100000171"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(00)00017-1","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}