Abstract
We propose a method of evaluating signs of 2×2 and 3×3 determinants withb-bit integer entries using onlyb and (b+1)-bit arithmetic, respectively. This algorithm has numerous applications in geometric computation and provides a general and practical approach to robustness. The algorithm has been implemented and compared with other exact computation methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[BJMM] 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.
[Cla] K. L. Clarkson. Safe and effective determinant evaluation.Proc. 33rd Annual IEEE Symp. Found. Comput. Sci., pp. 387–395, 1992.
[FM] S. Fortune and V. Milenkovic. Numerical stability of algorithms for line arrangements.Proc. 7th Annual ACM Symp. Comput. Geom., pp. 334–341, 1991.
[For1] S. Fortune. Stable maintenance of point set triangulations in two dimensions.Proc. 30th Annual IEEE Symp. Found. Comput. Sci., pp. 494–505, 1989.
[For2] S. Fortune. Numerical stability of algorithms for 2-d Delaunay triangulations and Voronoid diagrams.Proc. 8th Annual ACM Symp. Comput Geom., pp. 83–92, 1992.
[FV1] S. Fortune and C. J. Van Wyk. Efficient exact arithmetic for computational geometry.Proc. 9th Annual ACM Symp. Comput. Geom., pp. 163–172, 1993.
[FV2] S. Fortune and C. J. Van Wyk. Ln User Manual, 1994.
[GSS] L. J. Guibas, D. Salesin, and J. Stolfi. Espilon geometry: building robust algorithms from imprecise computations.Proc. 5th Annual ACM Symp. Comput. Geom., pp. 208–217, 1989.
[GY] D. H. Greene and F. F. Yao. Finite-resolution computational geometry.Proc. 27th Annual IEEE Symp. Found. Comput. Sci., pp. 143–152, 1986.
[HHK] 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.
[KLN] M. Karasick, D. Lieber, and L. R. Nackman. Efficient Delaunay triangulations using rational arithmetic.ACM Trans. Graph., 10: 71–91, 1991.
[Mil1] V. Milenkovic. Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. Ph.d. thesis, Carnegie Mellon University, 1988.
[Mil2] V. Milenkovic. Verifiable implementations of geometric algorithms using finite precision arithmetic.Artificial Intelligence, 37: 377–401, 1988.
[Mil3] 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.
[MN] 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.
[SI] 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.
[Val] L. Valiant. Completeness classes in algebra.Proc. 11th Annual ACM Symp. Theory Comput., pp. 249–261, 1979.
Author information
Authors and Affiliations
Additional information
Communicated by K. Mehlhorn.
This work was partially supported by the ESPRIT Basic Research Action 7141 (AL-COMII) and by NSF Grant CCR 91-96176. Part of this work was done while J.-D. Boissonnat was visiting Brown University.
Rights and permissions
About this article
Cite this article
Avnaim, F., Boissonnat, J.D., Devillers, O. et al. Evaluating signs of determinants using single-precision arithmetic. Algorithmica 17, 111–132 (1997). https://doi.org/10.1007/BF02522822
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02522822