A robust algorithm for geometric predicate by error-free determinant transformation (Q714616)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A robust algorithm for geometric predicate by error-free determinant transformation |
scientific article; zbMATH DE number 6092838
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A robust algorithm for geometric predicate by error-free determinant transformation |
scientific article; zbMATH DE number 6092838 |
Statements
A robust algorithm for geometric predicate by error-free determinant transformation (English)
0 references
11 October 2012
0 references
An accurate and robust algorithm for a two-dimensional (2D) orientation problem is proposed. The algorithm is based on the recently developed algorithm on accurate floating-point summation [\textit{S. M. Rump, T. Ogita} and \textit{S. Oishi}, SIAM J. Sci. Comput. 31, No. 1, 189--224 (2008; Zbl 1185.65082)], by which an error-free determinant transformation is possible. Numerical experiments are done to compare the performance of the proposed algorithm with other preceding algorithms in terms of runtime versus condition number.
0 references
computational geometry
0 references
verified numerical computation
0 references
error-free determinant transformation
0 references
numerical experiments
0 references
algorithm
0 references
0 references
0.8995646238327026
0 references
0.7821616530418396
0 references
0.7821615934371948
0 references
