Decomposing Digital 3D Shapes Using a Multiresolution Structure

  • Gunilla Borgefors
  • Stina Svensson
  • Gabriella Sanniti di Baja
Conference paper

DOI: 10.1007/3-540-49126-0_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1568)
Cite this paper as:
Borgefors G., Svensson S., di Baja G.S. (1999) Decomposing Digital 3D Shapes Using a Multiresolution Structure. In: Bertrand G., Couprie M., Perroton L. (eds) Discrete Geometry for Computer Imagery. DGCI 1999. Lecture Notes in Computer Science, vol 1568. Springer, Berlin, Heidelberg

Abstract

In many applications, e. g. object recognition, decomposition of a shape is of great interest. We present a decomposition algorithm for 3D shape that is based on a multiresolution structure. The shape is hierarchically decomposed according to local thickness. A merging process is introduced for merging of small components to more significant parts. As a side effect of the algorithm, we also obtain a way of smoothing noisy shapes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Gunilla Borgefors
    • 1
  • Stina Svensson
    • 1
  • Gabriella Sanniti di Baja
    • 2
  1. 1.Centre for Image AnalysisSwedish University of Agricultural SciencesUppsalaSWEDEN
  2. 2.Italian National Research CouncilIstituto di CiberneticaArco Felice (Naples)ITALY

Personalised recommendations