This article first recalls with some examples the damages that numerical inaccuracy of floating point arithmetic can cause during geometric computations, in methods from Computational Geometry, Computer Graphics or CADCAM. Then it surveys the various approaches proposed to overcome inaccuracy difficulties. It seems that the only way to achieve robustness for existing methods from Computational Geometry is exact computation, it is the "Exact Computation Paradigm " of C.K. Yap and T. Dub'e. In Computer Graphics or CADCAM, people prefer to abandon methods and data structures not robust enough against inaccuracy, namely Boundary Representations and related methods, this may be called the "Approximate Computation Paradigm".
|
410
|
The Complexity of Robot Motion Planning
– Canny
- 1988
|
|
245
|
A sweepline algorithm for Voronoi diagrams
– Fortune
- 1987
|
|
235
|
Rigorous Global Search: Continuous Problems
– Kearfott
- 1996
|
|
214
|
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
– Edelsbrunner, Mücke
- 1990
|
|
176
|
Convex polytopes
– Grunbaum
- 1967
|
|
153
|
On the combinatorial and algebraic complexity of quantifier elimination
– Basu, Pollack, et al.
- 1996
|
|
124
|
Geometric and Solid Modelling: An Introduction
– Hoffmann
- 1989
|
|
113
|
Interval analysis for computer graphics
– SNYDER
- 1992
|
|
99
|
Efficient exact arithmetic for computational geometry
– Fortune, Wyk
- 1993
|
|
76
|
Efficient delaunay triangulation using rational arithmetic
– Karasick, Lieber, et al.
- 1991
|
|
75
|
Algorithmic Algebra
– Mishra
- 1993
|
|
72
|
Fundamental problems in algorithmic algebra
– Yap
- 2000
|
|
70
|
The exact computation paradigm
– Yap
- 1995
|
|
70
|
Verifiable implementations of geometric algorithms using finite precision arithmetic
– Milenkovic
- 1988
|
|
66
|
Exact real computer arithmetic with continued fractions
– Vuillemin
- 1990
|
|
64
|
A geometric consistency theorem for a symbolic perturbation scheme
– Yap
- 1988
|
|
57
|
Safe and effective determinant evaluation
– Clarkson
- 1992
|
|
44
|
Sparse Elimination and Applications in Kinematics
– Emiris
- 1994
|
|
40
|
An efficient approach to removing geometric degeneracies
– Emiris, Canny
- 1992
|
|
38
|
Exact real arithmetic: A case study in higher order programming
– Böhm, Cartwright, et al.
- 1986
|
|
38
|
Axioms and Hulls
– Knuth
- 1992
|
|
36
|
Using tolerances to guarantee valid polyhedral modeling results
– Segal
- 1990
|
|
34
|
Construction of the Voronoi diagram for `one million' generators in single-precision arithmetic
– Sugihara, Iri
- 1992
|
|
33
|
Adaptive enumeration of implicit surfaces with affine arithmetic
– Figueiredo, Stolfi
- 1996
|
|
27
|
Numerical stability of geometric algorithms
– Ottmann, Thiemt, et al.
- 1987
|
|
26
|
Algebraic Method for Manipulation of Dimensional Relationships
– Kondo
- 1992
|
|
24
|
A dimensionality paradigm for surface interrogations
– Hoffmann
- 1990
|
|
23
|
Polyhedral modeling with exact arithmetic
– Fortune
- 1995
|
|
23
|
Finding compact coordinate representations for polygons and polyhedra
– Milenkovic, Nackman
- 1990
|
|
21
|
Evaluation of a new method to compute signs of determinants
– Avnaim, Boissonnat, et al.
- 1995
|
|
21
|
Error-free boundary evaluation based on a lazy rational arithmetic: a detailed implementation
– Benouamer, Michelucci, et al.
- 1994
|
|
20
|
Boundary representation modeling with local tolerances
– Jackson
- 1995
|
|
19
|
Computing with infinite objects
– Wiedmer
- 1980
|
|
17
|
More powerful solid modeling through ray representations
– Menon, Marisa, et al.
- 1994
|
|
13
|
Modelling and Representation of Dimensions and Tolerances: a Survey
– Juster
- 1992
|
|
13
|
E cient representations and techniques for computing b-rep's of csg models with nurbs primitives
– Krishnan, Manocha
- 1996
|
|
10
|
A paradigm for the robust design of algorithms for geometric modeling
– Agrawal, Requicha
- 1994
|
|
10
|
Incremental computation of planar maps
– Gangnet, Herv'e, et al.
- 1989
|
|
10
|
Proving by example and gap theorem
– Hong
- 1986
|
|
10
|
Seminumerical Algorithms, volume 2
– Knuth
- 1981
|
|
9
|
Computing in algebraic extensions. In: Computer algebra
– Loos
- 1983
|
|
9
|
Lazy arithmetic
– Michelucci, Moreau
- 1997
|
|
8
|
A lazy arithmetic library
– Benouamer, Jaillon, et al.
- 1993
|
|
8
|
An epsilon-arithmetic for removing degeneracies
– Michelucci
- 1995
|
|
7
|
The design of Linetool, a geometric editor
– Ericson, Yap
- 1988
|
|
7
|
On the comleteness and conversion of ray representations of arbitrary solids
– Menon, Voelcker
- 1995
|
|
6
|
Robust interval solid modelling. part 1: Representations. part 2: Boundary evaluation
– Hu, Patrikalakis, et al.
- 1996
|
|
6
|
An Accurate Algorithm for Rasterizing Algebraic Curves
– Taubin
- 1993
|
|
5
|
EOEcient B-rep generation of low degree sculptured solids using exact arithmetic
– Keyser, Krishnan, et al.
- 1996
|
|
5
|
repr'esentations par les fronti`eres : quelques constructions; difficult'es rencontr'ees (in french
– Les
- 1987
|
|
