Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/2117/107808

Compact union of disjoint boxes: An efficient decomposition model for binary volumes
Cruz Matías, Irving; Ayala Vallespí, M. Dolors
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. GIE - Grup d'Informàtica en l'Enginyeria
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.
Peer Reviewed
Àrees temàtiques de la UPC::Informàtica
Binary volumes
orthogonal polyhedra
connected-component labeling
collision detection
Programari d'aplicació -- Desenvolupament
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/publishedVersion
Article
         

Mostra el registre complet del document

Documents relacionats

Altres documents del mateix autor/a

Rodríguez, Jorge; Cruz Matías, Irving; Vergés Garcia, Eduard; Ayala Vallespí, M. Dolors
Ayala Vallespí, M. Dolors; Grau, S.; Tost Pardell, Daniela
Andújar Gran, Carlos Antonio; Brunet Crosa, Pere; Ayala Vallespí, M. Dolors
Cruz Matías, Irving Alberto; Ayala Vallespí, M. Dolors