Til hovedinnhold

Approximate implicitization and recursive surface intersection algorithms

Approximate implicitization and recursive surface intersection algorithms

Kategori
Vitenskapelig artikkel
Sammendrag
Most published work on intersection algorithms for Computer Aided Design (CAD) systems addresses transversal intersections [1], situations where the surface normals of the surfaces intersected are well separated along all intersection curves. For transversal intersections the divide and conquer strategy of recursive subdivision, Sinha's theorem [2] and the convex hull property of NonUniform Rational B-Spline surfaces (NURBS) efficiently identify all intersection branches. However, in singular or near singular intersections, situations where the surfaces are parallel or near parallel in an intersection region, along an intersection curve or in an intersection point, even deep levels of subdivision will frequently not sort out the intersection topology. The paper will focus on the novel approach of Approximate Implicitization to address these challenges.
Språk
Norsk
Forfatter(e)
Institusjon(er)
  • SINTEF Digital / Mathematics and Cybernetics
År
Publisert i
Proceedings in Applied Mathematics and Mechanics : PAMM
ISSN
1617-7061
Årgang
7
Hefte nr.
1
Side(r)
1022203 - 1022204