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 prepro...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1998 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/84550 |
| Acceso en línea: | https://hdl.handle.net/2117/84550 |
| Access Level: | acceso abierto |
| Palabra clave: | Visibility octree 3D navigation Àrees temàtiques de la UPC::Informàtica::Infografia |
| Sumario: | 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. |
|---|