{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:42:47Z","timestamp":1648831367756},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1987,11]]},"DOI":"10.1007\/bf01840354","type":"journal-article","created":{"date-parts":[[2005,6,29]],"date-time":"2005-06-29T03:41:00Z","timestamp":1120016460000},"page":"131-134","source":"Crossref","is-referenced-by-count":2,"title":["Some problems in computational geometry"],"prefix":"10.1007","volume":"2","author":[{"given":"Claire","family":"Mathieu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01840354_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(78)90051-0","volume":"7","author":"J. L. Bentley","year":"1978","unstructured":"J. L. Bentley and M. I. Shamos, Divide-and-conquer for linear expected time,Inform. Process. Lett.,7, (1978), 87\u201391.","journal-title":"Inform. Process. Lett."},{"key":"BF01840354_CR2","doi-asserted-by":"crossref","unstructured":"J. L. Bentley and M. I. Shamos, Divide-and-conquer in multidemensional space,Eighth Annual ACM Symposium on Computing, 1976, pp. 220\u2013230.","DOI":"10.1145\/800113.803652"},{"key":"BF01840354_CR3","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley, B. W. Weide, and A. C. Yao, Optimal expected-time algorithms for closest-point problems,ACM Trans. Math. Software,6 (1980), 563\u2013580.","journal-title":"ACM Trans. Math. Software"},{"key":"BF01840354_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0215021","volume":"15","author":"D. G. Kirkpatrick","year":"1986","unstructured":"D. G. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm?SIAM J. Comput.,15 (1986), 287\u2013299.","journal-title":"SIAM J. Comput."},{"key":"BF01840354_CR5","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","volume":"33","author":"D. T. Lee","year":"1984","unstructured":"D. T. Lee and F. P. Preparata, Computational geometry-a survey,IEEE Trans. Comput.,33 (1984), 1072\u20131101.","journal-title":"IEEE Trans. Comput."},{"key":"BF01840354_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00535300","volume":"2","author":"A. Renyi","year":"1963","unstructured":"A. Renyi and R. Sulanke, \u00dcber die konvexe H\u00fclle vonn zuf\u00e4llig gew\u00e4hlten Punkten,Z. Wahrsch. Verw. Gebiete,2 (1963), 75\u201384.","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"key":"BF01840354_CR7","volume-title":"Integral Geometry and Geometric Probability","author":"L. A. Santalo","year":"1976","unstructured":"L. A. Santalo,Integral Geometry and Geometric Probability, Addison-Wesley, Reading, MA, 1976."},{"key":"BF01840354_CR8","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey, Closest point problems,Proceedings of the 16th Annual IEEE Symposium on Foundations of Computing Science, 1975, pp. 151\u2013161.","DOI":"10.1109\/SFCS.1975.8"},{"key":"BF01840354_CR9","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A. C. Yao","year":"1982","unstructured":"A. C. Yao, On constructing minimum spanning trees ink-dimensional spaces and related problems,SIAM J. Comput.,11 (1982), 721\u2013736.","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840354.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840354\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T01:48:26Z","timestamp":1586310506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":9,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["BF01840354"],"URL":"https:\/\/doi.org\/10.1007\/bf01840354","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}