CGAL 4.7 - Bounding Volumes
|
G. N. Frederickson and D. B. Johnson. Finding kth paths and p-centers by generating and searching good data structures. J. Algorithms, 4:61–80, 1983.
G. N. Frederickson and D. B. Johnson. Generalized selection and ranking: sorted matrices. SIAM J. Comput., 13:14–30, 1984.
B. Gärtner and S. Schönherr. Exact primitives for smallest enclosing ellipses. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 430–432, 1997.
J. Matou v sek, Micha Sharir, and Emo Welzl. A subexponential bound for linear programming. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 1–8, 1992.
Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, and Brian L. Evans. Minimal enclosing parallelogram with application. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages C34–C35, 1995.
G. T. Toussaint. Solving geometric problems with the rotating calipers. In Proc. IEEE MELECON '83, pages A10.02/1–4, 1983.
A. Vainshtein. Finding minimal enclosing parallelograms. Diskretnaya Matematika, 2:72–81, 1990. In Russian.
Emo Welzl. Smallest enclosing disks (balls and ellipsoids). In H. Maurer, editor, New Results and New Trends in Computer Science, volume 555 of Lecture Notes Comput. Sci., pages 359–370. Springer-Verlag, 1991.