Sign determination in residue number systems

Theoretical Computer Science

Volumn 210, Issue 1, 1999, Pages 173-197

  Brönnimann, Hervé ^a   Emiris, Ioannis Z ^a   Pan, Victor Y ^b   Pion, Sylvain ^a  

^a INRIA   (France)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000977233     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00101-7     Document Type: Article

References (41)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. i ≤ L"? Bull. EATCS 28 (1986) 16-20.
3. F. Avnaim, J.-D. Boissonnat, O. Devillers, F. Preparata, M. Yvinec, Evaluation of a new method to compute signs of determinants, Proc. 11th Annu. ACM Symp. Comput. Geom., 1995, pp. C16-C17.
4. S. Basu, R. Pollack, M.-F. Roy, On the combinatorial and algebraic complexity of quantifier elimination, Proc. IEEE Symp. Foundations of Comput. Sci., 1994.
5. D. Bini, V.Y. Pan, Polynomial and Matrix Computations, vol. 1: Fundamental Algorithms, Birkhäuser, Boston, 1994.
6. D. Bini, V.Y. Pan, Y. Yu, Certified numerical computation of the sign of matrix determinant, Preliminary Report, 1997.
7. J.-C. Bajard, L.S. Didier, J.-M. Muller, A new Euclidean division algorithm for residue number systems, Proc. ASAP, 1996, pp. 45-54.
8. H. Brönnimann, I.Z. Emiris, V. Pan, S. Pion, Computing exact geometric predicates using modular arithmetic with single precision, Proc. ACM Symp. on Computational Geometry, 1997, pp. 174-182.
9. H. Brönnimann, S. Pion, Exact rounding for geometric constructions, Proc. of GAMM/IMACS Int. Symp. on Scientific Computing, Comput. Arithm. and Validated Numerics, 1997, pp. XIII-1-XIII-3.
10. H. Brönnimann, M. Yvinec, Efficient exact evaluation of signs of determinants, Research Report 3140, INRIA Sophia-Antipolis, 1997.
11. C. Burnikel, J. Könnemann, K. Mehlhorn, S. Näher, S. Schirra, C. Uhrig, Exact geometric computation in LEDA, Proc. 11th Annu. ACM Symp. Comput. Geom., 1995, pp. C18-C19. Package available at http://www.mpi-sb.mpg.de/LEDA/leda.html.
12. J.F. Canny, An improved sign determination algorithm, H.F. Mattson, T. Mora, T.R.N. Rao (Eds.), Proc. Int. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, vol. 539, Springer, Berlin, pp. 108-117.
13. K.L. Clarkson, Safe and effective determinant evaluation, Proc. 33rd Annu. IEEE Symp. Found. Comput. Sci., 1992, pp. 387-395.
14. G.E. Collins, R. Loos, Real zeros of polynomials, in: B. Buchberger, G.E. Collins, R. Loos (Eds.), Computer Algebra: Symbolic and Algebraic Computation, 2nd ed., Springer, Wien, 1982, pp. 83-94.
15. H. Edelsbrunner, E.P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Trans. Graphics 9(1) (1990) 67-104.
16. I.Z. Emiris, A complete implementation for computing general dimensional convex hulls, Int. J. Comput. Geom. Appl. (1997), to appear. Preliminary version as Research Report 2551, INRIA Sophia-Antipolis, France, 1995.
17. I.Z. Emiris, J.F. Canny, A general approach to removing degeneracies, SIAM J. Comput. 24(3) (1995) 650-664.
18. I.Z. Emiris, V.Y. Pan, Y. Yu, Modular arithmetic for linear algebra computations in the real field, J. Symbol. Comput. (1998), to appear.
19. S. Fortune, Numerical stability of algorithms for 2-d Delaunay triangulation, and Voronoi diagrams, Proc. 8th Annu. ACM Symp. Comput. Geom., 1992, pp. 83-92.
20. S. Fortune, C.J. Van Wyk, Efficient exact arithmetic for computational geometry, Proc. 9th Annu. ACM Symp. Comput. Geom., 1993, pp. 163-172.
21. S. Fortune, C.J. Van Wyk, Static analysis yields efficient exact integer arithmetic for computational geometry, ACM Trans. Graphics, 1996.
22. D. Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Comput. Surv. 32(1) (1991) 5-48.
23. G.H. Golub, C.F. van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, 1996.
24. C.M. Hoffmann, How solid is solid modeling? Applied Computational Geometry, Lecture Notes in Computer Science, vol. 1148, Springer, Berlin, 1996, pp. 1-8.
25. C.M. Hoffmann, J.E. Hopcroft, M.T. Karasick, Robust set operations on polyhedral solids, IEEE Comput. Graph. Appl. 9(6) (1989) 50-59.
26. C.Y. Hung, B. Parhami, An approximate sign detection method for residue numbers and its application to RNS division, Comput. Math. Appl. 27(4) (1994) 23-35.
27. J. Keyser, S. Krishnan, D. Manocha, Efficient B-rep generation of low degree sculptured solids using exact arithmetic, Technical Report 40, Dept. Computer Science, Univ. N. Carolina, Chapel Hill, 1996.
28. D.E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, vol. 2, Addison-Wesley, Reading, MA, 1981 and 1997.
29. M. Lauer, Computing by homomorphic images, in: B. Buchberger, G.E. Collins, R. Loos (Eds.), Computer Algebra: Symbolic and Algebraic Computation, 2nd ed., Springer, Wien, 1982, pp. 139-168.
30. V. Milenkovic, Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic, Proc, 30th Annu. IEEE Symp. Found. Comput. Sci., 1989, pp. 500-505.
31. B. Mishra, Algorithmic Algebra, Springer, New York, 1993.
32. V.Y. Pan, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Theoret. Comput. Sci. 162(2) (1996) 173-223.
33. V.Y. Pan, Y. Yu, C. Stewart, Algebraic and numerical techniques for the computation of matrix determinants, Comput. Math. (with applications) 34(1) (1997) 43-70.
34. A. Rege, A complete and practical algorithm for geometric theorem proving, Proc. ACM Symp. on Computational Geometry, 1995, pp. 277-286.
35. N.S. Szabo, R.I. Tanaka, Residue Arithmetic and its Applications to Computer Technology, McGraw-Hill, New York, 1967.
36. J.R. Shewchuk, Robust adaptive floating-point geometric predicates, Proc. 12th Annu. ACM Symp. Computational Geometry, 1996, pp. 141-150.
37. K. Sugihara, M. Iri, A robust topology-oriented incremental algorithm for Voronoi diagrams, Int. J. Comput. Geom. Appl. 4 (1994) 179-228.
38. M.N. Vrahatis, Solving systems of nonlinear equations using the nonzero value of the topological degree, ACM Trans. on Math. Software 14(4) (1998) 312-329.
39. C. Yap, Towards exact geometric computation, Comput. Geom. Theory Appl. 7 (1997) 3-23.
40. C.K. Yap, Exact computational geometry and tolerancing metrology, in: D. Avis, J. Bose (Eds.), Snapshots of Computational and Discrete Geometry, vol. 3, Tech. Rep. SOCS-94.50, McGill School of Comput. Sci., 1995.
41. C.K. Yap, T. Dubhe, The exact computation paradigm, in: D. Du, F. Hwang (Eds.), Computing in Euclidean Geometry, World Scientific Press, Singapore, 1995.