DagSemProc.06021.8.pdf
- Filesize: 1.6 MB
- 23 pages
Document
Robustness and Randomness
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6021
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-09-13
Cite AsGet BibTex
Dominique Michelucci, Jean Michel Moreau, and Sebti Foufou. Robustness and Randomness. In Reliable Implementation of Real Number Algorithms: Theory and Practice. Dagstuhl Seminar Proceedings, Volume 6021, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.06021.8
https://doi.org/10.4230/DagSemProc.06021.8
Abstract
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.
Keywords
- Robustness
- interval
- randomness
- inaccuracy
- geometric computation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads