Elsevier

Computer-Aided Design

Volume 23, Issue 1, January–February 1991, Pages 51-58
Computer-Aided Design

Integration of polynomials over n-dimensional polyhedra

https://doi.org/10.1016/0010-4485(91)90081-7Get rights and content

Abstract

Explicit formulae and algorithms for computing integrals of polynomials over n-dimensional polyhedra are given. Two different approaches are discussed: one uses a decompositive representation, while the other one uses a boundary representation of the polyhedron. The algorithms are followed by a discussion of the complexity. In the appendix the pseudo-code and some examples of calculation are given.

References (9)

  • C. Cattani et al.

    Boundary integration over linear polyhedra

    Comput.-Aided Des.

    (March 1990)
  • Y.T. Lee et al.

    Algorithms for computing the volume and other integral properties of solids: I: known methods and open issues

    Commun. ACM

    (September 1982)
  • L.K. Putnam et al.

    Boolean operations on n-dimensional objects

    IEEE Comput. Graph. & Appl.

    (1986)
  • V. Ferrucci et al.

    Extrusion and Boundary Evaluation for Multidimensional Polyhedra Comput.

    Aided Des.

    (1990)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1991 Published by Elsevier Ltd.