Extraction of geodesic and feature lines on triangular meshes

The generation of feature curves or curve network from the digitized points of an object is very important for successful surface reconstruction. Owing to the shape complexity of industrial parts and the random nature of scanned points, the feature curves detected are generally not smooth or accurate enough for the subsequent use. The purpose of this study was to present an algorithm for extracting geodesic or feature lines on triangular meshes provided that the initial and final points of the path are given. The proposed algorithm is essentially developed from a heuristic search algorithm where a cost function composed of distance and curvature information is employed to guide the search of the optimized path. When the distances between the points dominate the cost function, it will result in a geodesic path between the initial and final points. On the contrary, when the curvature cost dominates, the optimized path will track the feature edges or rounded edges appropriately. Successful examples are presented to illustrate the feasibility of the proposed algorithm.

[1]  Thomas L. Naps,et al.  Introduction to Data Structures , 1985 .

[2]  Rachid Deriche,et al.  3D edge detection using recursive filtering: application to scanner images , 1989, Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[3]  Chang-Hun Kim,et al.  Finding ridges and valleys in a discrete surface using a modified MLS approximation , 2005, Comput. Aided Des..

[4]  Hans-Peter Seidel,et al.  Fast and robust detection of crest lines on meshes , 2005, SPM '05.

[5]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[6]  Philippe Saint-Marc,et al.  Adaptive Smoothing: A General Tool for Early Vision , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Tosiyasu L. Kunii,et al.  Ridges and Ravines: a Singularity Approach , 1994, Int. J. Shape Model..

[8]  J. Thorpe.  Elementary Topics in Differential Geometry , 1979 .

[9]  Alexander G. Belyaev,et al.  Detection of Surface Creases in Range Data , 2005, IMA Conference on the Mathematics of Surfaces.

[10]  László Andor,et al.  Computing natural division lines on free-form surfaces based on measured data , 1998 .

[11]  Yutaka Ohtake,et al.  Detection of ridges and ravines on range images and triangular meshes , 2000, SPIE Optics + Photonics.

[12]  Tosiyasu L. Kunii,et al.  Detection of Ridges and Ravines Based on Caustic Singularities , 1994, Int. J. Shape Model..

[13]  Daniel F. Stubbs,et al.  Data Structures With Abstract Data Types and Modula-2 , 1990 .

[14]  Leif Kobbelt,et al.  Extraction of feature lines on triangulated surfaces using morphological operators , 2000 .

[15]  Yongtae Jun,et al.  A robust approach to edge detection of scanned point data , 2004 .

[16]  Francis Schmitt,et al.  Intrinsic Surface Properties from Surface Triangulation , 1992, ECCV.

[17]  H. Seidel,et al.  Ridge-valley lines on meshes via implicit surface fitting , 2004, SIGGRAPH 2004.

[18]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[19]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[20]  Hiromasa Suzuki,et al.  Approximate shortest path on a polyhedral surface based on selective refinement of the discrete graph and its applications , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[21]  J. Canny.  Finding Edges and Lines in Images , 1983 .

[22]  Kristiaan Schreve,et al.  Edge detection in reverse engineering using a scanning approach. Part 1: scanning algorithm , 2005 .

[23]  Rachid Deriche,et al.  Using Canny's criteria to derive a recursively implemented optimal edge detector , 1987, International Journal of Computer Vision.

[25]  Peng Qun-sheng,et al.  Smooth feature line detection for meshes , 2005 .