Scholarlink

The surface-surface intersection (SSI) problem is a fundamental one in CAD/CAM. Tracing methods are widely applied for solving the SSI problem, where branch jumping and branch-missing are two of the challenging things. This paper takes the intersection problem between two parametric surfaces as an example and presents an SRS-BFS method based on the Dixon matrix technique, which turns the tracing process into a simple root-solving (SRS) problem and introduces breadth-first searching (BFS) method for solving branch points robustly. Moreover, it provides an Edge-Chain-Tracing (ECT) method to further improve the tracing efficiency. Extensive experiments have been conducted on various surfaces and their floating-point representations are used as well. These examples have covered rich intersection curve topology with multiple branches and singular points. All examples show that the SRS-BFS method can avoid branch jumping problem, and achieves higher efficiency and robustness, even with their floating-point representation and a given tolerance.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An Efficient and Robust Tracing Method Based on Matrix Representation for Surface-Surface Intersection

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Hongyu Chen,
  • Xiao-Diao Chen

摘要

The surface-surface intersection (SSI) problem is a fundamental one in CAD/CAM. Tracing methods are widely applied for solving the SSI problem, where branch jumping and branch-missing are two of the challenging things. This paper takes the intersection problem between two parametric surfaces as an example and presents an SRS-BFS method based on the Dixon matrix technique, which turns the tracing process into a simple root-solving (SRS) problem and introduces breadth-first searching (BFS) method for solving branch points robustly. Moreover, it provides an Edge-Chain-Tracing (ECT) method to further improve the tracing efficiency. Extensive experiments have been conducted on various surfaces and their floating-point representations are used as well. These examples have covered rich intersection curve topology with multiple branches and singular points. All examples show that the SRS-BFS method can avoid branch jumping problem, and achieves higher efficiency and robustness, even with their floating-point representation and a given tolerance.