{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T10:32:28Z","timestamp":1673692348763},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T00:00:00Z","timestamp":1294272000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00454-010-9324-6","type":"journal-article","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T10:03:10Z","timestamp":1294221790000},"page":"371-382","source":"Crossref","is-referenced-by-count":2,"title":["The Overlay of Minimization Diagrams in\u00a0a\u00a0Randomized Incremental Construction"],"prefix":"10.1007","volume":"45","author":[{"given":"Haim","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Ramos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,6]]},"reference":[{"key":"9324_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00454-009-9177-z","volume":"42","author":"P. Afshani","year":"2009","unstructured":"Afshani, P., Chan, T.M.: On approximate range counting and depth. Discrete Comput. Geom. 42, 3\u201321 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"9324_CR2","first-page":"107","volume-title":"Proc. 9th Annu. ACM-SIAM Sympos. Discrete Algo","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Erickson, J., Guibas, L.: Kinetic binary space partitions for intersecting segments and disjoint triangles. In: Proc. 9th Annu. ACM-SIAM Sympos. Discrete Algo, pp. 107\u2013116 (1998)"},{"key":"9324_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0925-7721(00)00005-5","volume":"16","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Guibas, L.J., Murali, T.M., Vitter, J.S.: Cylindrical static and kinetic binary space partitions. Comput. Geom. Theory Appl. 16, 103\u2013127 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9324_CR4","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1137\/060669474","volume":"38","author":"B. Aronov","year":"2008","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SIAM J. Comput. 38, 899\u2013921 (2008)","journal-title":"SIAM J. Comput."},{"key":"9324_CR5","first-page":"327","volume-title":"Proc. 23rd Annu. ACM Sympos. on Comput. Geom.","author":"B. Aronov","year":"2007","unstructured":"Aronov, B., Har-Peled, S., Sharir, M.: On approximate halfspace range counting and relative epsilon approximations. In: Proc. 23rd Annu. ACM Sympos. on Comput. Geom., pp. 327\u2013336 (2007)"},{"key":"9324_CR6","doi-asserted-by":"crossref","first-page":"2704","DOI":"10.1137\/080736600","volume":"39","author":"B. Aronov","year":"2010","unstructured":"Aronov, B., Sharir, M.: Approximate halfspace range counting. SIAM J. Comput. 39, 2704\u20132725 (2010)","journal-title":"SIAM J. Comput."},{"key":"9324_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"9324_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172998","volume-title":"Algorithmic Geometry","author":"J.-D. Boissonnat","year":"1998","unstructured":"Boissonnat, J.-D., Yvinec, M.: Algorithmic Geometry (English edn.). Cambridge University Press, Cambridge (1998)"},{"key":"9324_CR9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K. Clarkson","year":"1989","unstructured":"Clarkson, K., Shor, P.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4, 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9324_CR10","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci. 55, 441\u2013453 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"9324_CR11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","volume":"1","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Seidel, R.: Voronoi diagrams and arrangements. Discrete Comput. Geom. 1, 25\u201344 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9324_CR12","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"L. Guibas","year":"1992","unstructured":"Guibas, L., Knuth, D.E., Sharir, M.: Randomized incremental construction of Voronoi and Delaunay diagrams. Algorithmica 7, 381\u2013413 (1992)","journal-title":"Algorithmica"},{"key":"9324_CR13","doi-asserted-by":"crossref","first-page":"2016","DOI":"10.1137\/S0097539799350232","volume":"29","author":"S. Har-Peled","year":"2000","unstructured":"Har-Peled, S.: Constructing planar cuttings in theory and practice. SIAM J. Comput. 29, 2016\u20132039 (2000)","journal-title":"SIAM J. Comput."},{"key":"9324_CR14","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Ramos, E., Sharir, M.: Range minima queries with respect to a random permutation, and approximate range counting. Discrete Comput. Geom. (in press); published online November 11, 2010. doi: 10.1007\/s00454-010-9308-6","DOI":"10.1007\/s00454-010-9308-6"},{"key":"9324_CR15","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/1109557.1109611","volume-title":"Proc. 17th Annu. ACM-SIAM Sympos. Discrete Algo","author":"H. Kaplan","year":"2006","unstructured":"Kaplan, H., Sharir, M.: Randomized incremental constructions of three-dimensional convex hulls and planar Voronoi diagrams, and approximate range counting. In: Proc. 17th Annu. ACM-SIAM Sympos. Discrete Algo, pp. 484\u2013493 (2006)"},{"key":"9324_CR16","volume-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport\u2013Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York (1995)"},{"key":"9324_CR17","series-title":"Graduate Texts in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G. Ziegler","year":"1995","unstructured":"Ziegler, G.: Lectures on Polytopes, Graduate Texts in Math., vol.\u00a0152. Springer, New York (1995)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-010-9324-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-010-9324-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-010-9324-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T11:58:31Z","timestamp":1559908711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-010-9324-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,6]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9324"],"URL":"https:\/\/doi.org\/10.1007\/s00454-010-9324-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,6]]}}}