A non-iterative method for robustly computing the intersections between a line and a curve or surface
Accepted version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
Abstract
The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a non-iterative method for computing intersections by solving a matrix singular value decomposition (SVD) and an eigenvalue problem. That is, all intersection points and their parametric coordinates are determined in one-shot using only standard linear algebra techniques available in most software libraries. As a result, the introduced technique is far more robust than the widely used Newton-Raphson iteration or its variants. The maximum size of the considered matrices depends on the polynomial degree
Description
Keywords
Journal Title
Conference Name
Journal ISSN
1097-0207