{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T07:53:47Z","timestamp":1672991627945},"reference-count":9,"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)90011-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:41:31Z","timestamp":1027654891000},"page":"235-246","source":"Crossref","is-referenced-by-count":6,"title":["Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection"],"prefix":"10.1016","volume":"3","author":[{"given":"K.","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Welzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90011-T_BIB1","author":"Alon","year":"1991"},{"key":"10.1016\/0925-7721(93)90011-T_BIB2","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)90011-T_BIB3","first-page":"463","article-title":"Four results on randomized incremental constructions","volume":"Vol. 577","author":"Clarkson","year":"1992","journal-title":"Symposium on Theoretical Aspects of Computer Science"},{"key":"10.1016\/0925-7721(93)90011-T_BIB4","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)90011-T_BIB5","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/BF02187744","article-title":"On the general motion planning problem with two degrees of freedom","volume":"4","author":"Guibas","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90011-T_BIB6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0925-7721(93)90011-T_BIB7","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/3-540-55719-9_94","article-title":"A tail estimate for Mulmuley's segment intersection algorithm","author":"Matou\u0161ek","year":"1992","journal-title":"Proc. 19th Int. Colloq. Automata, Languages and Programming"},{"key":"10.1016\/0925-7721(93)90011-T_BIB8","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/SFCS.1988.21974","article-title":"A fast planar partition algorithm, I","author":"Mulmuley","year":"1988","journal-title":"Proc. 29th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(93)90011-T_BIB9","doi-asserted-by":"crossref","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."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390011T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390011T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:56:37Z","timestamp":1580900197000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219390011T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["092577219390011T"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90011-t","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}