
Journal for Geometry and Graphics 27 (2023), No. 1, 001009 Copyright Heldermann Verlag 2023 Volume of an nDimensional Polyhedron: Revisited Abhijit Bhattacharya B.P.Poddar Inst. of Management and Technology, Kolkata, India bhattaabhi14@gmail.com Kamlesh Kumar Dubey Invertis University, Bareilly, Uttar Pradesh, India kkdubey4maths@gmail.com Bikromadittya Mondal B.P.Poddar Inst. of Management and Technology, Kolkata, India bikmondal@gmail.com The paper presents a computational technique to determine the volume of an ndimensional polyhedron. Initially, the volume is computed for an ndimensional simplex which is used later to calculate the volume of an arbitrary polytope using the method of signed simplex decomposition. A recursive algorithm is used to compute the volume in n dimensions. The proposed algorithm not only calculates the volume efficiently but also avoids complex calculations in higher dimensions. Keywords: CayleyMenger determinant, simplex, inradius, circumradius, face angles. MSC: 51M04; 51M05. [ Fulltextpdf (389 KB)] 