8.8 Greeking

The preceding algorithm is not really valid for two reasons:

1. If we deal with circular denotators, recursion may crash in an infinite loop.
2. The user may not be interested in all the denotator details of any depth.

This can be solved by a greeking procedure which consists in identifying recursive levels beyond a user-defined greeking number. We omit this refinement which has however been implemented in the present PrimaVista Browser.

9 Visualization

The vectorial output of the folding map on the denotator set must be realized on a 3D object environment. To this end, each vector is interpreted as a vector of attributes of a multimedia object. In order to provide us with a generic form where such multimedia objects