Minimal simple pairs in the cubic grid

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Preserving topological properties of objects during thinning procedures is an important issue in the field of image analysis. This paper constitutes an introduction to the study of non-trivial simple sets in the framework of cubical 3-D complexes. A simple set has the property that the homotopy type of the object in which it lies is not changed when the set is removed. The main contribution of this paper is a characterisation of the non-trivial simple sets composed of exactly two voxels, such sets being called minimal simple pairs. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Passat, N., Couprie, M., & Bertrand, G. (2008). Minimal simple pairs in the cubic grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4992 LNCS, pp. 165–176). https://doi.org/10.1007/978-3-540-79126-3_16

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