\( \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.13.1 - Spatial Sorting
Bibliography
[1]

Nina Amenta, Sunghee Choi, and Günter Rote. Incremental constructions con BRIO. In Proc. 19th Annu. Sympos. Comput. Geom., pages 211–219, 2003.

[2]

D. Bertsimas and M. Grigni. On the space-filling curve heuristic for the euclidean traveling salesman problem. Operations Research Letters, 8:241–244, 1989.

[3]

Arthur Butz. Alternative algorithm for Hilbert's space-filling curve. IEEE Transactions on computers, pages 424–425, 1971.

[4]

L. K. Platzman and J. J. Bartholdi, III. Spacefilling curves and the planar travelling salesman problem. J. ACM, 36(4):719–737, October 1989.