An efficient algorithm for obtaining the volume of a special kind of pyramid and application to convex polyhedra
暂无分享,去创建一个
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.
[1] Balder Von Hohenbalken. Finding simplicial subdivisions of polytopes , 1981, Math. Program..
[2] C. L. E. Moore,et al. Review: D. M. Y. Sommerville, An Introduction to the Geometry of $n$ Dimensions , 1930 .
[3] H. Piaggio. An Introduction to the Geometry of N Dimensions , 1930, Nature.
[4] Jacques Cohen,et al. Two Algorithms for Determining Volumes of Convex Polyhedra , 1979, JACM.