Compact union of disjoint boxes: An efficient decomposition model for binary volumes

View/Open
Document typeArticle
Defense date2017
Rights accessOpen Access
Abstract
This paper presents in detail the CompactUnion of Disjoint Boxes (CUDB), a decomposition modelfor binary volumes that has been recently but brieflyintroduced. This model is an improved version of aprevious model called Ordered Union of Disjoint Boxes(OUDB). We show here, several desirable features thatthis model has versus OUDB, such as less unitary basicelements (boxes) and thus, a better efficiency in someneighborhood operations. We present algorithms forconversion to and from other models, and for basiccomputations as area (2D) or volume (3D). We alsopresent an efficient algorithm for connected-componentlabeling (CCL) that does not follow the classical two-passstrategy. Finally we present an algorithm for collision (oradjacency) detection in static environments. We test theefficiency of CUDB versus existing models with severaldatasets.
CitationCruz , I., Ayala, D. Compact union of disjoint boxes: An efficient decomposition model for binary volumes. "Computación y sistemas", 2017, vol. 21, núm. 2, p. 275-292.
ISSN1405-5546
Publisher versionhttp://www.cys.cic.ipn.mx/ojs/index.php/CyS/article/view/2737
Files | Description | Size | Format | View |
---|---|---|---|---|
2737-5271-1-PB.pdf | 2,202Mb | View/Open |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain