Evaluating Signs of Determinants Using Single-Precision Arithmetic

Algorithmica (New York)

Volumn 17, Issue 2, 1997, Pages 111-132

  Avnaim, F ^a   Boissonnat, J D ^a   Devillers, O ^a   Preparata, F P ^b   Yvinec, M ^c  

^a INRIA   (France)

^b Brown Univerity   (United States)

^c INRIA   (France)

Author keywords

Computational geometry; Exact arithmetic; Precision; Robust algorithms

Indexed keywords

EID: 0346506900     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02522822     Document Type: Article

References (17)

1. M. Benouamer, P. Jaillon, D. Michelucci, and J.-M. Moreau. A lazy solution to imprecision in computational geometry. Proc. 5th Canad. Conf. Comput. Geom., pp. 73-78, Waterloo, 1993.
2. K. L. Clarkson. Safe and effective determinant evaluation. Proc. 33rd Annual IEEE Symp. Found. Comput. Sci., pp. 387-395, 1992.
3. S. Fortune and V. Milenkovic. Numerical stability of algorithms for line arrangements. Proc. 7th Annual ACM Symp. Comput. Geom., pp. 334-341, 1991.
4. S. Fortune. Stable maintenance of point set triangulations in two dimensions. Proc. 30th Annual IEEE Symp. Found. Comput. Sci., pp. 494-505, 1989.
5. S. Fortune. Numerical stability of algorithms for 2-d Delaunay triangulations and Voronoi diagrams. Proc. 8th Annual ACM Symp. Comput Geom., pp. 83-92, 1992.
6. S. Fortune and C. J. Van Wyk. Efficient exact arithmetic for computational geometry. Proc. 9th Annual ACM Symp. Comput. Geom., pp. 163-172, 1993.
7. S. Fortune and C. J. Van Wyk, Ln User Manual, 1994.
8. L. J. Guibas, D. Salesin, and J. Stolfi. Epsilon geometry: building robust algorithms from imprecise computations. Proc. 5th Annual ACM Symp. Comput. Geom., pp. 208-217, 1989.
9. D. H. Greene and F. F. Yao. Finite-resolution computational geometry. Proc. 21th Annual IEEE Symp. Found. Comput. Sci., pp. 143-152, 1986.
10. C. M. Hoffmann, J. E. Hopcroft, and M. T. Karasick. Robust set operations on polyhedral solids. IEEE Comput. Graph. Appl., 9(6):50-59, November 1989.
11. M. Karasick, D. Lieber, and L. R. Nackman. Efficient Delaunay triangulations using rational arithmetic. ACM Trans. Graph., 10:71-91, 1991.
12. V. Milenkovic, Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. Ph.d. thesis, Carnegie Mellon University, 1988.
13. V. Milenkovic. Verifiable implementations of geometric algorithms using finite precision arithmetic. Artificial Intelligence, 37:377-401, 1988.
14. V. Milenkovic. Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic. Proc. 30th Annual IEEE Symp. Found. Comput. Sci., pp 500-505, 1989.
15. K. Mehlhorn and S. Näher. LEDA, a library of efficient data types and algorithms. Report A 04/89, Fachber. Inform., Univ. Saarlandes, Saarbrücken, 1989.
16. K. Sugihara and M. Iri. Geometric algorithms in finite-precision arithmetic. Technical Report 88-10, Math. Eng. and Physics Dept., Univ. of Tokyo, September 1988.
17. L. Valiant. Completeness classes in algebra. Proc. 11th Annual ACM Symp. Theory Comput., pp. 249-261, 1979.