An efficient method to integrate polynomials over polytopes and curved solids

DOI10.1016/j.cagd.2020.101914zbMath1450.65027OpenAlexW3043834975MaRDI QIDQ2005155

Eric B. Chin, N. Sukumar

Publication date: 7 October 2020

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2020.101914

zbMATH Keywords

Euler's homogeneous function theoremBézier trianglesNURBS surfacespolyhedral mass properties

Mathematics Subject Classification ID

Numerical integration (65D30)

Related Items (7)

Geometrical discretisations for unfitted finite elements on explicit boundary representations ⋮ Robust numerical integration on curved polyhedra based on folded decompositions ⋮ First Moments of a Polyhedron Clipped by a Paraboloid ⋮ Virtual elements on agglomerated finite elements to increase the critical time step in elastodynamic simulations ⋮ Adaptive quadrature/cubature rule: application to polytopes ⋮ Tangled finite element method for handling concave elements in quadrilateral meshes ⋮ Scaled boundary cubature scheme for numerical integration over planar regions with affine and curved boundaries

Uses Software

• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• The finite cell method: a review in the context of higher-order structural analysis of CAD and image-based geometric models
• On the flexibility of agglomeration based physical space discontinuous Galerkin discretizations
• An accurate, robust, and easy-to-implement method for integration over arbitrary polyhedra: application to embedded interface methods
• Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
• Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
• The finite cell method for three-dimensional problems of solid mechanics
• Pythagorean-hodograph curves. Algebra and geometry inseparable
• The octant of a sphere as a non-degenerate triangular Bézier patch
• Fast numerical integration on polytopic meshes with applications to discontinuous Galerkin finite element methods
• Software for exact integration of polynomials over polyhedra
• Extended virtual element method for the Laplace problem with singularities and discontinuities
• A high-order discontinuous Galerkin method for level set problems on polygonal meshes
• Quadrature schemes for arbitrary convex/concave volumes and integration of weak form in enriched partition of unity methods
• Geometric integration over irregular domains with application to level-set methods
• On calculating with B-splines
• The mimetic finite difference method for elliptic problems
• The extended/generalized finite element method: An overview of the method and its applications
• Strong and weak arbitrary discontinuities in spectral finite elements
• High degree efficient symmetrical Gaussian quadrature rules for the triangle
• Integration and homogeneous functions
• Integration on a convex polytope
• BASIC PRINCIPLES OF VIRTUAL ELEMENT METHODS
• A finite element method for crack growth without remeshing
• hp-Version discontinuous Galerkin methods on polygonal and polyhedral meshes
• The Numerical Evaluation of B-Splines

This page was built for publication: An efficient method to integrate polynomials over polytopes and curved solids