Name
Abstract | ||
|---|---|---|
In this paper, we present a novel geometric method for efficiently and robustly computing intersections between a ray and a triangular Bezier patch defined over a triangular domain, called the hybrid clipping (HC) algorithm. If the ray pierces the patch only once, we locate the parametric value of the intersection to a smaller triangular domain, which is determined by pairs of lines and quadratic curves, by using a multi-degree reduction method. The triangular domain is iteratively clipped into a smaller one by combining a subdivision method, until the domain size reaches a prespecified threshold. When the ray intersects the patch more than once, Descartes’ rule of signs and a split step are required to isolate the intersection points. The algorithm can be proven to clip the triangular domain with a cubic convergence rate after an appropriate preprocessing procedure. The proposed algorithm has many attractive properties, such as the absence of an initial guess and insensitivity to small changes in coefficients of the original problem. Experiments have been conducted to illustrate the efficacy of our method in solving ray-triangular Bezier patch intersection problems. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1631/FITEE.1500390 | Frontiers of IT & EE |
Keywords | Field | DocType |
Ray tracing, Triangular Bézier surface, Ray-patch intersection, Root-finding, Hybrid clipping, TP391.7 | Mathematical optimization,Ray tracing (graphics),Quadratic equation,Algorithm,Bézier surface,Subdivision,Root-finding algorithm,Preprocessor,Parametric statistics,Descartes' rule of signs,Mathematics | Journal |
Volume | Issue | ISSN |
17 | 10 | 2095-9230 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanhong Liu | 1 | 8 | 3.56 |
| Juan Cao | 2 | 38 | 7.92 |
| Zhonggui Chen | 3 | 74 | 6.16 |
| Xiaoming Zeng | 4 | 176 | 48.53 |