{"year":"1989","volume":96,"date_published":"1989-01-01T00:00:00Z","oa_version":"None","publist_id":"2042","citation":{"apa":"Edelsbrunner, H., &#38; Skiena, S. (1989). On the number of furthest neighbor pairs in a point set. <i>American Mathematical Monthly</i>. Mathematical Association of America. <a href=\"https://doi.org/10.1080/00029890.1989.11972250\">https://doi.org/10.1080/00029890.1989.11972250</a>","chicago":"Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” <i>American Mathematical Monthly</i>. Mathematical Association of America, 1989. <a href=\"https://doi.org/10.1080/00029890.1989.11972250\">https://doi.org/10.1080/00029890.1989.11972250</a>.","ama":"Edelsbrunner H, Skiena S. On the number of furthest neighbor pairs in a point set. <i>American Mathematical Monthly</i>. 1989;96(7):614-618. doi:<a href=\"https://doi.org/10.1080/00029890.1989.11972250\">10.1080/00029890.1989.11972250</a>","ista":"Edelsbrunner H, Skiena S. 1989. On the number of furthest neighbor pairs in a point set. American Mathematical Monthly. 96(7), 614–618.","ieee":"H. Edelsbrunner and S. Skiena, “On the number of furthest neighbor pairs in a point set,” <i>American Mathematical Monthly</i>, vol. 96, no. 7. Mathematical Association of America, pp. 614–618, 1989.","short":"H. Edelsbrunner, S. Skiena, American Mathematical Monthly 96 (1989) 614–618.","mla":"Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” <i>American Mathematical Monthly</i>, vol. 96, no. 7, Mathematical Association of America, 1989, pp. 614–18, doi:<a href=\"https://doi.org/10.1080/00029890.1989.11972250\">10.1080/00029890.1989.11972250</a>."},"language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","date_updated":"2022-02-11T12:59:01Z","publication":"American Mathematical Monthly","publisher":"Mathematical Association of America","status":"public","day":"01","quality_controlled":"1","intvolume":"        96","extern":"1","acknowledgement":"Research supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"full_name":"Skiena, Steven","last_name":"Skiena","first_name":"Steven"}],"publication_identifier":{"eissn":["1930-0972"],"issn":["0002-9890"]},"_id":"4079","date_created":"2018-12-11T12:06:49Z","issue":"7","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"01","title":"On the number of furthest neighbor pairs in a point set","doi":"10.1080/00029890.1989.11972250","page":"614 - 618","article_processing_charge":"No","publication_status":"published","main_file_link":[{"url":"http://www.jstor.org/stable/2325182 "}]}