Robustness and randomness

Dominique Michelucci; Jean Michel Moreau; Sebti Foufou

doi:10.1007/978-3-540-85521-7_8

Robustness and randomness

Dominique Michelucci, Jean Michel Moreau, Sebti Foufou

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The study of robustness problems for 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 discusses 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.

Original language	English (US)
Title of host publication	Reliable Implementation of Real Number Algorithms
Subtitle of host publication	Theory and Practice - International Seminar, Revised Papers
Pages	127-148
Number of pages	22
DOIs	https://doi.org/10.1007/978-3-540-85521-7_8
State	Published - 2008
Event	International Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice - Dagstuhl Castle, Germany Duration: Jan 8 2006 → Jan 13 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5045 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	International Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice
Country/Territory	Germany
City	Dagstuhl Castle
Period	1/8/06 → 1/13/06

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-85521-7_8

Cite this

Michelucci, D., Moreau, J. M., & Foufou, S. (2008). Robustness and randomness. In Reliable Implementation of Real Number Algorithms: Theory and Practice - International Seminar, Revised Papers (pp. 127-148). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5045 LNCS). https://doi.org/10.1007/978-3-540-85521-7_8

Robustness and randomness. / Michelucci, Dominique; Moreau, Jean Michel; Foufou, Sebti.
Reliable Implementation of Real Number Algorithms: Theory and Practice - International Seminar, Revised Papers. 2008. p. 127-148 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5045 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Michelucci, D, Moreau, JM & Foufou, S 2008, Robustness and randomness. in Reliable Implementation of Real Number Algorithms: Theory and Practice - International Seminar, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5045 LNCS, pp. 127-148, International Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice, Dagstuhl Castle, Germany, 1/8/06. https://doi.org/10.1007/978-3-540-85521-7_8

@inproceedings{bef2b386ab56418f90060627100c4ece,

title = "Robustness and randomness",

abstract = "The study of robustness problems for 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 discusses 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.",

author = "Dominique Michelucci and Moreau, {Jean Michel} and Sebti Foufou",

year = "2008",

doi = "10.1007/978-3-540-85521-7_8",

language = "English (US)",

isbn = "3540855203",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "127--148",

booktitle = "Reliable Implementation of Real Number Algorithms",

note = "International Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice ; Conference date: 08-01-2006 Through 13-01-2006",

}

TY - GEN

T1 - Robustness and randomness

AU - Michelucci, Dominique

AU - Moreau, Jean Michel

AU - Foufou, Sebti

PY - 2008

Y1 - 2008

N2 - The study of robustness problems for 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 discusses 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.

AB - The study of robustness problems for 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 discusses 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.

UR - http://www.scopus.com/inward/record.url?scp=50949133401&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50949133401&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85521-7_8

DO - 10.1007/978-3-540-85521-7_8

M3 - Conference contribution

AN - SCOPUS:50949133401

SN - 3540855203

SN - 9783540855200

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 127

EP - 148

BT - Reliable Implementation of Real Number Algorithms

T2 - International Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice

Y2 - 8 January 2006 through 13 January 2006

ER -

Robustness and randomness

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this