An efficiency analysis of the Visibility Matrix determination algorithm will be introduced in this paper. Algorithm is compared with reference to two space subdivision schemes. The space that encloses considered objects is partitioned into regular or octree grid. The Visibility Matrix defines whether nodes of given objects see each other. It is a result of detection process whether along straight line between selected two nodes there is no concealing them elements. Further sections describe in details space subdivision schemes, summary of the Visibility Matrix algorithm and results for given objects (two spheres).
展开▼
