Each strategy decides, according to its own criteria which cell reduces disk accesses or improves the convergence of the radiosity algorithm. Once lighting simulation has been performed, the resulting cells are saved onto the disk so that they can be used later for an interactive walkthrough. The best of those algorithms is the one that we called traveling salesman. Moreover, our lighting simulation algorithm seemed to be easy to be implemented in parallel. Consequently, we devised a new parallel approach using this technique, allowing the lighting simulation to be computed on several processors simultaneously.
Processors can belong either to a parallel machine, a network of computers or both.
They only have to be able to access a common disk. Each processor is then responsible for the computation of a set of cells. The obtained results are also stored into a set of files, in order to enable the user to interactively walk through the environment once the lighting simulation is computed.