Optimised scanning of a visibility graph data structure for efficient ray-tracing

An efficient way to implement a ray tracing is to use the visibility relations between geometric primitives, as in Hoppe´s work. Authors present a novel approach subdivided in two steps. First, a graph is computed to encode the visibility relations. This preprocess is easier and less restrictive than the Hoppe´s one. Moreover, the computation precision can be tuned to satisfy a required accuracy, or the scene complexity. Secondly, an optimised graph scanning is used to reduce the computation time of the deterministic ray tracing. An interesting property is that the graph scanning does not have any impact on the calculation accuracy. As a consequence, the precision wanted by the user is preserved. In addition, it can be used in conjunction with other techniques to speed-up again the computation. This leads to a flexible tool able to compute efficiently and precisely coverage zone and impulse responses, as needed for channel characterization for instance