Engineering with Computers

, Volume 6, Issue 1, pp 17–29 | Cite as

Symbolic analysis of linear polyhedra

  • Carlo Cattani
  • Alberto Paoluzzi
Article

Abstract

This paper concerns several analytical problems related to linear polyhedra in euclidean three-dimensional-space. Symbolic formulas for line, surface, and volume integration are given, and it is shown that domain integrals are computable in polynomial time. In particular, it is shown that mass, first and second moments, and products of inertia are computable inO(E) time, whereE is the number of edges of the boundary. Simple symbolic expressions for the normal derivatives of domain integrals are also derived. In particular, it is shown that they are closely linked to the topology of the integration domain, as well as that they are expressible as combinations of domain integrals over lower-order domains (faces, edges, and vertices). The symbolic results presented in this paper may lead to an easy incorporation of integral constraints, for example, concerning mass and inertia, in the engineering designing process of solid objects.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lee, Y.T.; Requicha, A.A.G. (1982) Algorithms for computing the volume and other integral properties of solids. I. Known methods and open issues. Commun. ACM 25(9), 635–641, SeptemberGoogle Scholar
  2. 2.
    Timmer, H.G.; Stern J.M. (1980) computation of global geometric properties of solid objects. Compu. Aided Des. 12(6), 301–304Google Scholar
  3. 3.
    Lien, S.; Kajiya, J.T. (1984) A symbolic method for calculating the integral properties of arbitrary nonconvex polyhedra. IEEE Comput. Graph. Appl. 4(9), 35–41, OctoberGoogle Scholar
  4. 4.
    Cattani, C.; Paoluzzi, A. (1987) Finite integration method on a boundary representation of homogeneous polyhedra. Technical Report RAP-11-87, Dipartimento di Informatica e Sistemistica, Univ. “La Sapienza,” Rome, AprilGoogle Scholar
  5. 5.
    Cattani, C.; Paoluzzi, A. (1988) Analytical tools in variational geometry of linear polyhedra. Technical Report RAP-29–88, Dipartimento di Informatica e Sistemistica, Univ. “La Sapienza,” Rome, DecemberGoogle Scholar
  6. 6.
    Paoluzzi, A. (1987) Integration constraints in parametric design of physical objects. Technical Report TR 87-804, Department of Computer Science, Cornell University, Ithaca, NY, JanuaryGoogle Scholar
  7. 7.
    Morteson, M.E. (1985) Geometric Modeling. New York: John WileyGoogle Scholar
  8. 8.
    Lee, Y.T.; Requicha, A.A.G. (1982) Algorithms for computing the volume and other integral properties of solids. II. A family of algorithms based on representation conversion and on cellular approximation. Commun. ACM 25(9), 642–650, SeptemberGoogle Scholar
  9. 9.
    Wilson, H.B. Jr; Farrior, D.S. (1976) Computation of geometrical and inertial properties for general areas and volumes of revolution. Comput. Aided Des. 8(4), 257–263, OctoberGoogle Scholar
  10. 10.
    Cattani, C. (1986) Un metodo finito di integrazione per il calcolo delle proprietà inerziali di qualsiasi ordine di corpi a struttura omogenea. Technical Report RAP-02-86, Dipartimento di Informatica e Sistemistica, Univ. “La Sapienza,” Rome, AprilGoogle Scholar
  11. 11.
    Paoluzzi, A.; Ramella, M.; Santarelli, A. Un modellatore geometrico su rappresentazioni triango-alate. Technical Report RAP-13-86, Dipartimento di Informatica e Sistemistica, Univ. “La Sapienza,” Rome, JuneGoogle Scholar
  12. 12.
    Paoluzzi, A.; Ramella, M.; Santarelli, A. (1989) A Boolean algebra over linear polyhedra. Comput. Aided Des. 21(8), 474–484, OctoberGoogle Scholar
  13. 13.
    Baumgart, B.G. (1972) Winged-edge polyhedron representation. Technical Report CS 320, Department of Computer Science, Stanford UniversityGoogle Scholar
  14. 14.
    Apostol, T.M. (1962) Calculus. New York: Blaisdell Publishing Co.Google Scholar
  15. 15.
    Woo, T.C. (1985) A combinatorial analysis of boundary data structure schemata. IEEE Comput. Graph. Appl. 5(3), 19–28Google Scholar
  16. 16.
    Borning A. (1981) The programming language aspects of ThingLab, a constraint-oriented simulation laboratory. ACM Trans. Program. Lang. Syst. 17, 357–387Google Scholar
  17. 17.
    Bruderlin, B. (1985) Using prolog for constructing geometric models defined by constraints. In: Proceedings of EuroCal 85Google Scholar
  18. 18.
    Barford, L.A. (1986) Representing generic solid models by constraints. Technical Report TR 86–801, Department of Computer Science, Cornell University, Ithaca, NY, DecemberGoogle Scholar
  19. 19.
    Sutherland, I.E. (1963) Sketchpad: A man-machine graphical communication system. Technical Report TR 296, Lincoln Laboratories, MITGoogle Scholar
  20. 20.
    Ambler, A.P.; Popplestone R.J. (1975) Inferring the position of bodies from specified spatial relationships. Artif. Intell. 6, 157–174Google Scholar
  21. 21.
    Light, R.; Gossard, D. (1982) Modification of geometric models through variational geometry. Comput. Aided Des. 14(4), 209–214, JulyGoogle Scholar

Copyright information

© Springer-Verlag New York Inc 1990

Authors and Affiliations

  • Carlo Cattani
    • 1
  • Alberto Paoluzzi
    • 2
  1. 1.Dip. di MatematicaUniversità “La Sapienza”RomaItalia
  2. 2.Dip. di Informatica e SistemisticaUniversità “La Sapienza”RomaItalia

Personalised recommendations