Show simple item record

dc.contributor.authorBarendrecht, P.
dc.contributor.authorKosinka, J.
dc.contributor.authorBarton, M. 
dc.date.accessioned2018-06-18T11:54:43Z
dc.date.available2018-06-18T11:54:43Z
dc.date.issued2018-10
dc.identifier.issn0045-7825
dc.identifier.urihttp://hdl.handle.net/20.500.11824/816
dc.description.abstractWe introduce a new approach to numerical quadrature on geometries defined by subdivision surfaces based on quad meshes in the context of isogeometric analysis. Starting with a sparse control mesh, the subdivision process generates a sequence of finer and finer quad meshes that in the limit defines a smooth subdivision surface, which can be of any manifold topology. Traditional approaches to quadrature on such surfaces rely on per-quad integration, which is inefficient and typically also inaccurate near vertices where other than four quads meet. Instead, we explore the space of possible groupings of quads and identify the optimal macro-quads in terms of the number of quadrature points needed. We show that macro-quads consisting of quads from one or several consecutive levels of subdivision considerably reduce the cost of numerical integration. Our rules possess a tensor product structure and the underlying univariate rules are Gaussian, i.e., they require the minimum possible number of integration points in both univariate directions. The optimal quad groupings differ depending on the particular application. For instance, computing surface areas, volumes, or solving the Laplace problem lead to different spline spaces with specific structures in terms of degree and continuity. We show that in most cases the optimal groupings are quad-strips consisting of $(1\times n)$ quads, while in some cases a special macro-quad spanning more than one subdivision level offers the most economical integration. Additionally, we extend existing results on exact integration of subdivision splines. This allows us to validate our approach by computing surface areas and volumes with known exact values. We demonstrate on several examples that our quadratures use fewer quadrature points than traditional quadratures. We illustrate our approach to subdivision spline quadrature on the well-known Catmull-Clark scheme based on bicubic splines, but our ideas apply also to subdivision schemes of arbitrary bidegree, including non-uniform and hierarchical variants. Specifically, we address the problems of computing areas and volumes of Catmull-Clark subdivision surfaces, as well as solving the Laplace and Poisson PDEs defined over planar unstructured quadrilateral meshes in the context of isogeometric analysis.en_US
dc.formatapplication/pdfen_US
dc.language.isoengen_US
dc.rightsReconocimiento-NoComercial-CompartirIgual 3.0 Españaen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/en_US
dc.subjectnumerical integrationen_US
dc.subjectsubdivision surfaceen_US
dc.subjectnon-tensor-product splinesen_US
dc.subjectGaussian quadrature rulesen_US
dc.subjectisogeometric analysisen_US
dc.titleEfficient quadrature rules for subdivision surfaces in isogeometric analysisen_US
dc.typeinfo:eu-repo/semantics/articleen_US
dc.identifier.doihttps://doi.org/10.1016/j.cma.2018.05.017
dc.relation.publisherversionhttps://www.sciencedirect.com/science/article/pii/S0045782518302627en_US
dc.relation.projectIDinfo:eu-repo/grantAgreement/MINECO//SEV-2013-0323en_US
dc.relation.projectIDinfo:eu-repo/grantAgreement/MINECO//MTM2016-76329-Ren_US
dc.relation.projectIDinfo:eu-repo/grantAgreement/Gobierno Vasco/BERC/BERC.2014-2017en_US
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessen_US
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersionen_US
dc.journal.titleComputer Methods in Applied Mechanics and Engineeringen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Reconocimiento-NoComercial-CompartirIgual 3.0 España
Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España