In Information Visualization, adding and removing data elements can strongly impact the underlying visual space. We introduce a chess board analogy for displaying (projecting) objects from a dynamic set on a 2D space, considering their similarity in a higher dimensional space. Our solution is inherently incremental and maintains a coherent disposition of elements, even for completely renewed sets. The algorithm considers relative positions, rather than raw dissimilarity. It has low computational cost, and its complexity depends only on the size of the currently viewed subset, V . Thus, a set of size N can be sequentially displayed in O(N) time, reaching at most O(N2 ) only if viewing the whole set at once. Consistent results were obtained as compared to (nonincremental) multidimensional scaling solutions. Moreover, the corresponding visualization is not susceptible to occlusion. The technique was tested in different domains, being particularly adequate to display dynamic corpora. Cat...