MDCO to B-Rep conversion algorithm
Spatial enumeration models are widely used in several fields. These models are approximate but the major disadvantage is the lack of concision. In order to avoid such verbosity, hierarchical encodings such as octrees have been proposed and several approaches include more information in order to redu...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1995 |
| 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/97103 |
| Acceso en línea: | https://hdl.handle.net/2117/97103 |
| Access Level: | acceso abierto |
| Palabra clave: | Spatial enumeration models Conversion algorithm Maximal division classical octrees Geometric modelling Octree representations Àrees temàtiques de la UPC::Informàtica::Infografia |
| Sumario: | Spatial enumeration models are widely used in several fields. These models are approximate but the major disadvantage is the lack of concision. In order to avoid such verbosity, hierarchical encodings such as octrees have been proposed and several approaches include more information in order to reduce the approximate character of the model. Maximal Division Classical Octrees are classical octrees with terminal grey nodes that contain part of the surface of the object. Conversion algorithms between representation models are necessary in order to exploit the advantages of each one. In this report an algorithm that converts from a MDCO model to a Boundary Representation model is presented. The algorithm is based on the classification of the terminal grey nodes according to the color of its grey vertices. Moreover, a non-iterative version of the general algorithm is proposed and implemented for the particular case of isothetic polyhedra. |
|---|