A robust algorithm for geometric predicate by error-free determinant transformation

Katsuhisa Ozaki, Takeshi Ogita, Shinichi Oishi

研究成果: Article

2 引用 (Scopus)

抜粋

This paper concerns a robust algorithm for the 2D orientation problem which is one of the basic tasks in computational geometry. Recently, a fast and accurate floating-point summation algorithm is investigated by Rump, Ogita and Oishi in [S.M. Rump, T. Ogita, S. Oishi, Accurate floating-point summation. Part I: Faithful rounding, SIAM J. Sci. Comput. 31 (1) (2008) 189-224], in which a new kind of an error-free transformation of floating-point numbers is used. Based on it, a new algorithm of error-free determinant transformation for the 2D orientation problem is proposed, which gives a correct result. Numerical results are presented for illustrating that the proposed algorithm has some advantage over preceding algorithms in terms of measured computing time.

元の言語English
ページ(範囲)3-13
ページ数11
ジャーナルInformation and Computation
216
DOI
出版物ステータスPublished - 2012 7 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

フィンガープリント A robust algorithm for geometric predicate by error-free determinant transformation' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用