Adaptive and efficient algorithm for 2D orientation problem

Katsuhisa Ozaki, Takeshi Ogita, Siegfried M. Rump, Shin'ichi Oishi

研究成果: Article査読

1 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)215-231
ページ数17
ジャーナルJapan Journal of Industrial and Applied Mathematics
26
2-3
DOI
出版ステータスPublished - 2009 10
外部発表はい

ASJC Scopus subject areas

  • 工学(全般)
  • 応用数学

フィンガープリント

「Adaptive and efficient algorithm for 2D orientation problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル