| Revue: | Computación y sistemas |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000423234 |
| ISSN: | 1405-5546 |
| Autores: | Cruz Matías, Irving1 Ayala, Dolors2 |
| Instituciones: | 1Universidad de Monterrey, San Pedro Garza García, Nuevo León. México 2Universidad Politécnica de Cataluña, Barcelona. España |
| Año: | 2017 |
| Periodo: | Abr-Jun |
| Volumen: | 21 |
| Número: | 2 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Experimental, aplicado |
| Resumen en inglés | This paper presents in detail the Compact Union of Disjoint Boxes (CUDB), a decomposition model for binary volumes that has been recently but briefly introduced. This model is an improved version of a previous model called Ordered Union of Disjoint Boxes (OUDB). We show here, several desirable features that this model has versus OUDB, such as less unitary basic elements (boxes) and thus, a better efficiency in some neighborhood operations. We present algorithms for conversion to and from other models, and for basic computations as area (2D) or volume (3D). We also present an efficient algorithm for connected-component labeling (CCL) that does not follow the classical two-pass strategy. Finally we present an algorithm for collision (or adjacency) detection in static environments. We test the efficiency of CUDB versus existing models with several datasets |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Procesamiento de datos, Procesamiento de imágenes, Volúmenes binarios, Polihedros ortogonales, Detección de colisiones |
| Keyword: | Data processing, Image processing, Binary volumes, Orthogonal polyhedra, Collision detection |
| Texte intégral: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
