Download:
|
by A. James Stewart
In Proc. 3rd Canad. Conf. Comput. Geom
http://www.dgp.toronto.edu/~jstewart/papers/cccg91.ps.gz
Add To MetaCart
Abstract:
Most geometric algorithms assume that perfect "real " arithmetic is available. When these algorithms are implemented they often fail because this assumption is not borne out; that is, these algorithms
Citations
|
90
|
Epsilon geometry: building robust algorithms from imprecise computations
– Guibas, Salesin, et al.
- 1989
|
|
87
|
Finite-resolution computational geometry
– Greene, Yao
- 1986
|
|
73
|
Verifiable implementations of geometric algorithms using finite precision arithmetic
– Milenkovic
- 1988
|
|
48
|
Stable maintenance of point set triangulations in two dimensions
– Fortune
- 1989
|
|
45
|
Towards implementing robust geometric computations
– Hoffmann, Hopcroft, et al.
- 1988
|
|
36
|
Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic
– Milenkovic
- 1989
|
|
22
|
On the Representation and Manipulation of Rigid Solids
– Karasick
- 1988
|
|
18
|
Two design principles of geometric algorithms in finite-precision arithmetic
– Sugihara, Iri
- 1989
|
|
14
|
Topology-oriented approach to robustness and its applications to several Voronoi-diagram algorithms
– Sugihara, Ooishi, et al.
- 1990
|
|
13
|
Partitioning polyhedral objects into nonintersecting parts
– Segal, Sequin
- 1988
|
|
7
|
Recipes for geometry & numerical analysis - Part I: An empirical study
– Dobkin, Silver
- 1988
|
|
1
|
Construction of the Voronoi diagram for over 10 generators in single-precision arithmetic
– Sugihara, Iri
- 1989
|
