Home
• Get access
• Print publication year: 2004
• Online publication date: February 2010

# 14 - Data structures

## Summary

So far we have dealt mainly with the theoretical background of scattered data approximation and interpolation. Except for the moving least squares approximation we have not discussed an efficient implementation of our theory. But from the investigation of the condition number of straightforward interpolation matrices we know that special techniques have to be developed to get an efficient but still accurate approximation method. Several approaches will be discussed in the next chapter.

Crucial to all these methods is the choice of the underlying data structure. It is worth reflecting for a while on how the centers can be stored in a computer most successfully. Thus, in this chapter we will discuss different ways of representing the centers X = {x1, …, xN} ⊆ Ω ⊆ ℝd.

Let us start by collecting possible requests about the set of points X that the data structure should be able to answer efficiently.

The first question every user has to answer is whether all points should be kept in the main memory of the computer or whether the number of points is so large that it has to be stored on a hard disk or other external device. The difference is that in the latter case a reasonable ordering of the data points reduces the number of disk accesses, resulting in a dramatic reduction in run time. There is also an improvement in the first situation by a reasonable ordering, because of the cache of the computer, but it is not dramatic. We will concentrate on the situation where all points can be kept in the main memory of the computer.