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

Katsuhisa Ozaki, Takeshi Ogita, Shinichi Oishi

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)3-13
Number of pages11
JournalInformation and Computation
Volume216
DOIs
Publication statusPublished - 2012 Jul

Fingerprint

Computational geometry

Keywords

  • Computational geometry
  • Error-free determinant transformation
  • Verified numerical computation

ASJC Scopus subject areas

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

Cite this

A robust algorithm for geometric predicate by error-free determinant transformation. / Ozaki, Katsuhisa; Ogita, Takeshi; Oishi, Shinichi.

In: Information and Computation, Vol. 216, 07.2012, p. 3-13.

Research output: Contribution to journalArticle

@article{940a0d8b167a48a79fcfaf2567012924,
title = "A robust algorithm for geometric predicate by error-free determinant transformation",
abstract = "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.",
keywords = "Computational geometry, Error-free determinant transformation, Verified numerical computation",
author = "Katsuhisa Ozaki and Takeshi Ogita and Shinichi Oishi",
year = "2012",
month = "7",
doi = "10.1016/j.ic.2011.09.007",
language = "English",
volume = "216",
pages = "3--13",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",

}

TY - JOUR

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

AU - Ozaki, Katsuhisa

AU - Ogita, Takeshi

AU - Oishi, Shinichi

PY - 2012/7

Y1 - 2012/7

N2 - 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.

AB - 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.

KW - Computational geometry

KW - Error-free determinant transformation

KW - Verified numerical computation

UR - http://www.scopus.com/inward/record.url?scp=84861637638&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861637638&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2011.09.007

DO - 10.1016/j.ic.2011.09.007

M3 - Article

VL - 216

SP - 3

EP - 13

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

ER -