Abstract
Face traverses for triangular polyhedra arise in computing the volume of a polyhedron with given vertices. More general volume problems can often be reduced to such a calculation. For triangular polyhedra the expression for volume can be considerably simplified if a face traverse is known. We provide an example which shows that not every triangular polyhedron has a face traverse. In many applications however, a face traverse is readily available. We give an algorithm for computation of the volume of a triangular polyhedron in terms of the vertices, utilizing a traverse of the faces.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Stone, M. G., A mnemonic for areas of polygons, MAA Monthly, vol.93, No.6(1986), 479–480.
Tutte, W. T., On Hamiltonian circuits, J. London Math. Soc. 21(1946), 98–101.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schaer, J., Stone, M.G. (1991). Face traverses and a volume algorithm for polyhedra. In: Maurer, H. (eds) New Results and New Trends in Computer Science. Lecture Notes in Computer Science, vol 555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038197
Download citation
DOI: https://doi.org/10.1007/BFb0038197
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54869-0
Online ISBN: 978-3-540-46457-0
eBook Packages: Springer Book Archive