Encoding specific 3D polyhedral complexes using 3D binary images

6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We build upon the work developed in [4] in which we presented a method to “locally repair” the cubical complex Q(I) associated to a 3D binary image I, to obtain a “well-composed” polyhedral complex P(I), homotopy equivalent to Q(I). There, we developed a new codification system for P(I), called ExtendedCubeMap (ECM) representation, that encodes: (1) the (geometric) information of the cells of P(I) (i.e., which cells are presented and where), under the form of a 3D grayscale image gP; (2) the boundary face relations between the cells of P(I), under the form of a set BP of structuring elements. In this paper, we simplify ECM representations, proving that geometric and topological information of cells can be encoded using just a 3D binary image, without the need of using colors or sets of structuring elements. We also outline a possible application in which well-composed polyhedral complexes can be useful.

Cite

CITATION STYLE

APA

Gonzalez-Diaz, R., Jimenez, M. J., & Medrano, B. (2016). Encoding specific 3D polyhedral complexes using 3D binary images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9647, pp. 268–281). Springer Verlag. https://doi.org/10.1007/978-3-319-32360-2_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free