Full Text:   <3855>

CLC number: TP390

On-line Access: 

Received: 2004-08-12

Revision Accepted: 2004-11-01

Crosschecked: 0000-00-00

Cited: 6

Clicked: 6066

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE A 2005 Vol.6 No.5 P.460-468


Smooth feature line detection for meshes

Author(s):  GUO Yan-wen, PENG Qun-sheng, HU Guo-fei, WANG Jin

Affiliation(s):  State Key Laboratory of CAD & CG, Department of Mathematics, Zhejiang University, Hangzhou 310027, China

Corresponding email(s):   ywguo@cad.zju.edu.cn

Key Words:  Feature line, Image snakes, Mesh parameterization, Mesh decomposition

GUO Yan-wen, PENG Qun-sheng, HU Guo-fei, WANG Jin. Smooth feature line detection for meshes[J]. Journal of Zhejiang University Science A, 2005, 6(5): 460-468.

@article{title="Smooth feature line detection for meshes",
author="GUO Yan-wen, PENG Qun-sheng, HU Guo-fei, WANG Jin",
journal="Journal of Zhejiang University Science A",
publisher="Zhejiang University Press & Springer",

%0 Journal Article
%T Smooth feature line detection for meshes
%A GUO Yan-wen
%A PENG Qun-sheng
%A HU Guo-fei
%J Journal of Zhejiang University SCIENCE A
%V 6
%N 5
%P 460-468
%@ 1673-565X
%D 2005
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2005.A0460

T1 - Smooth feature line detection for meshes
A1 - GUO Yan-wen
A1 - PENG Qun-sheng
A1 - HU Guo-fei
A1 - WANG Jin
J0 - Journal of Zhejiang University Science A
VL - 6
IS - 5
SP - 460
EP - 468
%@ 1673-565X
Y1 - 2005
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2005.A0460

In this paper the authors present a novel semi-automatic feature line detection technique for meshes. Taking into account the distance and orientation between two vertices on meshes and the curvature information of vertices, they first find an initial feature line which connects some user-specified vertices on meshes; then parameterize the “feature strip” surrounding the feature line onto a planar domain using a vertex flattening technique; and refine the flattened feature strip using the 2D snakes approach to make the feature line smoother and more accurate; lastly they get the feature line by mapping the refined line back to the original meshes. Experimental results showed that their method can extract the feature line rapidly and precisely. As an application, they propose a mesh decomposition method based on the detected feature line.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article


[1] Andrews, S., 2002. Interactive Generation of Feature Curves on Surfaces: A Minimal Path Approach. Master’s Thesis, University of Toronto, p.22-32.

[2] Belyaev, A., Ohtake, Y., Abe, K., 2000. Detection of Ridges and Ravines on Range Images and Triangular Meshes. Proceedings of Vision Geometry IX, p.146-154.

[3] Borrelli, V., 1993. Courbures Discretes. Master’s Thesis. Universite Claude Bernard-Lyon 1.

[4] Cohen, L.D., 1991. On active contour models and balloons. Computer Vision, Graphics and Image Processing: Image Understanding, 53(2):212-218.

[5] Hubeli, A., Gross, M., 2001. Multiresolution Feature Extraction from Unstructured Meshes. Proc of IEEE Visualization, p.287-294.

[6] Kanai, T., Suzuki, H., 2000. Approximate Shortest Path on a Polyhedral Surface Based on Selective Refinement of the Discrete Graph and Its Application. Proceedings of IEEE Geometric Modeling and Processing 2000 (Theory and Applications). Hong Kong, p.241-250.

[7] Kass, M., Witkin, A., Ierzopoulos, D., 1998. Snakes: Active contour models. International Journal on Computer Vision, 1(4):321-331.

[8] Khaneja, N., Miller, M.I., Grenander, U., 1998. Dynamic programming generation of curves on brain surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(11):1260-1265.

[9] Kimmel, R., Sethian, J.A., 1998. Computing Geodesic Paths on Manifolds. Proceedings of National Academy of Sciences, p.8431-8435.

[10] Lee, Y.J., Lee, S.Y., 2002. Geometric Snakes for Trianglular Meshes. Proceedings of Eurographics 2002, p.229-238.

[11] Ohtake, Y., Belyaev, A., 2001. Automatic detection of geodesic ridges and ravines on polygonal surfaces. The Journal of Three Dimensional Images, 15(1):127-132.

[12] Ohtake, Y., Belyaev, A., Seidel, H.P., 2004. Ridge-valley Lines on Meshes via Implicit Surface Fitting. Proceedings of SIGGRAPH 2004, Computer Graphics Proceedings, Annual Conference Series, ACM, p.609-612.

[13] Page, D. L., Sun, Y., Koschan, A., Paik, J., Abidi, M., 2002. Normal vector voting, crease detection and curvature estimation on large, noisy meshes. Journal of Graphical Models, 64:1-31.

[14] Rössl, C., Kobbelt, L., Seidel, H.P., 2000. Extraction of Feature Lines on Triangulated Surfaces Using Morphological Operators. Smart Graphics 2000, AAAI Spring Symposium. Stanford University, p.71-75.

[15] Xu, C., Prince, J.L., 1998. Snakes, shapes, and gradient vector flow. IEEE Trans on Image Processing, 7(3):359-369.

Open peer comments: Debate/Discuss/Question/Opinion


Please provide your name, email address and a comment

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2024 Journal of Zhejiang University-SCIENCE