.png){kind=icon}
返回
An efficient surface intersection algorithm based on lower-dimensional formulation
.png){kind=icon}
OA
AI
DOI：10.1145/237748.237751.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our approach is based on combining the marching methods with the algebraic formulation. In particular, we propose a matrix representation for the intersection curve and compute it accurately using matrix computations. Ne present algorithms to compute a start point on each component of the intersection curve (both open and closed components), detect the presence of singularities, and find all the curve branches near the singularity. Ne also suggest methods to compute the step size during tracing to prevent component jumping. The algorithm runs an order of magnitude faster than previously published robust algorithms. The complexity of the algorithm is output sensitive.
Keyword:
algebraic curve
curve-surface intersection
curve tracing
eigenvalues
loop detection
matrices
singular points
surface-surface intersection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.7K
被引数:
3.6W
机构
暂无机构信息
引用论文
Influenza infection modulates vesicular trafficking and induces Golgi complex disruption.png)
VirusDiseaseOAAI
VirusDiseaseIF0
OAAI分享收藏
查看更多内容