Exact computation of the sign of a finite sum

Applied Mathematics and Computation

Volumn 99, Issue 2-3, 1999, Pages 99-127

  Ratschek, Helmut ^a   Rokne, Jon ^b  

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

Exact sums; Geometric computations; Geometric primitives

Indexed keywords

EID: 0040441831     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(98)00010-1     Document Type: Article

References (22)

1. H. Edelsbrunner, E.P. Mücke, Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms, Proc. 4th Annual Symposium on Computational Geometry, ACM, New York, 1988, pp. 118-133.
2. D.M. Priest, On properties of floating point arithmetics: Numerical stability and the const of accurate computations, Ph.D. Thesis, University of California, Berkeley, 1992.
3. N.J. Higham, The accuracy of floating point summation, SIAM J. Sci. Comput. 14 (1993) 783-799.
4. T.O. Espelid, On floating point summation, SIAM Rev. 37 (1995) 603-607.
5. F. Avnaim, J.-D. Boissonanat, O. Devillers, F.P. Preparata, M. Yvinec, Evaluation of a new method to compute signs of determinants, 11th Computational Geometry Conference, Vancouver, BC, 1995.
6. W.H. Press, B.P. Flannery, S.A. Teukolsky, W.T. Vetterling, Numerical Recipes in C, Cambridge University Press, Cambridge, 1988.
7. S. Fortune, Stable maintenance of point set triangulations in two dimensions, 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 494-499.
8. A.R. Forrest, Geometric computing environments: Computational geometry meets software engineering, in: R.A. Earnshaw (Ed.), Theoretical foundations of computer graphics and CAD, NATO Advanced Study Institute Series, vol. 40, Springer, Berlin, 1987, pp. 185-197.
9. M. Gagnet, J.-C. Hervé, T. Pudet, J.M. VanThong, Incremental computation of planar maps, Computer Graphics 23 (1989) 345-354.
10. C. Herve, F. Morain, D. Salesin, B.P. Serpette, J. Vullemin, P. Zimmermann, BigNum: A portable and efficient package for arbitrary-precision arithmetic, INRIA Report 1016, Rocquencourt, 1989.
11. J.W. Jaromczyk, G.W. Wasilkowski, Numerical stability of a convex hull algorithm for simple polygon, Algorithmica (to appear).
12. J.W. Jaromczyk, G.W. Wasilkowski, Computing convex hull in a floating point arithmetic (Preprint).
13. T.G. Kao, G.D. Knott, An efficient and numerically correct algorithm for the 2D convex hull problem, BIT 30 (1990) 311-331.
14. M. Karasick, D. Lieber, L. Nackman, Efficient Delaunay triangulation using rational arithmetic, ACM Trans. Graphics 10 (1991) 71-91.
15. D.E. Knuth, Axioms and Hulls, Springer, Berlin, 1991.
16. Z. Li, V. Milenkovic, Constructing strongly convex hulls using exact or rounded arithmetic, Proc. 6th Annual Symposium on Computational Geometry, ACM, New York, 1990, pp. 235-243.
17. V. Milenkovic, Double precision geometry: A general technique for calculating line and segment intersections in rounded arithmetic, 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 500-505.
18. J. O'Rourke, Computational Geometry in C, Cambridge University Press, Cambridge, 1994.
19. F.P. Preparata, M.I. Shamos, Computational Geometry, Springer, Berlin, 1988.
20. D.H. Salesin, Epsilon geometry: Building robust algorithms from imprecise computations, Ph.D. Thesis, Stanford University, 1991.
21. K. Sugihara, A simple method for avoiding numerical error and degeneracy in Voronoi diagram construction, IEICE Trans. Fundamentals E75-A (1992) 468-477.
22. C.P. Yap, A geometric consistency theorem for a symbolic perturbation theorem, Proc. 4th Annual Symposium on Computational Geometry, ACM, New York, 1988, pp. 134-142.