Una paral·lelització SIMD de la conversió d'objectes codificats segons el model de fronteres al model d'octrees clàssics
In this work a new SIMD parallel algorithm to generate Classical Octrees from Boundary Representations is presented. The algorithm consists of two main steps. First all the grey terminal nodes in the final octree are determined and encoded in parallel. Then the whole tree is deduced in parallel from...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1994 |
| 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/97300 |
| Acceso en línea: | https://hdl.handle.net/2117/97300 |
| Access Level: | acceso abierto |
| Palabra clave: | SIMD Parallel algorithm Classical octrees generation Boundary representations Àrees temàtiques de la UPC::Informàtica::Programació |
| Sumario: | In this work a new SIMD parallel algorithm to generate Classical Octrees from Boundary Representations is presented. The algorithm consists of two main steps. First all the grey terminal nodes in the final octree are determined and encoded in parallel. Then the whole tree is deduced in parallel from the codes determined in the first step in a bottom-top manner. |
|---|