(Deterministic) algorithms that compute the volume of polytopes

Mark J. Kaiser · International Journal of Mathematical Education in Science and Technology · 1997

The geometry and structure of w‐dimensions intrigues and perplexes the imagination. In this paper one aspect of n‐dimensional geometry, namely, volume computation, is examined. Deterministic algorithms that compute the volume of polytopes in Euclidean space are described in a general framework, and the two and three‐dimensional cases are illustrated by example.

Read the paper · More papers on PaperTik