.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
algebraic curve
curve-surface intersection
curve tracing
eigenvalues
loop detection
matrices
singular points
surface-surface intersection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.5
Papers:
4.7K
Citations:
3.6W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveInfluenza infection modulates vesicular trafficking and induces Golgi complex disruption.png)
VirusDiseaseOAAI
VirusDiseaseIF0
OAAIShareSaveShareSave
View more