A three-dimensional holes closing algorithm

  • Authors:
  • Zouina Aktouf;Gilles Bertrand;Laurent Perroton

  • Affiliations:
  • ESIEE Cité Descartes, A2SI Laboratory, ESIEE 2, Bd Blaise Pascal - B.P 99, Noisy-Le-Grand Cedex, France;ESIEE Cité Descartes, A2SI Laboratory, ESIEE 2, Bd Blaise Pascal - B.P 99, Noisy-Le-Grand Cedex, France;ESIEE Cité Descartes, A2SI Laboratory, ESIEE 2, Bd Blaise Pascal - B.P 99, Noisy-Le-Grand Cedex, France

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2002

Quantified Score

Hi-index 0.11

Visualization

Abstract

Contrary to the 2D case, a 3D hole is not a subset of the 3D space. It is therefore not possible to use connected components search algorithms for detecting and suppressing 3D holes.In this paper, we propose an algorithm for suppressing 3D holes. It is based on properties of the previously introduced notion of topological number. Our algorithm is linear in time and it allows to control the "size" of the holes which are closed. As far as we know, this is the first 3D holes closing algorithm.