{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:03:18Z","timestamp":1742378598004},"reference-count":21,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":7259,"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,9]]},"DOI":"10.1016\/0925-7721(93)90009-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:41:31Z","timestamp":1027654891000},"page":"185-212","source":"Crossref","is-referenced-by-count":97,"title":["Four results on randomized incremental constructions"],"prefix":"10.1016","volume":"3","author":[{"given":"Kenneth L.","family":"Clarkson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raimund","family":"Seidel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90009-U_BIB1","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":"J. Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90009-U_BIB2","first-page":"441","article-title":"Computing a face in an arrangement of line segments","author":"Chazelle","year":"1991","journal-title":"2nd Ann. ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0925-7721(93)90009-U_BIB3","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry, II","author":"Clarkson","year":"1989","journal-title":"J. Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90009-U_BIB4","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1142\/S021819599200007X","article-title":"Randomization yields simple O(n log*n) algorithms for difficult \u03c9(n) problems","volume":"2","author":"Devillers","year":"1992","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0925-7721(93)90009-U_BIB5","first-page":"524","article-title":"Dynamic perfect hashing - upper and lower bounds","author":"Dietzfelbinger","year":"1988","journal-title":"IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(93)90009-U_BIB6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0925-7721(92)90025-N","article-title":"Fully dynamic Delaunay triangulation in logarithmic expected time per operation","volume":"2","author":"Devillers","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0925-7721(93)90009-U_BIB7","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0925-7721(93)90009-U_BIB8","doi-asserted-by":"crossref","first-page":"413","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)90009-U_BIB9","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0925-7721(93)90009-U_BIB10","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)90009-U_BIB11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(90)90022-P","article-title":"Bounded ordered dictionaries in O(log log n) time and O(n) space","volume":"35","author":"Mehlhorn","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(93)90009-U_BIB12","first-page":"580","article-title":"A fast planar partition algorithm","author":"Mulmuley","year":"1988","journal-title":"I. Proc. of the 29th FOCS"},{"key":"10.1016\/0925-7721(93)90009-U_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/109648.109662","article-title":"Randomized multidimensional search trees: dynamic sampling","author":"Mulmuley","year":"1991","journal-title":"Proc. ACM Symposium on Computational Geometry"},{"key":"10.1016\/0925-7721(93)90009-U_BIB14","first-page":"216","article-title":"Randomized multidimensional search trees: further results in dynamic sampling","author":"Mulmuley","year":"1991","journal-title":"32nd IEEE FOCS"},{"key":"10.1016\/0925-7721(93)90009-U_BIB15","first-page":"180","article-title":"Randomized multidimensional search trees: Lazy balancing and dynamic shuffling","author":"Mulmuley","year":"1991","journal-title":"32nd IEEE FOCS"},{"key":"10.1016\/0925-7721(93)90009-U_BIB16","first-page":"197","article-title":"Dynamic maintenance of geometric structures made easy","author":"Schwarzkopf","year":"1991","journal-title":"32nd IEEE FOCS"},{"key":"10.1016\/0925-7721(93)90009-U_BIB17","unstructured":"O. Schwarzkopf, Dynamic maintenance of convex polytopes and related structures, Ph.D. Dissertation, Free University Berlin, 2992."},{"key":"10.1016\/0925-7721(93)90009-U_BIB18","first-page":"211","article-title":"Linear programming and convex hulls made easy","author":"Seidel","year":"1990","journal-title":"Proc. 6th Ann. ACM Symp. Computational Geometry"},{"key":"10.1016\/0925-7721(93)90009-U_BIB19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0925-7721(91)90012-4","article-title":"A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons","volume":"1","author":"Seidel","year":"1991","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0925-7721(93)90009-U_BIB20","first-page":"76","article-title":"Oriented projective geometry","author":"Stolfi","year":"1987","journal-title":"Proceedings of the 3rd Annual ACM Symp. on Computational Geometry"},{"key":"10.1016\/0925-7721(93)90009-U_BIB21","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:092577219390009U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390009U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T15:47:08Z","timestamp":1681832828000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219390009U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["092577219390009U"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90009-u","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}