Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ic.2011.09.007 | Inf. Comput. |
Keywords | Field | DocType |
floating-point number,t. ogita,error-free determinant transformation,accurate floating-point summation algorithm,s. oishi,geometric predicate,robust algorithm,new algorithm,accurate floating-point summation,orientation problem,proposed algorithm,computational geometry | Discrete mathematics,Algebra,Computational geometry,Algorithm,Rounding,Predicate (grammar),Mathematics | Journal |
Volume | ISSN | Citations |
216, | 0890-5401 | 0 |
PageRank | References | Authors |
0.34 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katsuhisa Ozaki | 1 | 13 | 4.70 |
| Takeshi Ogita | 2 | 231 | 23.39 |
| Shin'ichi Oishi | 3 | 280 | 37.14 |