TIGHT Intervals for Provably Correct Geometric Computation
| dc.contributor.author | Sichetti, Federico | en_US |
| dc.contributor.author | Attene, Marco | en_US |
| dc.contributor.author | Puppo, Enrico | en_US |
| dc.contributor.editor | Comino Trinidad, Marc | en_US |
| dc.contributor.editor | Mancinelli, Claudio | en_US |
| dc.contributor.editor | Maggioli, Filippo | en_US |
| dc.contributor.editor | Romanengo, Chiara | en_US |
| dc.contributor.editor | Cabiddu, Daniela | en_US |
| dc.contributor.editor | Giorgi, Daniela | en_US |
| dc.date.accessioned | 2025-11-21T07:27:53Z | |
| dc.date.available | 2025-11-21T07:27:53Z | |
| dc.date.issued | 2025 | |
| dc.description.abstract | Interval arithmetic is a practical method for robust computation, bridging the gap between fast, but inexact, floating-point arithmetic and slow, exact arithmetic, such as rational or arbitrary-precision. In this system, numbers are represented as intervals bounded by floating-point numbers, and operations are performed conservatively, guaranteeing that the resulting interval contains the exact mathematical result. We extend a fast C++ library for interval arithmetic by adding support for several transcendental functions. A key feature of our library is that all operations are correctly rounded, ensuring the resulting interval is the smallest floating-point interval that contains the true result. We demonstrate the library's effectiveness by applying it to complex non-polynomial problems, including surface-surface intersection and continuous collision detection for geometric primitives undergoing roto-translational motion. | en_US |
| dc.description.sectionheaders | Tools in Computer Graphics | |
| dc.description.seriesinformation | Smart Tools and Applications in Graphics - Eurographics Italian Chapter Conference | |
| dc.identifier.doi | 10.2312/stag.20251319 | |
| dc.identifier.isbn | 978-3-03868-296-7 | |
| dc.identifier.issn | 2617-4855 | |
| dc.identifier.pages | 9 pages | |
| dc.identifier.uri | https://doi.org/10.2312/stag.20251319 | |
| dc.identifier.uri | https://diglib.eg.org/handle/10.2312/stag20251319 | |
| dc.publisher | The Eurographics Association | en_US |
| dc.rights | Attribution 4.0 International License | |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | CCS Concepts: Mathematics of computing → Interval arithmetic; Mathematical software performance; Theory of computation → Rounding techniques | |
| dc.subject | Mathematics of computing → Interval arithmetic | |
| dc.subject | Mathematical software performance | |
| dc.subject | Theory of computation → Rounding techniques | |
| dc.title | TIGHT Intervals for Provably Correct Geometric Computation | en_US |
Files
Original bundle
1 - 1 of 1