Vertex-rounding a three-dimensional polyhedral subdivision
Proceedings of the fourteenth annual symposium on Computational geometry
Robust Geometric Computation Based on Topological Consistency
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
From Algorithm to Program to Software Library
Informatics - 10 Years Back. 10 Years Ahead.
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Robust and efficient delaunay triangulations of points on or close to a sphere
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A robust algorithm for geometric predicate by error-free determinant transformation
Information and Computation
| Hi-index | 0.00 |
The problem of evaluating the sign of the determinant of a small matrix aries in many geometric algorithms. Given an n*n matrix A with integer entries, whose columns are all smaller than M in Euclidean norm, the algorithm given evaluates the sign of the determinant det A exactly. The algorithm requires an arithmetic precision of less than 1.5n+2lgM bits. The number of arithmetic operations needed is O(n/sup 3/)+O(n/sup 2/) log OD(A)/ beta , where OD(A) mod det A mod is the product of the lengths of the columns of A, and beta is the number of 'extra' bits of precision, min(lg(1/u)-1.1n-2lgn-2,lgN-lgM-1.5n-1), where u is the roundoff error in approximate arithmetic, and N is the largest representable integer. Since OD(A)