CGAL 5.1 - Optimal Bounding Box
Bibliography
[1]

Chia-Tche Chang, Bastien Gorissen, and Samuel Melchior. Fast oriented bounding box optimization on the rotation group so (3, R). ACM Transactions on Graphics (TOG), 30(5):1–16, 2011.

[2]

Mehdi Jazayeri, Rüdiger Loos, and David R. Musser, editors. Generic Programming, International Seminar on Generic Programming, Dagstuhl Castle, Germany, April 27 - May 1, 1998, Selected Papers, volume 1766 of Lecture Notes in Computer Science. Springer, 2000.

[3]

John A Nelder and Roger Mead. A simplex method for function minimization. The computer journal, 7(4):308–313, 1965.

[4]

Joseph O'Rourke. Finding minimal enclosing boxes. International journal of computer & information sciences, 14(3):183–199, 1985.

[5]

Godfried T Toussaint. Solving geometric problems with the rotating calipers. In Proc. IEEE Melecon, volume 83, page A10, 1983.

[6]

Jan Vahrenhold, editor. Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings, volume 5526 of Lecture Notes in Computer Science. Springer, 2009.