Name
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). |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3105762.3105783 | High Performance Graphics |
Field | DocType | ISBN |
Polynomial,Computer science,Ray tracing (graphics),Vincent's theorem,Algorithm,Fourier transform,Fourier series,Bézier curve,Properties of polynomial roots,Linearization | Conference | 978-1-4503-5101-0 |
Citations | PageRank | References |
0 | 0.34 | 31 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Reshetov | 1 | 1 | 1.02 |