A line/trimmed NURBS surface intersection algorithm using matrix representations.

Computer Aided Geometric Design(2016)

引用 19|浏览61
暂无评分
摘要
We contribute a reliable line/surface intersection method for trimmed NURBS surfaces, based on a novel matrix-based implicit representation and numerical methods in linear algebra such as singular value decomposition and the computation of generalized eigenvalues and eigenvectors. A careful treatment of degenerate cases makes our approach robust to intersection points with multiple pre-images. We then apply our intersection algorithm to mesh NURBS surfaces through Delaunay refinement. We demonstrate the added value of our approach in terms of accuracy and treatment of degenerate cases, by providing comparisons with other intersection approaches as well as a variety of meshing experiments. A reliable line/surface intersection method for trimmed NURBS surfaces is proposed.The method is based on a novel matrix-based implicit representation.A careful treatment is proposed for intersection points with multiple pre-images.The method is applied to mesh trimmed NURBS surfaces through Delaunay refinement.
更多
查看译文
关键词
Line/trimmed NURBS intersection,Matrix based implicit representation,Meshing NURBS surfaces,Delaunay refinement
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要