We present the visibility octree, a new data structure to accelerate
3D navigation through very complex scenes. Our approach employs a
conservative visibility technique to compute an approximation to the
visibility space partition. This approximation is computed and
stored hierarchically at a preprocessing stage. We believe its main
contribution to be its ability to provide an effective control over
the coarseness of the approximation. A preliminary test with some
randomly generated indoor scenes seems to show that the visibility
octree will perform well on densely occluded scenes.
CitationSaona, C., Navazo, I., Brunet, P. "Data structures and algorithms for navigation in highly polygon-populated scenes". 1998.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org