Residual Iteration and Accurate Polynomial Evaluation for Shape-interrogation Applications
| dc.contributor.author | Hoffmann, C. | en_US |
| dc.contributor.author | Park, with G. | en_US |
| dc.contributor.author | Simard, J-R. | en_US |
| dc.contributor.author | Stewart, N. F. | en_US |
| dc.contributor.editor | Gershon Elber and Nicholas Patrikalakis and Pere Brunet | en_US |
| dc.date.accessioned | 2016-02-17T18:02:44Z | |
| dc.date.available | 2016-02-17T18:02:44Z | |
| dc.date.issued | 2004 | en_US |
| dc.description.abstract | Surface interrogation and intersection depend crucially on good root-finding algorithms, which in turn depend on accurate polynomial evaluation. Conventional algorithms for evaluation typically encounter difficulties near multiple roots, or roots that are very close, and this may lead to gross errors in the geometric computation, or even catastrophic failure. In this paper we study the cost and accuracy of several approaches to polynomial evaluation, explaining the reasons for non-convergence of certain methods, and supporting our subsequent conclusions with the results of benchmarking experiments. | en_US |
| dc.description.sectionheaders | Invited Talk 1 | en_US |
| dc.description.seriesinformation | Solid Modeling | en_US |
| dc.identifier.doi | 10.2312/sm.20041371 | en_US |
| dc.identifier.isbn | 3-905673-55-X | en_US |
| dc.identifier.issn | 1811-7783 | en_US |
| dc.identifier.pages | 9-14 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/sm.20041371 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | G.1 [Numerical Analysis] | en_US |
| dc.subject | I.3.5 [Computational Geometry and Object Modeling] | en_US |
| dc.subject | J.6 [Computer | en_US |
| dc.subject | Aided Engineering] | en_US |
| dc.title | Residual Iteration and Accurate Polynomial Evaluation for Shape-interrogation Applications | en_US |
Files
Original bundle
1 - 1 of 1