首页> 外文期刊>Computer Aided Geometric Design >A line/trimmed NURBS surface intersection algorithm using matrix representations
【24h】

A line/trimmed NURBS surface intersection algorithm using matrix representations

机译:使用矩阵表示的线/修剪NURBS曲面相交算法

获取原文
获取原文并翻译 | 示例
       

摘要

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.
机译:我们基于一种新颖的基于矩阵的隐式表示和线性代数中的数值方法(例如奇异值分解以及广义特征值和特征向量的计算),为修剪的NURBS曲面提供了可靠的线/面相交方法。对退化案例的仔细处理使我们的方法对于具有多个原像的交点具有鲁棒性。然后,我们通过Delaunay细化将相交算法应用于NURBS曲面网格。通过与其他相交方法以及各种网格化实验进行比较,我们证明了我们方法在退化案例的准确性和处理方面的附加价值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号