{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T09:49:57Z","timestamp":1782294597805,"version":"3.54.5"},"reference-count":16,"publisher":"University of Szeged","issue":"3","license":[{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Cybern"],"abstract":"<jats:p>Calculating directly the inner and outer approximation of the image of a set by a function can be challenging. Then, it is sometimes preferred to compute the image of the boundary of the set instead. However, boundary-based methods are subject to the apparition of fake boundaries in the image set. These fake boundaries add pessimism when characterizing the inner approximation of the image set. This paper then introduces the notion of Box Chains to simplify the detection and the suppression of the fake boundaries. The characterization of the inner and outer approximation of the image set in the case of a function from the unit disk D to R2 will be considered, with two examples.<\/jats:p>","DOI":"10.14232\/actacyb.314985","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T13:42:07Z","timestamp":1766410927000},"page":"453-473","source":"Crossref","is-referenced-by-count":0,"title":["Boundary Approach to Characterize the Inner and Outer Approximation of the Image of a Disk"],"prefix":"10.14232","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2822-6215","authenticated-orcid":false,"given":"Ma\u00ebl","family":"Godard","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/059n54003","id-type":"ROR","asserted-by":"publisher"}],"name":"ENSTA Bretagne"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0938-0615","authenticated-orcid":false,"given":"Luc","family":"Jaulin","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/059n54003","id-type":"ROR","asserted-by":"publisher"}],"name":"ENSTA Bretagne"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4485-8936","authenticated-orcid":false,"given":"Damien","family":"Mass\u00e9","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/0372th171","id-type":"ROR","asserted-by":"publisher"}],"name":"Universit\u00e9 de Bretagne Occidentale"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"5401","published-online":{"date-parts":[[2025,12,19]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2004.12.008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14232\/actacyb.314640"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2024.109162"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6943149"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2014-02877-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/01691864.2014.908742"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0249-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.1953.6371932"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6484-0_14"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2017.2705034"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14743-2_13"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.108614"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14232\/actacyb.302772"},{"key":"ref14","isbn-type":"print","volume-title":"Reliable Robot Localization: A Constraint-Programming Approach Over Dynamical Systems","author":"Rohou","year":"2020","unstructured":"Rohou, S., Jaulin, L., Mihaylova, L., Le Bars, F., and Veres, S.M. Reliable Robot Localization: A Constraint-Programming Approach Over Dynamical Systems. Wiley-ISTE, 1 edition, 2020. ISBN: 9781848219700,","ISBN":"https:\/\/id.crossref.org\/isbn\/9781848219700"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01419526"},{"key":"ref16","first-page":"137","article-title":"Avoiding fake boundaries in set interval computing","volume":"11","author":"Welte","year":"2017","unstructured":"Welte, A., Jaulin, L., Ceberio, M., and Kreinovich, V. Avoiding fake boundaries in set interval computing. Journal of Uncertain Systems, 11(2):137-148, 2017.","journal-title":"Journal of Uncertain Systems"}],"container-title":["Acta Cybernetica"],"original-title":[],"link":[{"URL":"https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/download\/4565\/4131","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/download\/4565\/4131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/download\/4565\/4131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T09:39:34Z","timestamp":1782293974000},"score":1,"resource":{"primary":{"URL":"https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/view\/4565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,19]]},"references-count":16,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,6,22]]}},"URL":"https:\/\/doi.org\/10.14232\/actacyb.314985","relation":{},"ISSN":["2676-993X","0324-721X"],"issn-type":[{"value":"2676-993X","type":"electronic"},{"value":"0324-721X","type":"print"}],"subject":[],"published":{"date-parts":[[2025,12,19]]}}}