This paper presents a new method for extracting feature edges from computer-aided design (CAD)-generated triangulations. The major advantage of this method is that it tends to extract feature edges along the centroids of the fillets rather than along the edges where fillets are connected to nonfillet surfaces. Typical industrial models include very small-radius fillets between relatively large surfaces. While some of those fillets are necessary for certain types of analyses, many of them are irrelevant for many other types of applications. Narrow fillets are unnecessary details for those applications and cause numerous problems in the downstream processes. One solution to the small-radius fillet problem is to divide the fillets along the centroid and then merge each fragment of the fillet with nonfillet surfaces. The proposed method can find such fillet centroids and can substantially reduce the adverse effects of such small-radius fillets. The method takes a triangulated geometry as input and first simplifies the model so that small-radius, or “small,” fillets are collapsed into line segments. The simplification is based on the normal errors and therefore is scale-independent. It is particularly effective for a shape that is a mix of small and large features. Then, the method creates segmentation in the simplified geometry, which is then transformed back to the original shape while maintaining the segmentation information. The groups of triangles are expanded by applying a region-growing technique to cover all triangles. The feature edges are finally extracted along the boundaries between the groups of triangles.

References

References
1.
Yan
,
D.-M.
,
Wang
,
W.
,
Liu
,
Y.
, and
Yang
,
Z.
,
2012
, “
Variational Mesh Segmentation Via Quadric Surface Fitting
,”
Comput. Aided Des.
,
44
(
11
), pp.
1072
1082
.
2.
Katz
,
S.
, and
Tal
,
A.
,
2003
, “
Hierarchical Mesh Decomposition Using Fuzzy Clustering and Cuts
,” The 30th International Conference on Computer Graphics and Interactive Techniques (
SIGGRAPH
), San Diego, CA, July 27–31, pp.
954
961
.
3.
Katz
,
S.
,
Leifman
,
G.
, and
Tal
,
A.
,
2005
, “
Mesh Segmentation Using Feature Point and Core Extraction
,”
Visual Comput.
,
21
(
8
), pp.
649
658
.
4.
Kalogerakis
,
E.
,
Hertzmann
,
A.
, and
Singh
,
K.
,
2010
, “
Learning 3D Mesh Segmentation and Labeling
,” The 37th International Conference on Computer Graphics and Interactive Techniques (SIGGRAPH), Los Angeles, CA, July 26–30, Paper No.
102
.
5.
Garland
,
M.
, and
Heckbert
,
P. S.
,
1997
, “
Surface Simplification Using Quadric Error Metric
,” 24th Annual Conference on Computer Graphics and Interactive Techniques (
SIGGRAPH
), Los Angeles, CA, Aug. 5–7, pp.
209
216
.
6.
Baker
,
T. J.
,
2004
, “
Identification and Preservation of Surface Features
,”
13th International Meshing Roundtable
(
IMR
), Williamsburg, VA, Sept. 19–22, pp.
299
309
.http://imr.sandia.gov/papers/imr13/baker.pdf
7.
Jiao
,
X.
, and
Heath
,
M. T.
,
2002
, “
Feature Detection for Surface Meshes
,”
Eighth International Conference on Numerical Grid Generation in Computational Field Simulation
, Honolulu, HI, June 1–5, pp.
705
714
.http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.110.9153&rep=rep1&type=pdf
8.
Jiao
,
X.
, and
Heath
,
M. T.
,
2004
, “
Overlaying Surface Meshes—Part II: Topology Preservation and Feature Detection
,”
Int. J. Comput. Geom. Appl.
,
14
(
6
), pp.
403
419
.
9.
Sun
,
Y.
,
Page
,
D. L.
,
Paik
,
J. K.
,
Koschan
,
A.
, and
Abidi
,
M. A.
,
2002
, “
Triangle Mesh-Based Edge Detection and Its Application to Surface Segmentation and Adaptive Surface Smoothing
,”
International Conference on Image Processing
(
ICIP
), Rochester, NY, Sept. 22–25, pp.
825
828
.
10.
Yamakawa
,
S.
, and
Shimada
,
K.
,
2005
, “
Polygon Crawling: Feature-Edge Extraction From a General Polygonal Surface for Mesh Generation
,”
14th International Meshing Roundtable
(
IMR
), San Diego, CA, Sept. 11–14, pp.
257
274
.http://imr.sandia.gov/papers/imr14/yamakawa.pdf
11.
Daniels
,
J.
,
Ha
,
L. K.
,
Ochotta
,
T.
, and
Silva
,
C.
,
2007
, “
Robust Smooth Feature Extraction From Point Clouds
,” IEEE International Conference on Shape Modeling and Applications (
SMI
), Lyon, France, June 13–15, pp.
123
133
.
12.
Gumhold
,
S.
,
Wang
,
X.
, and
Macleod
,
R.
,
2001
, “
Feature Extraction From Point Clouds
,”
Tenth International Meshing Roundtable
(
IMR
), Newport Beach, CA, Oct. 7–10, pp.
293
305
.https://pdfs.semanticscholar.org/1783/765f244902e2993143d42cf4b4aea269ba79.pdf
13.
Mangan
,
A. P.
, and
Whitaker
,
R. T.
,
1999
, “
Partitioning 3D Surface Meshes Using Watershed Segmentation
,”
IEEE Trans. Visualization Comput. Graphics
,
5
(
4
), pp.
308
321
.
14.
Várady
,
T.
,
Facello
,
M. A.
, and
Terék
,
Z.
,
2007
, “
Automatic Extraction of Surface Structures in Digital Shape Reconstruction
,”
Comput. Aided Des.
,
39
(
5
), pp.
379
388
.
15.
Cohen-Steiner
,
D.
,
Alliez
,
P.
, and
Desbrun
,
M.
,
2004
, “
Variational Shape Approximation
,” 31st International Conference on Computer Graphics and Interactive Techniques (
SIGGRAPH
), Los Angeles, CA, Aug. 10–12, pp.
905
914
.
16.
Pauly
,
M.
,
Keiser
,
R.
, and
Gross
,
M.
,
2003
, “
Multi-Scale Feature Extraction on Point-Sampled Surfaces
,”
Comput. Graphics Forum
,
22
(
3
), pp.
281
289
.
17.
Nomura
,
M.
, and
Hamada
,
N.
,
2001
, “
Feature Edge Extraction From 3D Triangular Meshes Using a Thinning Algorithm
,”
Proc. SPIE
,
4476
, pp.
34
41
.
18.
Xiao
,
D.
,
Lin
,
H.
,
Xian
,
C.
, and
Gao
,
S.
,
2011
, “
CAD Mesh Model Segmentation by Clustering
,”
Comput. Graphics
,
35
(
3
), pp.
685
691
.
19.
Edwards
,
J.
,
Wang
,
W.
, and
Bajaj
,
C.
,
2012
, “
Surface Segmentation for Improved Remeshing
,”
21st International Meshing Roundtable
(
IMR
), San Jose, CA, Oct. 7–10, pp.
403
418
.http://www.imr.sandia.gov/papers/imr21/Edwards.pdf
You do not currently have access to this content.