2026-07-21T12:30:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:716 2024-03-06T11:06:40Z ddc:004 open_access

Robustness and Randomness Michelucci, Dominique Moreau, Jean Michel Foufou, Sebti Robustness interval randomness inaccuracy geometric computation Robustness problems of computational geometry algorithms is a topic that has been subject to intensive research efforts from both computer science and mathematics communities. Robustness problems are caused by the lack of precision in computations involving floating-point instead of real numbers. This paper reviews methods dealing with robustness and inaccuracy problems. It discussed approaches based on exact arithmetic, interval arithmetic and probabilistic methods. The paper investigates the possibility to use randomness at certain levels of reasoning to make geometric constructions more robust. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Dominique Michelucci and Jean Michel Moreau and Sebti Foufou 2006 Is Part Of Dagstuhl Seminar Proceedings, Volume 6021, Reliable Implementation of Real Number Algorithms: Theory and Practice (2006) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.06021.8 urn:nbn:de:0030-drops-7167 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06021.8 eng https://creativecommons.org/licenses/by/4.0/legalcode