{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:55:47Z","timestamp":1787500547012,"version":"3.56.0"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1996,6]]},"abstract":"<jats:p>\n                    The task of finding the largest empty ellipsoid defined by a set of n point sites in R\n                    <jats:sup>d<\/jats:sup>\n                    is investigated. It is shown that this can be solved by enumerating the facets of the convex hull of the sites projected onto a manifold in R\n                    <jats:sup>[d(d+3)\/2]<\/jats:sup>\n                    . While O(n\n                    <jats:sup>[d(d+3)\/4]<\/jats:sup>\n                    ) time is required in the worst case, it is found that O(n\n                    <jats:sup>d<\/jats:sup>\n                    ) suffices on average for independent uniform points when d is fixed and n increases without bound. The effects on the running time caused by imposing certain restrictions on the orientation and shape of the ellipsoid are also described. Applications to motion planning and design centering are considered briefly.\n                  <\/jats:p>","DOI":"10.1142\/s0218195996000125","type":"journal-article","created":{"date-parts":[[2004,9,6]],"date-time":"2004-09-06T07:50:09Z","timestamp":1094457009000},"page":"169-185","source":"Crossref","is-referenced-by-count":1,"title":["MAXIMAL EMPTY ELLIPSOIDS"],"prefix":"10.1142","volume":"06","author":[{"given":"REX A.","family":"DWYER","sequence":"first","affiliation":[{"name":"Computer Science Department, North Carolina State University, Raleigh, NC 27695\u20138206, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"WILLIAM F.","family":"EDDY","sequence":"additional","affiliation":[{"name":"Statistics Department, Carnegie-Mellon University, Pittsburgh, PA 15213, 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\/S0218195996000125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:31:08Z","timestamp":1565123468000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195996000125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1996,6]]}},"alternative-id":["10.1142\/S0218195996000125"],"URL":"https:\/\/doi.org\/10.1142\/s0218195996000125","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}