Share Email Print
cover

Proceedings Paper

Fast RNS algorithm for computational geometry problems
Author(s): Vassil S. Dimitrov; Graham A. Jullien
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 20 November 2001
PDF: 11 pages
Proc. SPIE 4474, Advanced Signal Processing Algorithms, Architectures, and Implementations XI, (20 November 2001); doi: 10.1117/12.448643
Show Author Affiliations
Vassil S. Dimitrov, Univ. of Windsor (Canada)
Graham A. Jullien, Univ. of Calgary (Canada)


Published in SPIE Proceedings Vol. 4474:
Advanced Signal Processing Algorithms, Architectures, and Implementations XI
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top