CGAL 4.10.1 - 2D Range and Neighbor Search: Bibliographic References

Processing math: 100%

$\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.10.1 - 2D Range and Neighbor Search

•All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages

CGAL 4.10.1 - 2D Range and Neighbor Search

[1]

Kurt Mehlhorn and Stefan Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000.