Abstract

In Scientific Computing, space-filling curves are quite commonly used as tools to improve certain properties of data structures or algorithms, or even to provide or simplify algorithmic solutions to particular problems. In the first chapter we will pick out two simple examples – both related to data structures and algorithms on computational grids – to introduce typical data structures and related properties and problems that can be tackled by using space-filling curves.

F. Alauzet and A. Loseille. On the use of space filling curves for parallel anisotropic mesh adaptation. In Proceedings of the 18th International Meshing Roundtable, pages 337–357. Springer, 2009.Google Scholar

I. Kamel and C. Faloutsos. On packing R-trees. In Proceedings of the Second International ACM Conference on Information and Knowledge Management, pages 490–499. ACM New York, 1993.Google Scholar

147.

E. Kawaguchi and T. Endo. On a method of binary-picture representation and its application to data compression. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-2(1):27–35, 1980.Google Scholar

148.

A. Klinger. Data structures and pattern recognition. In Proceedings of the First International Joint Conference on Pattern Recognition, pages 497–498. IEEE, 1973.Google Scholar

F. Ramsak, V. Markl, R. Fenk, Elhardt K., and R. Bayer. Integrating the UB-tree into a database system kernel. In Proceedings of the 26th International Conference on Very Large Databases, pages 263–272, 2000.Google Scholar

H. Sagan. Some reflections on the emergence of space-filling curves. Journal of the Franklin Institute, 328:419–430, 1991.Google Scholar

231.

H. Sagan. On the geometrization of the Peano curve and the arithmetization of the Hilbert curve. International Journal of Mathematical Education in Science and Technology, 23(3):403–411, 1992.Google Scholar