Skip to main content
SpringerLink
Log in

Mesh segmentation using feature point and core extraction

  • original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

Mesh segmentation has become a necessary ingredient in many applications in computer graphics. This paper proposes a novel hierarchical mesh segmentation algorithm, which is based on new methods for prominent feature point and core extraction. The algorithm has several benefits. First, it is invariant both to the pose of the model and to different proportions between the model’s components. Second, it produces correct hierarchical segmentations of meshes, both in the coarse levels of the hierarchy and in the fine levels, where tiny segments are extracted. Finally, the boundaries between the segments go along the natural seams of the models.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alexa, M.: Merging polyhedral shapes with scattered features. Visual Comput. 16, 26–37 (2000)

    Google Scholar 

  2. Barlow, R., Bartholomew, D., Bremner, J., Brunk, H.: Statistical Inference Under Order Restrictions. Wiley, New York (1972)

  3. Borg, I., Groenen, P.: Modern Multi-dimensional Scaling: Theory and Applications. Springer, Berlin Heidelberg New York (1977)

  4. Chazelle, B., Dobkin, D., Shourhura, N., Tal, A.: Strategies for polyhedral surface decomposition: an experimental study. Comput. Geom. Theory Appl. 7(4–5), 327–342 (1997)

    Google Scholar 

  5. Cohen-Steiner, D., Alliez, P., Desbrun, M.: Variational shape approximation. ACM Trans. Graph. (SIGGRAPH) 23(3), 905–914 (2004)

    Google Scholar 

  6. Cox, M., Cox, T.: Multidimensional Scaling. Chapman and Hall, London (1994)

  7. Elad, A., Kimmel, R.: On bending invariant signatures for surfaces. IEEE Trans. Pattern Anal. Mach. Intell. 25(10), 1285–1295 (2003)

    Google Scholar 

  8. Funkhouser, T., Kazhdan, M., Shilane, P., Min, P., Kiefer, W., Tal, A., Rusinkiewicz, S., Dobkin, D.: Modeling by example. ACM Trans. Graph. (SIGGRAPH) 23(3), 652–663 (2004)

    Google Scholar 

  9. Garland, M., Heckbert, P.: Surface simplification using quadric error metrics. In: Proceedings of SIGGRAPH 1997, pp. 209–216 (1997)

  10. Garland, M., Willmott, A., Heckbert, P.: Hierarchical face clustering on polygonal surfaces. In: Proceedings of ACM Symposium on Interactive 3D Graphics, pp. 49–58 (2001)

  11. Gregory, A., State, A., Lin, M., Manocha, D., Livingston, M.: Interactive surface decomposition for polyhedral morphing. Visual Comput. 15, 453–470 (1999)

    Google Scholar 

  12. Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T.: Topology matching for fully automatic similarity estimation of 3D shapes. In: SIGGRAPH 2001, pp. 203–212 (2001)

  13. Hoffman, D., Richards, W.: Parts of recognition. In: Pinker, S. (ed.) Visual Cognition, pp. 65–96. MIT Press, London (1985)

  14. Karni, Z., Gotsman, C.: Spectral compression of mesh geometry. In: Proceedings of SIGGRAPH 2000, pp. 279–286 (2000)

  15. Katz, S., Tal, A.: Hierarchical mesh decomposition using fuzzy clustering and cuts. ACM Trans. Graph. (SIGGRAPH) 22(3), 954–961 (2003)

    Google Scholar 

  16. Kraevoy, V., Sheffer, A.: Cross-parameterization and compatible remeshing of 3D models. ACM Trans. Graph. 23(3), 861–869 (2004)

    Google Scholar 

  17. Kraevoy, V., Sheffer, A., Gotsman, C.: Matchmaker: constructing constrained texture maps. ACM Trans. Graph. 22(3), 326–333 (2003)

    Google Scholar 

  18. Kruskal, J.: Multidimensional scaling by optimizing goodness of fit to a non-metric hypothesis. Psychometrika 29 (1964)

  19. Kruskal, J., Wish, M.: Multidimensional Scaling. SAGE Publications, Thousand Oaks, CA (1978)

  20. Lee, Y., Lee, S., Shamir, A., Cohen-Or, D., Seidel, H.P.: Intelligent mesh scissoring using 3D snakes. In: Pacific Conference on Computer Graphics and Applications, pp. 279–287 (2004)

  21. Levy, B., Petitjean, S., Ray, N., Maillot, J.: Least squares conformal maps for automatic texture atlas generation. In: Proceedings of SIGGRAPH 2002, pp. 362–371 (2002)

  22. Li, X., Toon, T., Tan, T., Huang, Z.: Decomposing polygon meshes for interactive applications. In: Proceedings of the 2001 symposium on Interactive 3D graphics, pp. 35–42 (2001)

  23. Liu, R., Zhang, H.: Segmentation of 3D meshes through spectral clustering. In: Pacific Conference on Computer Graphics and Applications, pp. 298–305 (2004)

  24. Mangan, A., Whitaker, R.: Partitioning 3D surface meshes using watershed segmentation. IEEE Trans. Visual. Comput. Graph. 5(4), 308–321 (1999)

    Google Scholar 

  25. Praun, E., Sweldens, W., Schröder, P.: Consistent mesh parameterizations. In: SIGGRAPH ’01, pp. 179–184. ACM Press, New York (2001)

  26. Sander, P., Snyder, J., Gortler, S., Hoppe, H.: Texture mapping progressive meshes. In: SIGGRAPH ’01, pp. 409–416. ACM Press, New York (2001)

  27. Schreiner, J., Asirvatham, A., Praun, E., Hoppe, H.: Inter-surface mapping. ACM Trans. Graph. 23(3), 870–877 (2004)

    Google Scholar 

  28. Sethian, J., Kimmel, R.: Computing geodesic paths on manifolds. Proc. of Natl. Acad. Sci. 95(15), 8431–8435 (1998)

  29. Shamir, A.: A formalization of boundary mesh segmentation. In: Proceedings of the 2nd International Symposium on 3DPVT (2004)

  30. Shepard, R.: The analysis of proximities: multi-dimensional scaling with an unknown distance function. Psychometrika 27 (1962)

  31. Shlafman, S., Tal, A., Katz, S.: Metamorphosis of polyhedral surfaces using decomposition. In: Proceedings of Eurographics, pp. 219–228 (2002)

  32. Sumner, R., Popovic, J.: Deformation transfer for triangle meshes. ACM Trans. Graph. 23(3), 399–405 (2004)

    Google Scholar 

  33. Zhang, E., Mischaikow, K., Turk, G.: Feature-based surface parameterization and texture mapping. ACM Trans. Graph. 24(1), 1–27 (2005)

    Google Scholar 

  34. Zhou, K., Synder, J., Guo, B., Shum, H.Y.: Iso-charts: Stretch-driven mesh parameterization using spectral analysis. In: Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, pp. 45–54 (2004)

  35. Zhou, Y., Huang, Z.: Decomposing polygon meshes by means of critical points. In: MMM, pp. 187–195 (2004)

  36. Zockler, M., Stalling, D., Hege, H.C.: Fast and intuitive generation of geometric shape transitions. Visual Comput. 16(5), 241–253 (2000)

    Google Scholar 

  37. Zuckerberger, E., Tal, A., Shlafman, S.: Polyhedral surface decomposition with applications. Comput. Graph. 26(5), 733–743 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Technion – Israel Institute of Technology, Israel

    Sagi Katz, George Leifman & Ayellet Tal

Authors
  1. Sagi Katz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George Leifman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ayellet Tal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sagi Katz.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Katz, S., Leifman, G. & Tal, A. Mesh segmentation using feature point and core extraction. Visual Comput 21, 649–658 (2005). https://doi.org/10.1007/s00371-005-0344-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-005-0344-9

Keywords

Search

Navigation