.png){kind=icon}
Return
Computing the Intersection of Two Rational Surfaces Using Matrix Representations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cad.2022.103303.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The surface-surface intersection computation is fundamental to CAD/CAM, since it is crucial to boundary representation, mesh generation, rendering, hidden surface removal and CNC machining. In this paper, we present an efficient algorithm for computing the intersection of two rational parametric surfaces, which is an algebraic technique based on a hybrid of a matrix-representation and a hierarchical lattice method. Given two rational surfaces, the Dixon matrix representation of one surface is first constructed; then the marching squares technique is applied on lattices of the parametric domain of the other surface to extract the intersection points. Extensive experiments have been conducted on various surfaces, including Utah teapot patches and some classic surfaces that have complex self-intersection features. These examples have covered rich intersection curve topology with multiple branches and singular points. All examples show that our algorithm is efficient and numerically stable. (C) 2022 Elsevier Ltd. All rights reserved.
Keywords:
Rational surface
Intersection
Matrix representation
Marching squares
Journal
C
IF:
3.1
Papers:
3.2K
Citations:
6.4K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSave
ShareSave
View more