\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.6.1 - Optimal Distances
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Bibliographic References
[1]

A. Aggarwal, M. M. Klawe, S. Moran, P. W. Shor, and R. Wilber. Geometric applications of a matrix-searching algorithm. Algorithmica, 2:195–208, 1987.

[2]

Bernd Gärtner and Svend Schönherr. An efficient, exact, and generic quadratic programming solver for geometric optimization. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 110–118, 2000.