The Visibility Octree. a Data Structure for 3d Navigation 1
نویسنده
چکیده
This paper describes the Visibility Octree, a data structure to accelerate 3D navigation through very complex scenes. A conservative visibility algorithm that computes and hierarchically stores the structure at a preprocessing stage is presented. The Visibility Octree is used during navigation and its main contribution is its ability to provide an eeective control over the coarseness of the visibility approximation. Tests with indoor ship scenes show that the visibility octree performs well on densely occluded environments.
منابع مشابه
The visibility octree: a data structure for 3D navigation
This paper describes the Visibility Octree, a data structure to accelerate 3D navigation through very complex scenes. A conservative visibility algorithm that computes and hierarchically stores the structure at a preprocessing stage is presented. The Visibility Octree is used during navigation and its main contribution is its ability to provide an eeective control over the coarseness of the vis...
متن کاملData Structures and Algorithms for Navigation in Highly Polygon-populated Scenes
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 eeective control ...
متن کاملdesigning and implementing a 3D indoor navigation web application
During the recent years, the need arises for indoor navigation systems for guidance of a client in natural hazards and fire, due to the fact that human settlements have been complicating. This research paper aims to design and implement a visual indoor navigation web application. The designed system processes CityGML data model automatically and then, extracts semantic, topologic and geometric...
متن کاملQuadtree and Octree Grid Generation
Engineering analysis often involves the accurate numerical solution of boundary value problems in discrete form. Hierarchical quadtree (or octree) grid generation offers an efficient method for the spatial discretisation of arbitrary-shaped two- (or three-) dimensional domains. It consists of recursive algebraic splitting of sub-domains into quadrants (or cubes), leading to an ordered hierarchi...
متن کاملAn Effective Load Balancing Scheme for 3D Texture-Based Sort-Last Parallel Volume Rendering on GPU Clusters
We present an adaptive dynamic load balancing scheme for 3D texture based sort-last parallel volume rendering on a PC cluster equipped with GPUs. Our scheme exploits not only task parallelism but also data parallelism during rendering by combining the hierarchical data structures (octree and parallel BSP tree) in order to skip empty regions and distribute proper workloads to rendering nodes. Ou...
متن کامل