GRAPH-BASED EXTRACTION OF PROTRUSIONS AND DEPRESSIONS FROM BOUNDARY REPRESENTATIONS

被引:73
作者
GAVANKAR, P [1 ]
HENDERSON, MR [1 ]
机构
[1] ARIZONA STATE UNIV,DEPT MECH & AEROSP ENGN,TEMPE,AZ 85287
基金
美国国家科学基金会;
关键词
boundary models; computer-aided design; feature extraction;
D O I
10.1016/0010-4485(90)90109-P
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A feature extraction technique to isolate protrusions and depressions from boundary models is discussed. The technique involves identification of faces with multiple edge loops as candidates for entrance faces of such features. It is observed that protrusions and depressions constitute biconnected components in the edge-face graphs of the boundary models. Heuristics are used to enhance an algorithm to decompose the edge-face graph of a boundary representation into its biconnected components. Advantages and disadvantages of this method are compared against the classic graph theoretic algorithm to obtain biconnected components from a graph. © 1990.
引用
收藏
页码:442 / 450
页数:9
相关论文
共 23 条
[1]  
ANSALDI S, 1985, COMPUT GRAPH FORUM, P319
[2]  
CHANG TC, 1982, THESIS VIRG POLYT I
[3]   AUTOMATIC RECOGNITION OF MACHINED SURFACES FROM A 3D SOLID MODEL [J].
CHOI, BK ;
BARASH, MM ;
ANDERSON, DC .
COMPUTER-AIDED DESIGN, 1984, 16 (02) :81-86
[4]  
FLIRIANI LD, 1988, ACM T GRAPHIC, V7, P42
[5]  
FLORIANI LD, 1986, ADV IMAGE PROCESSING, P40
[6]  
GANU P, 1989, THESIS ARIZONA STATE
[7]  
GAVANKAR P, 1989, THESIS ARIZONA STATE
[8]  
GRAYER AR, 1976, PROLAMAT P
[9]  
Harary Frank, 1972, GRAPH THEORY
[10]   COMPUTER RECOGNITION AND EXTRACTION OF FORM FEATURES - A CAD CAM LINK [J].
HENDERSON, MR ;
ANDERSON, DC .
COMPUTERS IN INDUSTRY, 1984, 5 (04) :329-339