dc.contributor.author | Reshetov, Alexander | en_US |
dc.contributor.editor | Vlastimil Havran and Karthik Vaiyanathan | en_US |
dc.date.accessioned | 2017-12-06T19:47:29Z | |
dc.date.available | 2017-12-06T19:47:29Z | |
dc.date.issued | 2017 | |
dc.identifier.isbn | 978-1-4503-5101-0 | |
dc.identifier.issn | 2079-8679 | |
dc.identifier.uri | http://dx.doi.org/10.1145/3105762.3105783 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.1145/3105762-3105783 | |
dc.description.abstract | We present a new approach to finding ray-cubic Bézier curve intersections by leveraging recent achievements in polynomial studies. Compared with the state-of-the-art adaptive linearization, it increases performance by 5-50 times, while also improving the accuracy by 1000X. Our algorithm quickly eliminates parts of the curve for which the distance to the given ray is guaranteed to be bigger than a model-specific threshold (maximum curve's half-width). We then reduce the interval with the isolated distance minimum even further and apply a single iteration of a non-linear root-finding technique (Ridders' method). | en_US |
dc.publisher | ACM | en_US |
dc.subject | Computing methodologies | |
dc.subject | Ray tracing | |
dc.subject | Parametric curve and surface models | |
dc.subject | Bézier curves | |
dc.subject | ray tracing | |
dc.subject | hair and fur rendering | |
dc.subject | polynomial roots | |
dc.subject | Budan | |
dc.subject | Fourier theorem | |
dc.subject | Vincent's theorem | |
dc.subject | VCA | |
dc.subject | VAG | |
dc.subject | VAS | |
dc.title | Exploiting Budan-Fourier and Vincent's Theorems for Ray Tracing 3D Bézier Curves | en_US |
dc.description.seriesinformation | Eurographics/ ACM SIGGRAPH Symposium on High Performance Graphics | |
dc.description.sectionheaders | Ray Traversal and Intersection | |
dc.identifier.doi | 10.1145/3105762.3105783 | |