Fast RNS algorithm for computational geometry problems

Vassil S. Dimitrov; Graham A. Jullien

doi:10.1117/12.448643

20 November 2001 Fast RNS algorithm for computational geometry problems

Vassil S. Dimitrov, Graham A. Jullien

Proceedings Volume 4474, Advanced Signal Processing Algorithms, Architectures, and Implementations XI; (2001) https://doi.org/10.1117/12.448643
Event: International Symposium on Optical Science and Technology, 2001, San Diego, CA, United States

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.

Citation Download Citation

Vassil S. Dimitrov and Graham A. Jullien "Fast RNS algorithm for computational geometry problems", Proc. SPIE 4474, Advanced Signal Processing Algorithms, Architectures, and Implementations XI, (20 November 2001); https://doi.org/10.1117/12.448643

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available