о뷢չ
JOURNAL OF COMPUTER RESEARCH AND DEVELOPMENT
1999ꡡ3610ڡVol.36No.101999



༭о
졡ԡ
ժҪ༭ѳΪϵͳЧʵĹؼΪCSGFDT޸㷨, ģ͹˳޹.ͬʱ༭Ƶǰ£޸㷨޶ȵؼģع貼Ĳ裬ģ͸ӳ̶ߣ޸ѵʱԽ.޸޸лϵ㷨༭ЧʺͿɿ.
ؼʡ༭޸ģ޸
ͼšTP391.72
RESEARCH ON FEATURE EDITING TECHNOLOGY
TANG Liang-Hong, SUN Li-Quan, ZHANG Li-Yong
(Research Institute of Computer Applied Techniques,Harbin University of Science and Technology, Harbin 150001)
AbstractFeature editing has become a key approach for improving ability and efficiency of modeling in feature-based solid modeling. So, based on reusable CSG and FDT technologies, a feature linear modifying algorithm is presented, which is independent of the sequential history of modeling steps. Meanwhile, a nonlinear modifying algorithm that satisfies the assumptions of face-based and volume-based feature design is proposed in feature editing, which can re-evaluate a modified part with minimum Boolean operations thus solving the problem that a part modification's time will cost more with a more complicated structure. An algorithm of combining features linear modifying with nonlinear modifying is given to improve the stability and efficiency of feature editing.
Key wordsfeature editing, feature linear modifying, feature nonlinear modifying
1
ƷǲŻƹ̣ظƷĸơṹƺͲ3׶ΣϵͳбΪ༭漰1ݣ
1Ʒģͱ߽ʾB-repϢ޸ģ
2ƷģϢ޸.
ֻӳƷģ͵ĿӣڼģͼֻӳΪһβ()Ʒģ͵ı߽Ҳͬ£༭޸ĲƷģѴڵ޸ĲƷģ͵ı߽.Ʒģ͵Ŀ޸Ժ޸ѳΪЧʵĹؼΪˣѧ߶༭о ༭ȷԣ˶Ԫأ桢ߺͶ㣩̻ԪصΨһԣʵԪرʶ¾ģеȷݣߴԼλһϵ漰ԪصĲ25.༭Ļ ༭Чʣʵֵ;Чʣ167ǲƷģɱ༭Եķӳ.SuhAhluwalia6ƹУʱͼԶض޸Ѵڵûģͱ߽عʱ޸Ѵĸַ. SuMayer7ڻECTOFextend CSG tree of featuresģ͵Ļϣ޸ĵÿһУȽ߽ĸ飬ȥعECTOFŸECTOF˳عģͣûнһعģ͵Ч.PerngChang1ڻACISģϣ߽ͨĸ飬¼߽İཻͷ3޸ĹУֻཻ߽߽粻ععģ͵ʱ䣬㽻ʽҪֻʺڲ㣬ûиģعľʵ㷨Լϵ.ڻB-repCSGFDTĻģʵĻϣ༭ЧоCSGFDTԺͷ޸ĵ㷨漰4棺 CSGFDTĹϵԼϵ ȥ CSG˳عģ͵޸㷨 ޸㷨޶ȵؼģع貼Ĳ.
2ʵģͼԼϵ
ڻĲϵͳУθȫЧرʾģͣʹΪһЧϢ壬ܹƷơ׶ζϢǹѧоȵ89ݣñ߽ʾB-repCSGFDTĻģʾʵ壬B-rep ¼ʵģ͵ļκϢCSG¼ʵģƹ̵˳һö¼ΧüصָϢFaceListཻCSG㼯InterCsgListCSGϵÿһ㶼ӦFDTFDTһö¼ӦCSG֮ԼϵжͶͨض޸ĿԸıԼϵʹԺ󴴽ȷȴʹʵģڿɱ༭Էģ͹˳޹.֮ԼԼϵ⣬мκԼϵ׼桢׼ߺͻ׼㼰Լߴ磩.ͼ1ʾF2(fdt)(F2FDT)¼丸ΪF1(fdt), Ϊգ׼Ϊf1F3(fdt)¼丸ΪF1(fdt), Ϊգ׼ҲΪf1F1(fdt)¼丸Ϊ, ΪF2(fdt)F3fdtF4(fdt)F5(fdt).Ƶʵģֿʽʾͼ1ʾ.


ͼ1ʽCSG
3޸
༭ֵĲߴԼߴ磩޸ĺͽṹ޸ֵ֣޸Ŀṹ޸ģͼ2(a)УTͲԭĿģнڣͼ2(b)ʾ.ͨ༭عģ͹漰Լϵ⡢CSGFDTĵģͱ߽ĸ£CADI-Deas Master༭ʵǸģ͵CSG˳عģͣҲȥʷ.CSGFDTĻϣҲһعģ͵޸㷨Ҫ˼ǣΪֵ޸ģֵԶʽ飬ȷ⣬CSGϵҶԼвֵΪṹ޸ģCSGFDT޸ĺCSGFDTعģ.㷨CSGFDTĵCSGFDTعģ.


ͼ2
3.1ģ͵CSGFDT
ɾʱҪģ͵CSGFDT豻ɾΪCF㷨£
(1) жCFfdtΪշΪգַͨʽôӦɾ˴ȡFiFiӦCSGɾ־DeleteFlagΪTRUEõݹ鷨FiCFֱͬCFΪֹ
(2) CFӦCSGDeleteFlagΪTRUE
(3) CSG㷨CSGн㣻
(4) ڽcsg_nodei DeleteFlagΪTRUEۣ
 丸parentΪգΪ㣬
 ֵܽDeleteFlagΪFALSEѸFDTchildrenӦcsg_nodeDeleteFlagΪFALSEFDT뵽csg_nodeiֵܽFDTchildrenвøFDTchildrenΪ.
3.2CSGعģ
ֵ¼ģ͵CSGFDTCSGԼ¼ԭģ͵˳򣬵ʱܴDeleteFlagΪTRUEĽ㣬ԭģ͵B-repϢû޸ģعģµ˺ͼϢCSGFDT.ԭCSGFDTعģ㷨£
(1) 㷨ԭģ͵CSG˳ģ͵˳ͬ
(2) ĳһcsg_nodeiʱDeleteFlagΪTRUE ˽㲻Ӧģ͵һ֣ӦԴһ㣻
(3) жcsg_nodeiǷΪҶ㣬ΪҶ㣬ָͺͲһµأΪм㣬ɵʵ尴csg_nodeiָĲ.
(4) ֱԭģ͵CSGΪֹģ͵˺ͼϢCSGFDTҲɽ
(5) 㷨ģ͵CSGCSGÿҶFaceListǷΪգΪգɾҶ㣬ȥ
(6) ͷԭģ͵˺ͼϢCSGFDTռõڴռ.
4ķ޸
޸ļĸӹϵɵȺʹ޸ĳ˫ԣ޸ĻʹڴԺĹ޸.޸㷨޸ĵһʵ֣൱ģ͹˳̣ڴ˷򵥿ɿѱCADãģ͸ӳ̶ߣ޸ѵʱҲԽ.֮以ʹģ͵޸Ķ޸ģʹĳЩҪɶʱϵĻѣ༭Чʣͼ1УHole1׵İ뾶عBlockUslotHole1Hole2Hole3.ΪPerngChang1˻ķ޸ģ˿Թ㷨.Perngоϣͨض޸ģķ޸ĵ㷨޶ȵؼģع貼Ĳ.Ϊ㣬
SF(P) ģSF(P)={F1,F2,Fn}
U(S)SĲU(SF(P)) = {F1F2ȡFn}
CP޸ĵĲģͣ
CF޸ĵ
MP޸ĺĲģͣ
MF޸ĺ
PF޸CFĸ
BF޸CFĻ
SI(Fi)ʾCPFiཻSI(Fi)={Fj|FjSF(CP)Fj Fi, FjCF=,j=1,n}
SI(Fi|BF)ʾFiSF(BF) ཻ
Sop(BF)ʾBFϲ
SC(MF)ʾCPгCFMFSC(MF)={Fj|FjSF(P)FjCFFjMFj=1,n}.
4.1ķ޸
͵ҪֶΣʵҪֶ.ȻƱȽϷ㡢ʵʾӣһԼûΪʵֶ.򽫰뵽ʵ͵༭У޸ĵЧ.ͼ1УûɾHole1ʱظعģͣͨľֲŷ޸ɣֻɾf1f2ϵĸڻL1L2Hole1f3ģBrepϢ޸ģ޸CSGFDT.
ʵ˹ϵӣķ޸ǻ裺
(1) ޸ĵCFΪ(depressive feature)CPĲΪ㡱SI(CF)=PFPFCFཻı߽L(PF,CF)ΪBFڻ
(2) ޸ĵCFΪ͹(protrusive feature)CPĲΪ㡱SI(CF)=PFPFCFཻı߽L(PF,CF)ΪBFڻ
ڻеƷƴʹãй㷺ʵ壬繤ǱƵȣͼ3УԿHole9Hole10Hole11Hole12Hole13ı༭޸ĵļ1з޸.༭MoveShrinkStretchDelete㷨£


ͼ3
(1) EditCommand=MoveShrinkStretch
Stage 1޸ı߽B-rep
Step 1. PFɾPFCFཻı߽L(PF,CF)
Step 2. CFcsg_nodeȡCFı߽B(CF)ɾB(CF)С.
Step 3. CFcsg_nodeϢعµCF1ŸݡCFCPĲCPCF1Ĳ㣻
Stage 2޸CSGFDT
CF(fdt)Childrenǿգûͨض壬ChildrenСÿѸӹϵ߶ChildrenÿԼءϵǷظStage 1Stage 2CF1csg_node滻CFġcsg_node.
(2) EditCommand=Delete
Stage 1޸ı߽B-rep
Step 1. PFɾPFCFཻı߽L(PF,CF)
Step 2. CFcsg_nodeȡCFı߽B(CF)ɾB(CF)С.
Stage 2޸CSGFDT
CFcsg_nodeȡfdtfdtParentǿգôڡParentChildrenȥfdtfdtChildrenǿգûͨض壬ChildrenÿѸӹءϵ߶ChildrenÿԼϵǷظStage1Stage 2CSGɾCFcsg_node.
4.2ķ޸
ʵҪֶΣPerngChang1ķ޸㷨ǻ3裺
(1) ΪBFBFϲ
(2) Ϊdepressive featureCPĲΪ㡱
(3) ޸ĵCF.
ΪӦƷҪֲ򵥵帴ӵĻе繤ƷȼװƣжPerng㷨˸Ľ÷ΧĻ޸㷨2裺
(1) BFΪCPһ
(2) Sop(BF)Ϊdepressive featureCPĲΪ㡱
Perng㷨ĵ3ڲн˸ĽʲҪ.㷨£
 EditCommand = MoveShrinkStretch
Stage 1޸ı߽B-rep
Step 1. CFMFCFMFCFcsg_nodešϢعµCF1CPCF1㡱MP=CP-MF
Step 2. SI(CF|BF)=SI(CF)=CFcsg_nodeǡ¼ԭϢعµCF1CPCF1㡱ٸCFcsg_node¼޸ĺϢعµġCF2CPCF2㡱MP=(CP+CF)-MF.SI(CF|BF)١SI(CF)=SI(CF|BF)MP=(CP+CF)-U(SI(CF))-MFͼ3ԿסHole1޸ģSI(Hole1)={Hole2, Hole3, Hole4}U(SI(Hole1)) = {Hole2Hole3Hole4},ֻ5βȿͼ3ı߽ء.
Stage 2޸CSGFDT
Step 1. CFMFCFMFSI(CF|BF)=SI(CF)=MFġcsg_node滻CFcsg_node 㣻żSC(MF)SC(MF)٣CSGɾSC(MF)Ӧcsg_node㣻
Step 2. CFMFSI(CF|BF)SI(CF)=SI(CF|BF)MF͡SI(CF|BF) عӦcsg_nodeֱ滻CF͡SI(CF|BF)Ӧcsg_node 㣻żSC(MF)SC(MF)١CSGɾSC(MF)Ӧcsg_node㣻ͼ3жԡHole1޸ʱHole1Hole2Hole3Hole4¾ɡcsg_node滻.
 EditCommand = Delete
Stage 1޸ı߽B-rep
Step 1. SI(CF|BF)=SI(CF)=CFcsg_node¼ءԭϢعµCF1CPCF1㡱MP=CP+CF
Step 2. SI(CF|BF)SI(CF)=SI(CF|BF)MP=CP+CF-U(SI(CF)).
Stage 2޸CSGFDT
Step 1. ɾCF1CFӦcsg_node㣻
Step 2. SI(CF|BF)SI(CF)= SI(CF|BF)SI(CF|BF)ع
Ӧcsg_nodeֱ滻SI(CF|BF)Ӧcsg_node .
4.3ķ޸
ķ޸Ķڼģ÷ΧܵƣûԸģͽ༭Ѱռ.Ϊ˸޸ĺͻķ޸лϵ༭㷨ʹκβƷģ͵޸ģûؿǷ޸ĵļģ͵༭Чʣ֤ɿ.㷨£
1 ж޸ĵǷ޸ĵļǣ޸ģ
2 ж޸ĵǷ޸ĵļǣ޸ģ
3޸.
5
3ʵ༭㷨ԣ3лϼ༭Чʣֱ֤ɿ.Է޸ĸ˵޸ʱĸӳ̶ȲԱ޸Чʴ.㷨ļҵϵͳCAIDʵ֣ʹ༭Чʵõ˼ߣҪص㣺
(1) CSG޸㷨ͨԼϵ༭
(2) 뵽༭У޸㷨޶ȵؼģع貼Ĳ裻
(3) CSGнFaceListΪʶṩֶΣ
(4) ɵȺ˳޹.
һоؿķ޸㷨ļ.
õҡ塱Ŀ(Ŀ96A01010101)ͻеҵչĿ(Ŀ96JA0709).
߼:죬У19686ʿоҪоΪ͡ͼѧCAD.
ԣ1944ڣҪоΪͼѧCAD.
£У1939ڣʿʦҪоΪǱCAD.
ߵλ:ѧӦüо150001
ο
1Perng D B, Chang C F. Resolving feature interactions in 3D part editing. Computer-Aided Design, 1997, 29(10): 687699
2Kripac J. A mechanism for persistently naming topological entities in history-based parametric solid models. Computer-Aided Design, 1997, 29(2): 113122
3Capoyleas V, Chen X, Hoffmann C M. Generic naming in generative constraint-based design. Computer-Aided Design, 1996, 28(1): 1726
4Chen X, Hoffmann C M. On editability of feature-based design. Computer-Aided Design, 1995, 27(12): 905914
5Wu J. Topological naming mechanism in feature-based modelling. CADDM,1997, 7(2): 7178
6Suh H, Ahluwalia R S. Feature modification in incremental feature generation. Computer-Aided Design, 1995, 27(8): 627635
7Su C J, Mayer R J. Three-phase method for feature interaction resolution. Journal of Design and Manufacturing, 1994, 4(2): 153166
8Anderl R, Mendgen R. Modeling with constraints: Theoretical foundation and application. Computer-Aided Design, 1996, 28(3): 155168
9Tsai P, Fu C, Chieng W. Analysis and synthesis of geometric models using tree-structured relations. Computer-Aided Design, 1997, 29(9): 607615 
ԭյڣ1999-01-13
޸ĸյڣ1999-05-25.
