{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:17:58Z","timestamp":1787509078384,"version":"build-2736575974"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1992,3]]},"abstract":"<jats:p>\n                    A set of n distinct points in the plane defines [Formula: see text] lines by joining each pair of distinct points. The median slope of these O(n\n                    <jats:sup>2<\/jats:sup>\n                    ) lines was proposed by Theil as a robust estimator for the slope of the line of best fit for the points. We present a randomized algorithm for selecting the k-th smallest slope of such a set of lines which runs in expected O(n log n) time. An efficient implementation of the algorithm and practical experience with the algorithm are discussed.\n                  <\/jats:p>","DOI":"10.1142\/s0218195992000020","type":"journal-article","created":{"date-parts":[[2004,11,24]],"date-time":"2004-11-24T19:50:24Z","timestamp":1101325824000},"page":"1-27","source":"Crossref","is-referenced-by-count":35,"title":["A RANDOMIZED ALGORITHM FOR SLOPE SELECTION"],"prefix":"10.1142","volume":"02","author":[{"given":"MICHAEL B.","family":"DILLENCOURT","sequence":"first","affiliation":[{"name":"Information and Computer Science Department, University of California, Irvine, California 92717-3425, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"DAVID M.","family":"MOUNT","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"NATHAN S.","family":"NETANYAHU","sequence":"additional","affiliation":[{"name":"Computer Vision Laboratory, Center for Automation Research, University of Maryland, College Park, Maryland 20742, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195992000020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:57:45Z","timestamp":1565121465000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195992000020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1992,3]]}},"alternative-id":["10.1142\/S0218195992000020"],"URL":"https:\/\/doi.org\/10.1142\/s0218195992000020","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}