Computing Maximum-Area Sections of Convex Polyhedra

Introduction

Definitions

Background

Algorithms

Extensions

Applet

References

References

[1] D. Avis, P. Bose, T. C. Shermer, J. Snoeyink, G. Toussaint and B. Zhu. On the sectional area of convex polytopes. In Proceedings of the 12th Annual Symposium on Computational Geometry, pp. C11--C12, Philadelphia, USA, 1996.

[2] J. O'Rourke. Computational Geometry in C, 2nd Edition. Cambridge, UK: Cambridge University Press, 1998.

[3] R. J. Gardner. The Brunn-Minkowski inequality. Bulletin of the American Mathematical Society, 39(3): 355--405, 2002.

[4] T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein. Introduction to Algorithms, 2nd Edition. Cambridge, USA: MIT Press and McGraw-Hill, 2001.

[5] B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM Journal on Computing 21(4): 671--696, 1992.