{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:30:58Z","timestamp":1760819458060},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":7594,"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":[[1992,10]]},"DOI":"10.1016\/0925-7721(92)90025-n","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"55-80","source":"Crossref","is-referenced-by-count":42,"title":["Fully dynamic delaunay triangulation in logarithmic expected time per operation"],"prefix":"10.1016","volume":"2","author":[{"given":"Olivier","family":"Devillers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Meiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monique","family":"Teillaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(92)90025-N_BIB1","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/BF02187749","article-title":"A linear time algorithm for computing the Vorono\u00ef diagram of a convex polygon","volume":"4","author":"Aggarwal","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(92)90025-N_BIB2","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0925-7721(92)90025-N_BIB3","first-page":"142","article-title":"A simple on-line Randomized incremental algorithm for computing higher order Vorono\u00ef diagrams","author":"Aurenhammer","year":"1991"},{"key":"#cr-split#-10.1016\/0925-7721(92)90025-N_BIB4.2","unstructured":"Available as Technical Report INRIA 1285, Abstract published in IMACS 91 in Dublin."},{"key":"#cr-split#-10.1016\/0925-7721(92)90025-N_BIB5.1","unstructured":"J.D. Boissonnat, O. Devillers and M. Teillaud, A semi-dynamic construction of higher order Vorono\u00ef diagrams and its randomized analysis, Algorithmica, to appear;"},{"key":"#cr-split#-10.1016\/0925-7721(92)90025-N_BIB5.2","unstructured":"Available as Technical Report INRIA 1207, Abstract published in Second Canadian Conference on Computational Geometry 1990 in Ottawa."},{"key":"10.1016\/0925-7721(92)90025-N_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/10515.10543","article-title":"A hierarchical representation of objects: the Delaunay Tree","author":"Boissonnat","year":"1986","journal-title":"Second ACM Symposium on Computational Geometry in Yorktown Heights"},{"key":"#cr-split#-10.1016\/0925-7721(92)90025-N_BIB7.2","unstructured":"Available as Technical Report INRIA 1140."},{"key":"10.1016\/0925-7721(92)90025-N_BIB8","first-page":"463","article-title":"Four results on randomized incremental algorithms","volume":"577","author":"Clarkson","year":"1992"},{"issue":"5","key":"10.1016\/0925-7721(92)90025-N_BIB9","doi-asserted-by":"crossref","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(92)90025-N_BIB10","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\/0925-7721(92)90025-N_BIB11","doi-asserted-by":"crossref","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":"#cr-split#-10.1016\/0925-7721(92)90025-N_BIB12.2","unstructured":"Abstract published in LNCS 443 (ICALP 90)."},{"issue":"2","key":"10.1016\/0925-7721(92)90025-N_BIB13","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 Transactions on Graphics"},{"issue":"3","key":"10.1016\/0925-7721(92)90025-N_BIB14","doi-asserted-by":"crossref","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\/0925-7721(92)90025-N_BIB15","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\/0925-7721(92)90025-N_BIB16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02574692","article-title":"On levels in arrangements and Vorono\u00ef diagrams","volume":"6","author":"Mulmuley","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(92)90025-N_BIB17","first-page":"121","article-title":"Randomized multidimensional search trees: dynamic sampling","author":"Mulmuley","year":"1991","journal-title":"7th ACM Symposium on Computational Geometry in North Conway"},{"key":"10.1016\/0925-7721(92)90025-N_BIB18","first-page":"132","article-title":"Dynamic point location in arrangements of hyperplanes","author":"Mulmuley","year":"1991","journal-title":"7th ACM Symposium on Computational Geometry in North Conway"},{"key":"10.1016\/0925-7721(92)90025-N_BIB19","article-title":"The Design of Dynamic Data Structures","volume":"156","author":"Overmars","year":"1983"},{"key":"10.1016\/0925-7721(92)90025-N_BIB20","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(92)90025-N_BIB21","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1991.185369","article-title":"Dynamic maintenance of geometric structure made easy","author":"Schwarzkopf","year":"1991"},{"key":"10.1016\/0925-7721(92)90025-N_BIB22","author":"Seidel","year":"1991","journal-title":"Backwards analysis of randomized geometric algorithms"},{"key":"10.1016\/0925-7721(92)90025-N_BIB23","article-title":"Computational Geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/0925-7721(92)90025-N_BIB24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"Emde Boas","year":"1977","journal-title":"Math. Systems Theory"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219290025N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219290025N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,23]],"date-time":"2023-04-23T21:50:10Z","timestamp":1682286610000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219290025N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["092577219290025N"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(92)90025-n","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}