Abstract
This paper is concerned with a robust geometric predicate for the 2D orientation problem. Recently, a fast and accurate floating-point summation algorithm is investigated by Rump, Ogita and Oishi, which provably outputs a result faithfully rounded from the exact value of the summation of floating-point numbers. We optimize their algorithm for applying it to the 2D orientation problem which requires only a correct sign of a determinant of a 3×3 matrix. Numerical results illustrate that our algorithm works fairly faster than the state-of-the-art algorithm in various cases.
Original language | English |
---|---|
Pages (from-to) | 215-231 |
Number of pages | 17 |
Journal | Japan Journal of Industrial and Applied Mathematics |
Volume | 26 |
Issue number | 2-3 |
DOIs | |
Publication status | Published - 2009 Oct |
Keywords
- 2D orientation problem
- Accurate algorithm
- Floating-point arithmetic
- Robust geometric predicate
ASJC Scopus subject areas
- Engineering(all)
- Applied Mathematics