.png){kind=icon}
返回
Topological structure extraction for computing surface-surface intersection curves
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-024-03616-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Surface-surface intersection curve computation is a fundamental problem in CAD and solid modeling. Extracting the structure of intersection curves accurately, especially when there are multiple overlapping curves, is a key challenge. Existing methods rely on densely sampled intersection points and proximity-based connections, which are time-consuming to obtain. In this paper, we propose a novel method based on Delaunay triangulation to accurately extract intersection curves, even with sparse intersection points. We also introduce an intersection curve optimization technique to enhance curve accuracy. Extensive experiments on various examples demonstrate the effectiveness of our method.
Keyword:
Surface-surface intersection
Minimum spanning tree
Delaunay triangulation
Curve approximation
期刊
IF:
2.9
论文数:
4.6K
被引数:
6.5K
机构
引用论文
.png){kind=icon}
Physical activity, leisure-time, cognition and academic grades: Connections and causal effects in Chinese students身体活动、闲暇时间、认知能力和学业成绩：中国学生的关联与因果效应
PREAI
分享收藏分享收藏
查看更多内容