Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Similars in SciELO
Share
Computación y Sistemas
On-line version ISSN 2007-9737Print version ISSN 1405-5546
Abstract
CRUZ-MATIAS, Irving and AYALA, Dolors. Compact Union of Disjoint Boxes: An Efficient Decomposition Model for Binary Volumes. Comp. y Sist. [online]. 2017, vol.21, n.2, pp.275-292. ISSN 2007-9737. https://doi.org/10.13053/cys-21-2-2737.
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.
Keywords : Binary volumes; orthogonal polyhedra; connected-component labeling; collision detection.