L'algorisme de visualització per partició binaria de l'espai
This work presents the Binary Space Partition algorithm for the visualization of polyedric scenes (BSP algorithm, Fuchs 1980). It also includes the criteria for the election of the root face. The complexity of the involved algorithms is studied. A new algorithm for choosing the root face of the subt...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1989 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | catalán |
| OAI Identifier: | oai:upcommons.upc.edu:2117/190612 |
| Acceso en línea: | https://hdl.handle.net/2117/190612 |
| Access Level: | acceso abierto |
| Palabra clave: | Computer algorithms Partició binaria de l'espai Algorismes computacionals Àrees temàtiques de la UPC::Informàtica |
| Sumario: | This work presents the Binary Space Partition algorithm for the visualization of polyedric scenes (BSP algorithm, Fuchs 1980). It also includes the criteria for the election of the root face. The complexity of the involved algorithms is studied. A new algorithm for choosing the root face of the subtrees is presented and discussed. The performance of the algorithm is presented through seven examples. |
|---|