{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T00:53:59Z","timestamp":1673139239448},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2002,12]]},"abstract":"<jats:p> Given a finite set of points [Formula: see text] in \u211d<jats:sup>d<\/jats:sup>, the diameter of [Formula: see text] is defined as the maximum distance between two points of [Formula: see text]. We propose a very simple algorithm to compute the diameter of a finite set of points. Although the algorithm is not worst-case optimal, an extensive experimental study has shown that it is extremely fast for a large variety of point distributions. In addition, we propose a comparison with the recent approach of Har-Peled<jats:sup>5<\/jats:sup> and derive hybrid algorithms to combine advantages of both approaches. <\/jats:p>","DOI":"10.1142\/s0218195902001006","type":"journal-article","created":{"date-parts":[[2003,2,5]],"date-time":"2003-02-05T06:21:29Z","timestamp":1044426089000},"page":"489-509","source":"Crossref","is-referenced-by-count":15,"title":["COMPUTING THE DIAMETER OF A POINT SET"],"prefix":"10.1142","volume":"12","author":[{"given":"GR\u00c9GOIRE","family":"MALANDAIN","sequence":"first","affiliation":[{"name":"Epidaure team, INRIA, 2004 route des lucioles  BP 93, 06 902 Sophia-Antipolis Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JEAN-DANIEL","family":"BOISSONNAT","sequence":"additional","affiliation":[{"name":"Prisme team, INRIA, 2004 route des lucioles  BP 93, 06 902 Sophia-Antipolis Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365724"},{"key":"p_2","first-page":"137","author":"Bespamyatnikh S.","year":"1998","journal-title":"Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms"},{"key":"p_3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-44679-6_18","volume":"2108","author":"Cheong Otfried","year":"2001","journal-title":"Proc. 7th. Annu. Int. Comput. and Combinat. Conf."},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187740"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(96)00010-7"},{"key":"p_9","first-page":"57","author":"Ramos E.","year":"1997","journal-title":"Proc. 13th Annu. ACM Sympos. Comput. Geom."},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-001-0029-8"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1137\/0211059"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195902001006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:27:58Z","timestamp":1565137678000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195902001006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":8,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,12]]}},"alternative-id":["10.1142\/S0218195902001006"],"URL":"https:\/\/doi.org\/10.1142\/s0218195902001006","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}