CN104794133A - Conversion algorithm from CAD model to MCNP geometric model based on STEP text - Google Patents

Conversion algorithm from CAD model to MCNP geometric model based on STEP text Download PDF

Info

Publication number
CN104794133A
CN104794133A CN201410027712.2A CN201410027712A CN104794133A CN 104794133 A CN104794133 A CN 104794133A CN 201410027712 A CN201410027712 A CN 201410027712A CN 104794133 A CN104794133 A CN 104794133A
Authority
CN
China
Prior art keywords
lattice cell
node
lattice
tree
curved surface
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201410027712.2A
Other languages
Chinese (zh)
Other versions
CN104794133B (en
Inventor
周庆国
吴炯
杨家明
汪俊琼
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Lanzhou University
Original Assignee
Lanzhou University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Lanzhou University filed Critical Lanzhou University
Priority to CN201410027712.2A priority Critical patent/CN104794133B/en
Publication of CN104794133A publication Critical patent/CN104794133A/en
Application granted granted Critical
Publication of CN104794133B publication Critical patent/CN104794133B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention provides a conversion algorithm from a CAD model to an MCNP geometric model based on an STEP text, and the algorithm relates to the technical fields of physics and nuclear science. The algorithm is based on the STEP text generated by CAD software, information extraction is carried out on the STEP text, then a geometric algorithm is used for restoring a real model structure, finally conversion is carried out on an INP text format which can be recognized by the MCNP. In order to solve complex model problems, all lattice cell information of a model is stored in a lattice cell tree by adopting a method for constructing the lattice cell tree by the algorithm, and by means of the traverse lattice tree, the INP text format which can be recognized by the MCNP can be output. Outputs of a hook face card and a lattice cell card are free from omission, the position is accurate, and the treatment is flexible.

Description

Based on STEP file from cad model to the transfer algorithm of MCNP geometric model
Technical field
The present invention relates to the fields such as physics, nuclear science technology and CAD modeling, core content be based on STEP file from cad model to the transfer algorithm of MCNP geometric model.
Background technology
Monte Carlo neutron-photon transport program MCNP (Monte Carlo N-Particle Code) is the large-sized multifunction Monte Carlo PARTICLE TRANSPORT FROM program based on monte carlo method of Monte Carlo group through the research and development of many decades of Los Alamos National Laboratories of New Mexico of U.S. utility theory physical department.Because its good PARTICLE TRANSPORT FROM performance has a wide range of applications in physics, nuclear science field.But its input file (INP file) complex structure, the hand-written problem such as easily to make mistakes, there is the software much addressed this problem in the world, similar Visual Editor, the softwares such as Moritz, DesignModeler, MCAM, due to these softwares have can not adding material, the reason such as can not to modify to the model imported had can not meet the demand of user.In addition, the thinking that can solve the problem roughly has three classes, looks like from BREP and represents the conversion that CSG represents, two is the secondary development based on large-scale three dimensional modeling software, and three is the conversions based on neutral file.The first expression due to two kinds of conversions relates to a large amount of mathematical knowledges and the knowledge of computer graphics, can bring many troubles in the process of conversion.The second is too easily subject to the restriction of the data structure definition of software own, and is all business software at generally large-scale 3 d modeling software as CATIA and solidworks etc., and copyright is very expensive.Therefore we have proposed based on neutral file STEP(Stander for theExchange of Product Model Data) from cad model to the transfer algorithm of MCNP geometric model.Because CAD system has powerful Geometric Modeling function, we are being converted to INP file after the model that CAD system builds can being exported to STEP file.
STEP standard is ISO(ISO (International Standards Organization)) information exchange standard that proposes, by a kind of neutrality mechanism not relying on any system, for the data exchange and sharing solved between different CAX system provides feasibility.STEP can be supported by multiple CAD modeling software, therefore by designing the transfer algorithm of STEP file to INP file to realize the conversion of cad model to MCNP model, finally realize MCNP and assist modeling, such transfer algorithm has versatility, can realize the mutual of multiple CAD system and MCNP model.
Summary of the invention
For INP file layout, mutual in order to what realize between general CAD modeling software and MCNP model, the present invention disclose a kind of completely newly based on STEP file from cad model to the transfer algorithm of MCNP geometric model.
The present invention is by analyzing STEP file, geological information useful in extraction document, by further geometric operation, obtain geological information and the topology information of INP file needs, then convert cad model to corresponding lattice cell card and curved surface card form according to INP file layout, what complete between CAD modeling software and MCNP model is mutual.In order to improve the dirigibility of algorithm, carry out analysis foundation improves to body in previous stage, the algorithm after improvement can directly be analyzed the face in model, can export the curved surface card of arbitrary model.Output for lattice cell card then adopts the method for structure lattice cell tree to carry out.This part will be divided into four parts to introduce summary of the invention, mainly be divided into, this algorithm Integral Thought, to STEP fileinfo extraction algorithm, and structure lattice cell tree algorithm and lattice cell tree output algorithm.
Total algorithm step of the present invention is as follows:
Step1 extracts closed housing (CLOSED_SHELL) information in STEP file: generate desired parameters according to different curved surface cards and extract the information such as method direction, point coordinate radius, angle corresponding in STEP file.Generate according to different lattice cell cards the information that desired parameters extracts quite corresponding body in STEP file, and the character conversion of correspondence is become numeral;
All surface equations that Step2 forms closed housing (CLOSED_SHELL) are asked for: the type first judging curved surface according to the key word in STEP file, then according to the information extracted in Step1, are calculated the equation obtaining various curved surface by mathematics geometry.State new lattice cell node and according to curved surface card form, the parameter of all curved surfaces comprised in closed housing and surface information be all stored in this node;
In Step3STEP file, between closed housing (CLOSED_SHELL), relation of inclusion judges: if closed housing A comprises closed housing B, then Produce (A, B)=1; If closed housing B comprises closed housing A, then Produce (A, B)=-1; If there is not relation of inclusion in closed housing A and closed housing B, then Produce (A, B)=0;
Step4 lattice cell tree structure: according to the rreturn value structure lattice cell tree of Produce (A, B) function in Step3.Here suppose that C1 is the lattice cell node newly added, C2 is the node in lattice cell tree, and all lattice cell nodes in being set with lattice cell by node C1 compare Produce (C1, the C2) value namely asking corresponding.When Produce (C1, C2)=1, using the child nodes of A as B; As Produce (C1, C2)=-1, using the father node of A as B; When Produce (C1, C2)=0, using the brotgher of node of A as B;
Step5 judges in STEP file, whether all closed housing search complete: when completing, turn Step6; If no, turn Step1;
Step6 selects label mode to carry out label to lattice cell in lattice cell tree;
Step7 curved surface card, lattice cell card exports: traversal lattice cell tree, export the information of the curved surface card comprised in all lattice cell nodes in lattice cell tree according to the order of sequence in txt file, simultaneously using the lattice cell node that traverses as root node, again travel through all nodes of all layers below this node, obtain they lattice cell number and with " a ± f1 ± f2 ... #b#c#d ... " form be output in same txt file that (a represents current lattice cell node lattice cell number, f1, f2 ... represent the curved surface number of this lattice cell boundary surface ± represent curved surface direction, b, c, d ... represent the lattice cell number of all floor lattice cell nodes below current lattice cell node),
Step8 algorithm terminates.
Because the information in STEP file includes the whole life cycle of product, abundant information, we only need obtain the information needed for us.So this algorithm only extracts when carrying out information extraction to STEP file export useful information to lattice cell card and curved surface card.
What adopt during extraction for STEP fileinfo in Step1 is mode information extraction by call number and key word.
For the pattern reading that general STEP file can not be only according to row, because STEP file may be there is not stored in rows, so this algorithm is taked to carry out file reading using branch as end mark, avoid form difference and read failed situation generation.
STEP fileinfo extraction algorithm step is as follows:
Step1 makes K=" CLOSED_SHELL ";
Step2 reads STEP file using branch as reading end mark and is stored in character array ch1;
Step3 judges K whether in this character array, is turn Step4, otherwise turns Step2;
Index number in character array ch1 bracket is deposited in character array ch2 by Step4, makes K=" ch2 [i]=";
Step5 reads STEP file using branch as reading end mark and is stored in character array ch1;
Whether Step6 judges to have about the character string (as " PLANE ", " CYLINDRICAL_SURFACE " etc.) of curved surface type and character string " CARTESIAN_POINT " and " DIRECTION " in array string ch1, be turn Step7, otherwise turn Step4;
Step7 extracts different parameters according to crucial subtype different in Step6, and in lattice cell node character conversion being become corresponding numeral to deposit corresponding to this CLOSED_SHELL;
Step8 algorithm terminates.
This algorithm when stating new lattice cell node, comprise inside node form each face of closed housing normal vector, point, radius, drift angle, lattice cell sequence number, composition closed housing the curved surface card of all and point to three pointer informations of child, brother and father's node.
What the relation of inclusion between the judgement closed housing in algorithm adopted is point-to-area algorithm.
Point-to-area algorithm realization following (A, B with suppose above identical): extract all opposites group forming closed housing A, be set to (f 11, f 12), (f 21, f 22), (f 31f 32) ..., get any point M on B, judge whether relational expression is below set up:
Σ i = 1 n ( d ( M , f i 1 ) + d ( M , f i 2 ) ) = Σ i = 1 n d ( f i 1 , f i 2 )
D (M, f in above formula i1), d (M, f i2) represent that some M is to face f i1and f i2distance
D (f i1, f i2) presentation surface f i1with f i2between distance.
N represents the group number of opposite group.
If above formula is set up, A (B) is contained in B (A), otherwise B and A does not exist relation of inclusion.
Except the group of opposite, also comprise independent face in the curved surface of composition closed housing, namely there is not on the other side of the position in face.
For such curved surface, consider separately in algorithm.As the face of cylinder, only need judge whether formula d (M, f) < R sets up, if set up, B is contained in A, otherwise there is not relation of inclusion.
What Produce (A, B) function in Step3 adopted is point-to-area algorithm returns different value that is 1 ,-1,0 to different relation of inclusion.
In STEP file closed housing (CLOSED_SHELL) storage order be not according to cad model in lattice cell order from inside to outside carry out depositing, the lattice cell newly added may comprise the lattice cell in tree, be-1 for this situation Produce (A, B) function return value.
When lattice cell in setting comprises the lattice cell newly added, Produce (A, B) function return value is 1.
When lattice cell in setting and the lattice cell newly to add mutual independent time, Produce (A, B) function return value is 0.
The rreturn value different according to Produce (A, B) takes different operations to construct lattice cell tree.
Structure lattice cell tree algorithm step following (C1, C2 are the same):
A lattice cell is regarded as in cosmic space by Step1, and as the root node T that lattice cell is set;
Step2 judges whether the child nodes of root node is Null, is turn Step3, otherwise turns Step4;
Step3 states a new lattice cell node, and carries out initialization.The information of the closed housing newly added (CLOSED_SHELL) be all stored in this lattice cell node C1, a closed housing just can regard a lattice cell as.Using the child nodes of C1 as root node;
C1 and C2 is carried out relation of inclusion calculating by Step4, obtains Produce (C1, C2) value;
Step5
1) when Produce (C1, C2)=1 and C2 child node is Null time, using C1 directly as the child node of C2 insert lattice cell tree turn Step6
2) as Produce (C1, C2)=-1, using C1 as C2 father node insert lattice cell tree turn Step6;
3) when Produce (C1, C2)=0 and the C2 brotgher of node is Null time, using C1 directly as the brotgher of node of C2 insert lattice cell tree turn Step6;
4) when Produce (C1, C2)=1 and C2 child node is not Null time, make C2 be that the child node of C2 turns Step4;
5) when Produce (C1, C2)=0 and the C2 brotgher of node is not Null time, using C1 directly as the brotgher of node of C2 insert lattice cell tree turn Step4;
Step6 algorithm terminates.
This algorithm adopts the method for structure lattice cell tree to store the curved surface card information of all curved surfaces of all lattice cell information and this lattice cell of composition in whole space.Only need travel through this lattice cell tree in the output procedure of carrying out curved surface card and lattice cell card, and lattice cell tree has random expansion, the features such as dirigibility is large, have more advantage in the cad model processing procedure of complexity.
In the process of carrying out lattice cell label, this algorithm adopts automatic numbering and artificial label two kinds of modes to carry out, and can change arbitrarily lattice cell sequence number according to actual needs, be so more conducive to the simulation of PARTICLE TRANSPORT FROM in the process of carrying out file transform.
N+1, n+2 must be comprised above by the known n-th layer lattice cell of structure that lattice cell is set ... all lattice cells of layer, this algorithm adopts traversal n+1, n+2 cleverly ... the method of all nodes in layer, obtain its lattice cell number, then with " a ± f1 ± f2 ... #b#c#d ... " mode lattice cell card is exported.
Lattice cell card output algorithm step is as follows:
Step1 gets the root node in lattice cell tree, exports the lattice cell number of this lattice cell node;
Step2 travels through the node below this node in each layer, often traverses a node and just exports in the mode of " # lattice cell number " in same a line;
Step3 judges whether the brotgher of node of this node and child nodes are empty: if child nodes and the brotgher of node are sky, then turn Step4, if only have one of them node not for this node is just turned Step2 as root node by sky, if two nodes are not all sky, child nodes is continued the brotgher of node to turn Step2 as root node after root node turns Step2;
Step4 algorithm terminates.
Accompanying drawing explanation
Fig. 1 is whole STEP file transform algorithm flow chart
Fig. 2 is all information structure diagrams comprised in lattice cell node
Fig. 3 is STEP fileinfo extraction algorithm process flow diagram
Fig. 4 is lattice cell tree construction algorithm process flow diagram
Fig. 5 is the case study on implementation schematic diagram of lattice cell of the present invention tree structure
Fig. 6 is a case study on implementation schematic diagram of the present invention
Embodiment
Embodiment 1, the present embodiment relates to the conversion method of general CAD spanned file STEP file, and its process flow diagram is with reference to Fig. 1.Concrete step comprises the extraction of STEP fileinfo, lattice cell tree structure, carries out label, the output of curved surface card and the output of lattice cell card to lattice cell in lattice cell tree.
Step one, STEP fileinfo extract
1) using branch as end mark, character string containing key word " CLOSED_SHELL " in search STEP file is (as #96=CLOSED_SHELL (' ', (#97, #98, #99, #100, #101, #102)); ), all index sequence number characters in bracket after it are added character "=" is stored in (ch []={ " #97=", " #98=", " #99=", " #100=", " #101=", " #102=" } in a character array; ), the character string (below for ch [0]) then containing ch [i] in search file obtains " #97=ADVANCED_FACE (' ', (#113), #105 .F.); ) ".
2) for the character string containing key word " ADVANCED_FACE "; in order to avoid information redundancy, only call number " #105 " is put in index character array, continues the character string of search containing " #105="; obtain " #105=PLANE (' ', #232); ".
3) now; what can determine that " #97 " represent by key word " PLANE " is a plane (key word that curved surface dissimilar in STEP file is corresponding different; common are " CYLINDRICAL_SURFACE " face of cylinder, " SPHERICAL_SURFACE " sphere, " CONICAL_SURFACE " circular conical surface and " PLANE " plane; different key words has different search information); continue the character string of search containing " #232="; obtain " #232=AXIS2_PLACEMENT_3D (' '; #285; #246, #247); ".
4) for the character string containing key word " AXIS2_PLACEMENT_3D "; also for ease of and avoid information redundancy; only call number " #285 " and " #246 " are put in index character array; continue the character string of search containing " #285=" and " #246="; obtain " #285=CARTESIAN_POINT (' '; (-30., 17.3205080756888,100.)); " and " #246=DIRECTION (' ', (1., 0., 0.)); " key word " CARTESIAN_POINT " represents a little, " DIRECTION " represents the normal vector of this plane.
5) character string of process containing key word " CARTESIAN_POINT " and " DIRECTION ": extracting directly goes out point coordinate and vectorial coordinate and converts thereof into numeral, is stored in the lattice cell node of this (CLOSED_SHELL) correspondence.If conversion back plane normal vector , point (x 0, y 0, z 0), just trying to achieve plane equation is:
Ax+By+Cz-D＝0
Wherein D=Ax 0+ By 0+ Cz 0, the curved surface card of correspondence and curved surface number (often increase a curved surface, curved surface number adds 1) are stored in this lattice cell node.
Table one, obtains the curved surface card in variety classes face and judges that between lattice cell, relation of inclusion needs the information in the STEP file extracted:
Step 2, lattice cell tree structure.Constitution step is shown in Fig. 4, and the existing tree of the lattice cell to Fig. 6 constructs (lattice cell node E, F are inserted in lattice cell tree, E is contained in lattice cell C, and F comprises C and independent mutually with A and D).
1) all lattice cell A in setting, B, C, D and lattice cell E carry out relation of inclusion judgement, and the lattice cell A during E first sets with lattice cell carries out relation of inclusion and judges to obtain Produce (A, E)=0 (namely lattice cell E and lattice cell A is separate).
2) according to algorithm flow Fig. 4, next carry out lattice cell that relation of inclusion judges with E as C, obtain Produce (C, E)=1 (namely lattice cell E is contained in C).
3) according to algorithm flow Fig. 4, next carry out lattice cell that relation of inclusion the judges child node as lattice cell C with E, and the child node of C be empty, thus E will be inserted into as the child node of lattice cell C during lattice cell sets.
4) all lattice cell A in setting, B, C, D, E and lattice cell F carry out relation of inclusion judgement, and the lattice cell A during F first sets with lattice cell carries out relation of inclusion and judges to obtain Produce (A, F)=0 (namely lattice cell F and lattice cell A is separate).
5) according to algorithm flow Fig. 4, next carry out lattice cell that relation of inclusion judges with F as C, obtain Produce (C, F)=-1 (namely lattice cell F comprises C).The brotgher of node of C is not empty again, nextly carries out lattice cell that relation of inclusion judges with F as D, obtains Produce (D, F)=0 (i.e. lattice cell F and D independence mutually).
6) according to algorithm flow Fig. 4, F is inserted in lattice cell tree as the father node of C, and using the brother (fraternal pointed F by A) of F as A, using the brotgher of node (fraternal pointed D by F) of D as F.
7) lattice cell tree structure terminates.
Step 3, to lattice cell tree in lattice cell carry out label
Step 3 has two kinds of label modes to select, i.e. automatic labeling and artificial label.Automatic labeling only need travel through whole lattice cell tree, and often traverse a lattice cell node, lattice cell number just adds one, and is stored in lattice cell node by lattice cell number.Automatic labeling (rear root traversal label) result is carried out as Fig. 8 to Fig. 7.Namely artificial label mode carries out label according to personal inclination and actual needs to lattice cell in lattice cell tree, in the process of carrying out artificial label, take the several lattice cells to wherein specifying to carry out label, the mode that other lattice cells are random, the concrete steps of this kind of case label are as follows:
Step1 travels through lattice cell tree, chooses the lattice cell that will carry out artificial label, write artificial label, and record label maximal value Max in the process of traversal;
Step2 travels through lattice cell tree again, and to the lattice cell label of non-label, label numeral is from Max+1;
Step3 label terminates.
Step 4, curved surface card export and lattice cell card exports.
1) curved surface card exports, traversal lattice cell tree, often traverse a lattice cell node just by the curved surface card in this lattice cell node of composition according to mode export curved surface number and curved surface card.
2) lattice cell card exports, and carries out the output of lattice cell card to Fig. 5.Travel through this lattice cell tree from the bottom up, first lattice cell exported is B, again B without child without brother, so only export B lattice cell number 1, traversing second, third lattice cell is that E, D and B character is identical thus only export lattice cell numbers 2,3 (only discussing to lattice cell output) here.
3) next traverse lattice cell node C, using C as root node, below traversal C, all nodes of all layers obtain node E, obtain the lattice cell card of the 4th lattice cell for " 4#2 " according to lattice cell card output form.Next according to method processing node F, A and the root node successively obtaining the 4th lattice cell lattice cell card.Obtain respectively " 5#2#4 ", " 6#1 " and " 7#1#2#3#4#5#6 ", outputs in txt file by row.

Claims (8)

1., based on the MCNP input file transfer algorithm of STEP file, its feature comprises the following steps:
Step1 extracts closed housing (CLOSED_SHELL) information in STEP file: generate desired parameters according to different curved surface cards and extract the information such as method direction, point coordinate radius, angle corresponding in STEP file.Extract corresponding information according to STEP fileinfo extraction algorithm, and the character conversion of correspondence is become numeral;
All surface equations that Step2 forms closed housing (CLOSED_SHELL) are asked for: the type first judging curved surface according to the key word in STEP file, then according to the information extracted in Step1, are calculated the equation obtaining various curved surface by mathematics geometry.State new lattice cell node and according to curved surface card form, the parameter of all curved surfaces comprised in closed housing and surface information be all stored in this node;
In Step3STEP file, between closed housing (CLOSED_SHELL), relation of inclusion judges: ask Produce () value according to point-to-area algorithm, if closed housing A comprises closed housing B, then and Produce (A, B)=1; If closed housing B comprises closed housing A, then Produce (A, B)=-1; If there is not relation of inclusion in closed housing A and closed housing B, then Produce (A, B)=0;
Step4 lattice cell tree structure: according to the rreturn value structure lattice cell tree of Produce (A, B) function in Step3.Here suppose that C1 is the lattice cell node newly added, C2 is the node in lattice cell tree, and all lattice cell nodes in being set with lattice cell by node C1 compare Produce (C1, the C2) value namely asking corresponding.When Produce (C1, C2)=1, using the child nodes of A as B; As Produce (C1, C2)=-1, using the father node of A as B; When Produce (C1, C2)=0, using the brotgher of node of A as B;
Step5 judges in STEP file, whether all closed housing search complete: when completing, turn Step6; If no, turn Step1;
Step6 selects label mode to carry out label to lattice cell in lattice cell tree;
Step7 curved surface card, lattice cell card exports: traversal lattice cell tree, export the information of the curved surface card comprised in all lattice cell nodes in lattice cell tree according to the order of sequence in txt file, simultaneously using the lattice cell node that traverses as root node, again travel through all nodes of all layers below this node, obtain they lattice cell number and with " a ± f1 ± f2 ... #b#c#d ... " form be output in same txt file that (a represents current lattice cell node lattice cell number, f1, f2 ... represent the curved surface number of this lattice cell boundary surface ± represent curved surface direction, b, c, d ... represent the lattice cell number of all floor lattice cell nodes below current lattice cell node),
Step8 algorithm terminates.
2. the MCNP input file transfer algorithm based on STEP file according to claim 1, it is characterized in that the STEP fileinfo extraction algorithm described in Step1 be with "; " to read STEP fileinfo as end mark.
3. the MCNP input file transfer algorithm based on STEP file according to claim 1, is characterized in that the STEP fileinfo extraction algorithm described in Step1 is for unit reads according to one " CLOSED_SHELL ".
4. the MCNP input file transfer algorithm based on STEP file according to claim 1, is characterized in that the lattice cell node described in Step2 comprises following content: surface information (on curved surface card, the center of circle or sphere centre coordinate, radius, face a point coordinate); The radius that closed housing exists and angle, when not existing, radius and angle are 0; Point to three pointers of child node, the brotgher of node and father node.
5. the MCNP input file transfer algorithm based on STEP file according to claim 1, is characterized in that the point-to-area algorithm described in Step3 is defined as follows:
&Sigma; i = 1 n ( d ( M , f i 1 ) + d ( M , f i 2 ) ) = &Sigma; i = 1 n d ( f i 1 , f i 2 )
D (M, f in formula i1), d (M, f i2) represent that some M is to face f i1and f i2distance, d (f i1, f i2) presentation surface f i1with f i2between distance, n represents the group number of opposite group.
6. the MCNP input file transfer algorithm based on STEP file according to claim 1, it is characterized in that the lattice cell tree building method described in Step4 is that lattice cell information all in whole space (is comprised each face of composition lattice cell, the curved surface card in each face and lattice cell sequence number, the material type of putting in lattice cell and density) be stored in lattice cell tree in the mode of lattice cell node, if two lattice cells show as relation of inclusion and occur with set membership in lattice cell tree, if two lattice cell nodes are independent mutually, occur with brotherhood in lattice cell tree.
7. the MCNP input file transfer algorithm based on STEP file according to claim 1, is characterized in that the lattice cell index methods described in Step6 is for can select automatic labeling and artificial label two kinds of modes.
8. the MCNP input file transfer algorithm based on STEP file according to claim 1, it is characterized in that the lattice cell card output intent described in Step7 be while traversing a lattice cell node, travel through this all node of node lower floor formula of putting to export lattice cell card.
CN201410027712.2A 2014-01-21 2014-01-21 Based on STEP files from CAD model to the transfer algorithm of MCNP geometrical models Active CN104794133B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410027712.2A CN104794133B (en) 2014-01-21 2014-01-21 Based on STEP files from CAD model to the transfer algorithm of MCNP geometrical models

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410027712.2A CN104794133B (en) 2014-01-21 2014-01-21 Based on STEP files from CAD model to the transfer algorithm of MCNP geometrical models

Publications (2)

Publication Number Publication Date
CN104794133A true CN104794133A (en) 2015-07-22
CN104794133B CN104794133B (en) 2018-02-02

Family

ID=53558927

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410027712.2A Active CN104794133B (en) 2014-01-21 2014-01-21 Based on STEP files from CAD model to the transfer algorithm of MCNP geometrical models

Country Status (1)

Country Link
CN (1) CN104794133B (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105759724A (en) * 2016-03-31 2016-07-13 孙丽君 Intelligent programming method
CN106202149A (en) * 2016-06-22 2016-12-07 南京南瑞继保电气有限公司 A kind of IEC61850 model file conversion method
CN106709163A (en) * 2016-12-06 2017-05-24 清华大学 Method for automatically converting complicated CAD three-dimensional model to monka geometry
CN108572925A (en) * 2018-02-26 2018-09-25 湖南戈人自动化科技有限公司 A kind of binary data storage method that STEP files are equivalent
CN110517350A (en) * 2019-08-15 2019-11-29 北京理工大学 A kind of Monte-Carlo particle transports the preprocess method and processor of calculation procedure
CN110866056A (en) * 2019-10-31 2020-03-06 北京索为系统技术股份有限公司 Method, device and equipment for processing lightweight STEP file
CN111291433A (en) * 2020-01-17 2020-06-16 北京理工大学 Data conversion method and device for MCNP three-dimensional pretreatment

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000011013A (en) * 1998-06-24 2000-01-14 Sony Corp Data format conversion error canceling device, its method and data format conversion device
CN101692257A (en) * 2009-09-25 2010-04-07 华东理工大学 Method for registering complex curved surface
CN101923467A (en) * 2010-08-13 2010-12-22 沈阳黎明航空发动机(集团)有限责任公司 Method for model transmission among CAD (Computer-Aided Design) software, UG (Unigraphics) software and CAE (Computer-Aided Engineering) software

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000011013A (en) * 1998-06-24 2000-01-14 Sony Corp Data format conversion error canceling device, its method and data format conversion device
CN101692257A (en) * 2009-09-25 2010-04-07 华东理工大学 Method for registering complex curved surface
CN101923467A (en) * 2010-08-13 2010-12-22 沈阳黎明航空发动机(集团)有限责任公司 Method for model transmission among CAD (Computer-Aided Design) software, UG (Unigraphics) software and CAE (Computer-Aided Engineering) software

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
程蓉等: "基于STEP文件的BOM自动提取技术", 《工具技术》 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105759724A (en) * 2016-03-31 2016-07-13 孙丽君 Intelligent programming method
CN106202149A (en) * 2016-06-22 2016-12-07 南京南瑞继保电气有限公司 A kind of IEC61850 model file conversion method
CN106202149B (en) * 2016-06-22 2019-07-23 南京南瑞继保电气有限公司 A kind of IEC61850 model file conversion method
CN106709163A (en) * 2016-12-06 2017-05-24 清华大学 Method for automatically converting complicated CAD three-dimensional model to monka geometry
CN106709163B (en) * 2016-12-06 2019-12-24 清华大学 Automatic conversion method from complex CAD three-dimensional model to Monte-card geometry
CN108572925A (en) * 2018-02-26 2018-09-25 湖南戈人自动化科技有限公司 A kind of binary data storage method that STEP files are equivalent
CN108572925B (en) * 2018-02-26 2022-04-12 湖南戈人自动化科技有限公司 STEP file equivalent binary data storage method
CN110517350A (en) * 2019-08-15 2019-11-29 北京理工大学 A kind of Monte-Carlo particle transports the preprocess method and processor of calculation procedure
CN110517350B (en) * 2019-08-15 2021-07-20 北京理工大学 Preprocessing method and processor of Monte Carlo particle transport calculation program
CN110866056A (en) * 2019-10-31 2020-03-06 北京索为系统技术股份有限公司 Method, device and equipment for processing lightweight STEP file
CN110866056B (en) * 2019-10-31 2022-06-10 北京索为系统技术股份有限公司 Method, device and equipment for processing lightweight STEP file
CN111291433A (en) * 2020-01-17 2020-06-16 北京理工大学 Data conversion method and device for MCNP three-dimensional pretreatment

Also Published As

Publication number Publication date
CN104794133B (en) 2018-02-02

Similar Documents

Publication Publication Date Title
CN104794133A (en) Conversion algorithm from CAD model to MCNP geometric model based on STEP text
CN103886641B (en) Mountainous City areal geology threedimensional model builds integrated approach
CN103279980B (en) Based on the Leaf-modeling method of cloud data
Correa et al. Topological spines: A structure-preserving visual representation of scalar fields
CN104462163B (en) A kind of threedimensional model characterizing method, search method and searching system
CN102609982B (en) Topology discovery method of space geological data based on unstructured mode
CN103400372B (en) A kind of three-dimensional topology information extracting method described based on Reeb figure
CN110134724A (en) A kind of the data intelligence extraction and display system and method for Building Information Model
Glocer et al. Separator reconnection at the magnetopause for predominantly northward and southward IMF: Techniques and results
CN108763376A (en) Syncretic relation path, type, the representation of knowledge learning method of entity description information
CN103080941A (en) Apparatus for generating computational data, method for generating computational data, and program for generating computational data
CN109344459A (en) A kind of visual modeling of Monte-Carlo code and conversion method and system
CN102521878A (en) Programmable three-dimensional human body modeling and human body measurement system and method thereof
CN105513131A (en) Three-dimensional geological structure model angular point grid dissection method considering folds
CN104167021A (en) Space target indexing method based on terrestrial space three-dimensional partition
CN116050689B (en) Intelligent searching method, system, terminal and medium for wide-area space railway line
CN105719344B (en) A kind of generation method of three-dimensional land use data model
CN106844610A (en) A kind of distributed structured three-dimensional point cloud image processing method and system
Ackerman et al. Geospatial capabilities of HEC-RAS for model development and mapping
CN106599514A (en) Non-associative multi-level space division tree-based Monte Carlo facet geometric processing method
CN110349262A (en) A kind of tunnel geological forecast three-dimensional modeling method and system based on BIM
CN104090945B (en) Geographic space entity constructing method and system
CN106528916B (en) A kind of adaptive subspace segmentation cooperative system for fusion reactor kernel analysis
CN115393542B (en) Generalized building three-dimensional geometric reconstruction method
CN104346393B (en) The modeling method of atomic scale data element model

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
EXSB Decision made by sipo to initiate substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant