20 November 2001 Fast RNS algorithm for computational geometry problems
Author Affiliations +
Abstract
A new and efficient number theoretic algorithm for evaluating signs of determinants is proposed. The algorithm uses computations over small finite rings. It is devoted to a variety of computational geometry problems, where the necessity of evaluating signs of determinants of small matrices often arises.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Vassil S. Dimitrov, Graham A. Jullien, "Fast RNS algorithm for computational geometry problems", Proc. SPIE 4474, Advanced Signal Processing Algorithms, Architectures, and Implementations XI, (20 November 2001); doi: 10.1117/12.448643; https://doi.org/10.1117/12.448643
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT

Modified Faddeev Algorithm For Matrix Manipulation
Proceedings of SPIE (November 28 1984)
Old And New Algorithms For Toeplitz Systems
Proceedings of SPIE (February 23 1988)
Stability of Bareiss algorithm
Proceedings of SPIE (December 01 1991)
Systolic Arrays For Eigenvalue Computation
Proceedings of SPIE (January 04 1986)
Redundant finite rings for fault-tolerant signal processors
Proceedings of SPIE (October 28 1994)

Back to Top