An efficient algorithm for obtaining the volume of a special kind of pyramid and application to convex polyhedra
HTML articles powered by AMS MathViewer
- by Ted Speevak PDF
- Math. Comp. 46 (1986), 531-536 Request permission
Abstract:
An efficient method is given for obtaining the volume of a pyramid of species $n - 2$ whose base is a convex polygon. The pyramid is "transformed" into a simplex whose volume is computed directly. A refinement is provided to the Cohen-Hickey method for determining volumes of convex polyhedra.References
- Jacques Cohen and Timothy Hickey, Two algorithms for determining volumes of convex polyhedra, J. Assoc. Comput. Mach. 26 (1979), no. 3, 401–414. MR 535261, DOI 10.1145/322139.322141
- D. M. Y. Sommerville, An introduction to the geometry of $n$ dimensions, Dover Publications, Inc., New York, 1958. MR 0100239 B. Von Hohenbalken, Research Paper No. 79-17, How to Simplicially Partition a Polytope. Presented at the Tenth International Symposium on Mathematical Programming, Montreal, Canada, August 1979.
- B. von Hohenbalken, Finding simplicial subdivisions of polytopes, Math. Programming 21 (1981), no. 2, 233–234. MR 623842, DOI 10.1007/BF01584244
Additional Information
- © Copyright 1986 American Mathematical Society
- Journal: Math. Comp. 46 (1986), 531-536
- MSC: Primary 52A25; Secondary 52-04
- DOI: https://doi.org/10.1090/S0025-5718-1986-0829623-3
- MathSciNet review: 829623