{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T07:55:33Z","timestamp":1767167733886,"version":"build-2238731810"},"reference-count":14,"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":[[2000,2]]},"abstract":"<jats:p>\n                    A circle C separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An \u0398(n log n) optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowed to meet only at their endpoints. In the general case, when line segments may intersect \u03a9(n\n                    <jats:sup>2<\/jats:sup>\n                    ) times, our algorithm can be adapted to work in O(n\u03b1(n) log n) time and O (n\u03b1(n)) space, where \u03b1(n) represents the extremely slowly growing inverse of the Ackermann function.\n                  <\/jats:p>","DOI":"10.1142\/s0218195900000036","type":"journal-article","created":{"date-parts":[[2003,5,7]],"date-time":"2003-05-07T04:18:55Z","timestamp":1052281135000},"page":"41-53","source":"Crossref","is-referenced-by-count":13,"title":["COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS"],"prefix":"10.1142","volume":"10","author":[{"given":"JEAN-DANIEL","family":"BOISSONNAT","sequence":"first","affiliation":[{"name":"INRIA, B.P. 93, 06902 Sophia-Antipolis cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JUREK","family":"CZYZOWICZ","sequence":"additional","affiliation":[{"name":"D\u00e9partement d'informatique, Universit\u00e9 du Qu\u00e9bec \u00e0 Hull, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"OLIVIER","family":"DEVILLERS","sequence":"additional","affiliation":[{"name":"INRIA, B.P. 93, 06902 Sophia-Antipolis cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JORGE","family":"URRUTIA","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Ottawa, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARIETTE","family":"YVINEC","sequence":"additional","affiliation":[{"name":"INRIA and Laboratoire I3S, URA CNRS 1376, 250 rue Albert Einstein, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90049-7"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02570718"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1137\/0222077"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02570705"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90007-0"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187785"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90049-1"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1986.4767821"},{"key":"p_12","volume":"639","author":"Kim C. E.","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell, PAMI-6(5)"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1137\/0210006"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3838"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1145\/2422.322418"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00006-U"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187688"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195900000036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T08:29:49Z","timestamp":1565080189000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195900000036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":14,"aliases":["10.1016\/s0218-1959(00)00003-6"],"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,2]]}},"alternative-id":["10.1142\/S0218195900000036"],"URL":"https:\/\/doi.org\/10.1142\/s0218195900000036","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}