Skip to main content
Log in

Feature detection of triangular meshes via neighbor supporting

  • Published:
Journal of Zhejiang University SCIENCE C Aims and scope Submit manuscript

Abstract

We propose a robust method for detecting features on triangular meshes by combining normal tensor voting with neighbor supporting. Our method contains two stages: feature detection and feature refinement. First, the normal tensor voting method is modified to detect the initial features, which may include some pseudo features. Then, at the feature refinement stage, a novel salient measure deriving from the idea of neighbor supporting is developed. Benefiting from the integrated reliable salient measure feature, pseudo features can be effectively discriminated from the initially detected features and removed. Compared to previous methods based on the differential geometric property, the main advantage of our method is that it can detect both sharp and weak features. Numerical experiments show that our algorithm is robust, effective, and can produce more accurate results. We also discuss how detected features are incorporated into applications, such as feature-preserving mesh denoising and hole-filling, and present visually appealing results by integrating feature information.

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

Access this article

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

  • Bian, Z., Tong, R.F., 2011. Feature-preserving mesh denoising based on vertices classification. Comput. Aided Geom. Des., 28(1):50–64. [doi:10.1016/j.cagd.2010.10.001]

    Article  MathSciNet  MATH  Google Scholar 

  • Chen, C.Y., Cheng, K.Y., 2008. A sharpness-dependent filter for recovering sharp features in repaired 3D mesh models. IEEE Trans. Visual. Comput. Graph., 14(1):200–212. [doi:10.1109/TVCG.2007.70625]

    Article  Google Scholar 

  • Demarsin, K., Vanderstraeten, D., Volodine, T., Roose, D., 2007. Detection of closed sharp edges in point clouds using normal estimation and graph theory. Comput.-Aided Des., 39(4):276–283. [doi:10.1016/j.cad.2006.12.005]

    Article  Google Scholar 

  • di Angelo, L., di Stefano, P., 2010. C1 continuities detection in triangular meshes. Comput.-Aided Des., 42(9):828–839. [doi:10.1016/j.cad.2010.05.005]

    Article  Google Scholar 

  • Fan, H.Q., Yu, Y.Z., Peng, Q.S., 2010. Robust feature-preserving mesh denoising based on consistent subneighborhoods. IEEE Trans. Visual. Comput. Graph., 16(2):312–324. [doi:10.1109/TVCG.2009.70]

    Article  Google Scholar 

  • Fleishman, S., Drori, I., Cohen-Or, D., 2003. Bilateral Mesh Denoising. SIGGRAPH, p.950–953. [doi:10.1145/882262.882368]

  • Hildebrandt, K., Polthier, K., Wardetzky, M., 2005. Smooth Feature Lines on Surface Meshes. Proc. 3rd Eurographics Symp. Geometry Processing, p.85–90.

  • Hubeli, A., Gross, M., 2001. Multiresolution Feature Extraction for Unstructured Meshes. Proc. Conf. on Visualization, p.287–294.

  • Kim, H.S., Choi, H.K., Lee, K.H., 2009. Feature detection of triangular meshes based on tensor voting theory. Comput.-Aided Des., 41(1):47–58. [doi:10.1016/j.cad.2008.12.003]

    Article  Google Scholar 

  • Kim, S.K., Kim, C.H., 2006. Finding ridges and valleys in a discrete surface using a modified MLS approximation. Comput.-Aided Des., 38(2):173–180. [doi:10.1016/j.cad.2005.05.002]

    Article  Google Scholar 

  • Kim, S.K., Kim, S.J., Kim, C.H., 2006. Extraction of ridgesvalleys for feature-preserving simplification of polygonal models. LNCS, 3992:279–286. [doi:10.1007/11758525_37]

    Google Scholar 

  • Lai, Y.K., Zhou, Q.Y., Hu, S.M., Wallner, J., Pottmann, H., 2007. Robust feature classification and editing. IEEE Trans. Visual. Comput. Graph., 13(1):34–45. [doi:10.1109/TVCG.2007.19]

    Article  Google Scholar 

  • Lee, C.H., Varshney, A., Jacobs, D.W., 2005. Mesh Saliency. SIGGRAPH, p.659–666. [doi:10.1145/1073204.1073244]

  • Li, Z., Meek, D.S., Walton, D.J., 2010. Polynomial blending in a mesh hole-filling application. Comput.-Aided Des., 42(4):340–349. [doi:10.1016/j.cad.2009.12.006]

    Article  Google Scholar 

  • Liu, Y.S., Liu, M., Kihara, D., Ramani, K., 2007. Salient Critical Points for Meshes. Proc. ACM Symp. on Solid and Physical Modeling, p.277–282. [doi:10.1145/1236246.1236285]

  • Mao, Z.H., Cao, G., Zhao, M.X., 2009. Robust detection of perceptually salient features on 3D meshes. Vis. Comput., 25(3):289–295. [doi:10.1007/s00371-008-0268-2]

    Article  Google Scholar 

  • Moreno, R., Garcia, M.A., Puig, D., Pizarro, L., Burgeth, B., Weickert, J., 2011. On improving the efficiency of tensor voting. IEEE Trans. Pattern Anal. Mach. Intell., 33(11):2215–2228. [doi:10.1109/TPAMI.2011.23]

    Article  Google Scholar 

  • Ohtake, Y., Belyaev, A., Seidel, H.P., 2004. Ridge-valley lines on meshes via implicit surface fitting. ACM Trans. Graph., 23(3):609–612. [doi:10.1145/1015706.1015768]

    Article  Google Scholar 

  • Page, D.L., Sun, Y., Koschan, A.F., Paik, J., Abidi, M.A., 2002. Normal vector voting: crease detection and curvature estimation on large, noisy meshes. Graph. Models, 64(3–4):199–229. [doi:10.1006/gmod.2002.0574]

    Article  MATH  Google Scholar 

  • Sahner, J., Weber, B., Prohaska, S., Lamecker, H., 2008. Extraction of feature lines on surface meshes based on discrete Morse theory. Comput. Graph. Forum, 27(3):735–742. [doi:10.1111/j.1467-8659.2008.01202.x]

    Article  Google Scholar 

  • Shimizu, T., Date, H., Kanai, S., Kishinami, T., 2005. A New Bilateral Mesh Smoothing Method by Recognizing Features. 9th Int. Conf. on Computer Aided Design and Computer Graphics, p.281–286. [doi:10.1109/CADCG.2005.10]

  • Stylianou, G., Farin, G., 2004. Crest lines for surface segmentation and flattening. IEEE Trans. Visual. Comput. Graph., 10(5):536–544. [doi:10.1109/TVCG.2004.24]

    Article  Google Scholar 

  • Su, Z.X., Wang, H., Cao, J.J., 2009. Mesh Denoising Based on Differential Coordinates. IEEE Int. Conf. on Shape Modeling and Applications, p.1–6. [doi:10.1109/SMI.2009.5170156]

  • Sunil, V.B., Pande, S.S., 2008. Automatic recognition of features from freeform surface CAD models. Comput.-Aided Des., 40(4):502–517. [doi:10.1016/j.cad.2008.01.006]

    Article  Google Scholar 

  • Taubin, G., 1995. Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation. 5th Int. Conf. on Computer Vision, p.902–907. [doi:10.1109/ICCV.1995.466840]

  • Wang, C.C.L., 2006a. Bilateral recovering of sharp edges on feature-insensitive sampled meshes. IEEE Trans. Visual. Comput. Graph., 12(4):629–639. [doi:10.1109/TVCG.2006.60]

    Article  Google Scholar 

  • Wang, C.C.L., 2006b. Incremental reconstruction of sharp edges on mesh surfaces. Comput.-Aided Des., 38(6): 689–702. [doi:10.1016/j.cad.2006.02.009]

    Article  Google Scholar 

  • Wang, H., Chen, H.Y., Su, Z.X., Cao, J.J., Liu, F.S., Shi, X.Q., 2011. Versatile surface detail editing via Laplacian coordinates. Vis. Comput., 27(5):401–411. [doi:10.1007/s00371-011-0558-y]

    Article  Google Scholar 

  • Wang, S.F., Hou, T.B., Su, Z.X., Qin, H., 2011. Diffusion Tensor Weighted Harmonic Fields for Feature Classification. PG, p.93–98. [doi:10.2312/PE/PG/PG2011short/093-098]

  • Wang, X.C., Liu, X.P., Lu, L.F., Li, B.J., Cao, J.J., Yin, B.C., Shi, X.Q., 2012. Automatic hole-filling of CAD model with feature-preserving. Comput. Graph., 36(2): 101–110. [doi:10.1016/j.cag.2011.12.007]

    Article  Google Scholar 

  • Watanabe, K., Belyaev, A.G., 2001. Detection of salient curvature features on polygonal surfaces. Comput. Graph. Forum, 20(3):385–392. [doi:10.1111/1467-8659.00531]

    Article  Google Scholar 

  • Weinkauf, T., Günther, D., 2009. Separatrix persistence: extraction of salient edges on surfaces using topological methods. Comput. Graph. Forum, 28(5):1519–1528. [doi:10.1111/j.1467-8659.2009.01528.x]

    Article  Google Scholar 

  • Yang, Y.L., Lai, Y.K., Hu, S.M., Pottmann, H., 2006. Robust Principal Curvatures on Multiple Scales. Proc. 4th Eurographics Symp. on Geometry Processing, p.223–226.

  • Yoshizawa, S., Belyaev, A., Seidel, H.P., 2005. Fast and Robust Detection of Crest Lines on Meshes. Proc. ACM Symp. on Solid and Physical Modeling, p.227–232. [doi:10.1145/1060244.1060270]

  • Yoshizawa, S., Belyaev, A., Yokota, H., Seidel, H.P., 2008. Fast, robust, and faithful methods for detecting crest lines on meshes. Comput. Aided Geom. Des., 25(8): 545–560. [doi:10.1016/j.cagd.2008.06.008]

    Article  MathSciNet  MATH  Google Scholar 

Recommended reading

  • Mao, Z.H., Lee, K., Cao, G., 2011. Interactive feature extraction on 3D meshes. Comput.-Aided Des. Appl., 8(5):785–793. [doi:10.3722/cadaps.2011.785-793]

    Google Scholar 

  • Zhao, Q.N., Tino, W.K., Olga, S., 2011. Feature-Based Mesh Editing. EUROGRAPHICS.

  • Huang, H., Ascher, U., 2008. Surface mesh smoothing, regularization and feature detection. SIAM J. Sci. Comput., 31(1):74–93. [doi:10.1137/060676684]

    Article  MathSciNet  MATH  Google Scholar 

  • Kolomenkin, M., Shimshoni, I., Tal, A., 2009. On Edge Detection on Surfaces. IEEE Conf. on Computer Vision and Pattern Recognition, p.2767–2774.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiu-ping Liu.

Additional information

Project supported by the National Natural Science Foundation of China (Nos. U0935400, 60873181, and 61173102) and the Fundamental Research Funds for the Central Universities, China (No. DUT11SX08)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Xc., Cao, Jj., Liu, Xp. et al. Feature detection of triangular meshes via neighbor supporting. J. Zhejiang Univ. - Sci. C 13, 440–451 (2012). https://doi.org/10.1631/jzus.C1100324

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.C1100324

Key words

CLC number

Navigation