Application of discrete curvatures to surface mesh simplification and feature line extraction

2013 ◽  
Vol 3 (1) ◽  
pp. 31-49
Author(s):  
Alexandra Bac ◽  
Jean-Luc Mari ◽  
Dimitri Kudelski ◽  
Nam-Van Tran ◽  
Sophie Viseur ◽  
...  
Keyword(s):  
Mesh Simplification ◽  
Surface Mesh ◽  
Line Extraction ◽  
Feature Line ◽  
Discrete Curvatures

A Feature-Preserving Hole Filling Algorithm in Reverse Engineering

2012 ◽  
Vol 263-266 ◽  
pp. 2049-2053
Author(s):  
Ying Gao ◽  
Rui Zhao Wang ◽  
Ping Xin Ji
Keyword(s):  
Reverse Engineering ◽  
Experimental Results ◽  
Hole Filling ◽  
Line Extraction ◽  
Mesh Model ◽  
Feature Lines ◽  
Feature Line ◽  
Triangular Mesh Model ◽  
Feature Preserving ◽  
New Feature

To get complete and accurate triangular mesh model in reverse engineering, the hole-filling operation is indispensable. This paper presents a new feature preserving hole-filling algorithm based on the feature line extraction. Firstly, the hole and its neighborhood were obtained. Then, the feature lines in the hole region were extracted which were used to divided the hole to several single surface holes. To each hole, triangulation and subdivision were performed. Finally, the new added vertices in the hole were moved to the underlying surface which was approximated by the hole neighborhood. The experimental results demonstrate that our mesh hole-filling algorithm can effectively recover the original shape of the hole.

Automatic point cloud feature-line extraction algorithm based on curvature-mutation analysis

2019 ◽  
Vol 27 (5) ◽  
pp. 1218-1228
Author(s):  
陈华伟 CHEN Hua-wei ◽  
袁小翠 YUAN Xiao-cui ◽  
吴禄慎 WU Lu-chen ◽  
王晓辉 WANG Xiao-hui
Keyword(s):  
Mutation Analysis ◽  
Point Cloud ◽  
Line Extraction ◽  
Feature Line ◽  
Extraction Algorithm

FEATURE LINE EXTRACTION ON MESHES THROUGH VERTEX MARKING AND 2D TOPOLOGICAL OPERATORS

2011 ◽  
Vol 11 (04) ◽  
pp. 531-548 ◽  
Author(s):  
DIMITRI KUDELSKI ◽  
SOPHIE VISEUR ◽  
GIOVANNI SCROFANI ◽  
JEAN-LUC MARI
Keyword(s):  
Regular Representation ◽  
Candidate Region ◽  
Line Detection ◽  
3D Mesh ◽  
Line Extraction ◽  
Feature Lines ◽  
Feature Line ◽  
High Connectivity ◽  
Candidate Regions ◽  
Traditional Approaches

Classical approaches of feature line detection rely on curvature derivatives. They generally suffer from a common problem: the connectivity is hard to obtain and it is impossible to generate intersections between feature lines. This article presents a method to extract feature lines on 3D meshes. In order to sort out the recurrent issues of traditional approaches, we propose a novel algorithm based on two ideas. First, all the mesh vertices are marked according to the curvature values: a binary map with candidate regions is then constructed. The second idea is to isolate each candidate region and transform it into a line. To achieve this, we parameterize the region into its 2D regular representation. We then perform a skeletonization to obtain lines with high connectivity. By applying the inverse parameterization, the feature lines are mapped back onto the 3D mesh. In the end, we extract perceptual salient parts and above all connected feature lines. In order to evaluate and validate our algorithm, we compare our method to classical ones and apply our technique to a geological context.

scholarly journals Feature Line Extraction and Matching for Modeling Artificial Buildings Using Measured Point Clouds

2006 ◽  
Vol 5 (3) ◽  
pp. 80-91 ◽  
Author(s):  
Tetsuji KONNO ◽  
Kouichi KONNO ◽  
Tadahiro FUJIMOTO ◽  
Norishige CHIBA
Keyword(s):  
Point Clouds ◽  
Line Extraction ◽  
Feature Line
Sign in / Sign up

Export Citation Format

Share Document