Advertisement

Segmentation of Triangular Meshes Using Multi-scale Normal Variation

  • Kyungha Min
  • Moon-Ryul Jung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4291)

Abstract

In this paper, we present a scheme that segments triangular meshes into several meaningful patches using multi-scale normal variation. In differential geometry, there is a traditional scheme that segments smooth surfaces into several patches such as elliptic, hyperbolic, or parabolic regions, with several curves such as ridge, valley, and parabolic curve between these regions, by means of the principal curvatures of the surface. We present a similar segmentation scheme for triangular meshes. For this purpose, we develop a simple and robust scheme that approximates the principal curvatures on triangular meshes by multi-scale normal variation scheme. Using these approximated principal curvatures and modifying the classical segmentation scheme for triangular meshes, we design a scheme that segments triangular meshes into several meaningful regions. This segmentation scheme is implemented by evaluating a feature weight at each vertex, which quantifies the likelihood that each vertex belongs to one of the regions. We test our scheme on several face models and demonstrate its capability by segmenting them into several meaningful regions.

Keywords

Principal Curvature Triangular Mesh Feature Weight Segmentation Scheme Meaningful Region 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jung, M., Kim, H.: Snaking across 3D Meshes. In: Proceedings of Pacific Graphics 2004, pp. 415–420 (2004)Google Scholar
  2. 2.
    Kobbelt, L.: Discrete Fairing. In: Proceedings of 7th IMA Conference on the Mathematics of Surfaces, pp. 101–131 (1997)Google Scholar
  3. 3.
    Lee, Y., Lee, S.: Geometric snakes for triangular meshes. Computer Graphics Forum 21(3), 229–238 (2002)CrossRefGoogle Scholar
  4. 4.
    Meyer, M., Desbrun, M., Schroder, P., Barr, A.: Discrete Differential-Geometry Operators for Triangulated 2-Manifolds. In: Proceedings of International Workshop on Visualization and Mathematics, pp. 35–58 (2002)Google Scholar
  5. 5.
    Min, K., Metaxas, D., Jung, M.: Active contours with level-set for extracting feature curves from triangular meshes. In: Proceedings of Computer Graphics International 2006, pp. 185–196 (2006)Google Scholar
  6. 6.
    Pauly, M., Keiser, R., Gross, M.: Multi-scale Extraction on Point-sampled Surfaces. Computer Graphics Forum 22(3), 281–289 (2003)CrossRefGoogle Scholar
  7. 7.
    Taubin, G.: Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation. In: Proceedings of International Conference on Computer Vision (ICCV), pp. 902–907 (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kyungha Min
    • 1
  • Moon-Ryul Jung
    • 2
  1. 1.Sangmyung Univ.Korea
  2. 2.Sogang Univ.Korea

Personalised recommendations