Vis enkel innførsel

dc.contributor.authorDokken, Tor
dc.date.accessioned2017-02-13T13:22:11Z
dc.date.available2017-02-13T13:22:11Z
dc.date.created2015-09-24T20:54:53Z
dc.date.issued2007
dc.identifier.citationNon-linear Computational Geometrynb_NO
dc.identifier.urihttp://hdl.handle.net/11250/2430587
dc.description.abstractWhen developing CAD-type intersection algorithms for NonUniform Rational B-splines surfaces (NURBS) is important to ensure that the algorithm identifies all intersection branches. For transversal intersections this is fairly straight forward. For singular or near singular intersection, when the surfaces are close and near parallel, the traditional approach of recursive subdivision does not suffice on its own. The use of algebraic surfaces to separate near parallel not intersecting surfaces reduces the depth of recursion. Approximate implicitization denotes methods that approximate piecewise parametric manifolds p(s) with an algebraic hypersurface q(x)=0. The talk will address the approach to approximate implicitization already published by the author and further report on how approximate implicitization has helped the development of a CAD-type intersection algorithms addressing self-intersecting CAD-surfaces, and singular and near singular intersection of NURBS surfaces. 
dc.description.abstractApproximate implicitization and CAD-type intersection algorithms
dc.language.isoengnb_NO
dc.titleApproximate implicitization and CAD-type intersection algorithmsnb_NO
dc.typeLecturenb_NO
dc.identifier.cristin1272929
cristin.unitcode7401,90,11,0
cristin.unitnameAnvendt matematikk
cristin.ispublishedtrue
cristin.fulltextpostprint


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel