CN106599514A - Non-associative multi-level space division tree-based Monte Carlo facet geometric processing method - Google Patents
Non-associative multi-level space division tree-based Monte Carlo facet geometric processing method Download PDFInfo
- Publication number
- CN106599514A CN106599514A CN201611246440.0A CN201611246440A CN106599514A CN 106599514 A CN106599514 A CN 106599514A CN 201611246440 A CN201611246440 A CN 201611246440A CN 106599514 A CN106599514 A CN 106599514A
- Authority
- CN
- China
- Prior art keywords
- solid
- dough sheet
- particle
- tree
- cut tree
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a non-associative multi-level space division tree-based Monte Carlo facet geometric processing method. According to the method, a multi-level space division tree in imported, so that the efficiencies of particle track in/out point computation and particle position locating computation of a Monte Carlo facet during the Monte Carlo computation can be improved; and meanwhile, the method is capable of realizing the coexistence of facet models and constructive solid geometric models, so that the great computational efficiency reduction caused by completely importing the facet models is avoided. According to the method, the facet model computational efficiency can be remarkably enhanced to achieve a level comparative to the traditional geometry, so that the practicability of any geometric Monte Carlo computation on the basis of facets is realized.
Description
Technical field
The present invention relates to be based on the geometry of the complex appts Monte Carlo PARTICLE TRANSPORT FROM modeling of Computer Aided Modeling (CAD)
Processing method, particularly a kind of Monte Carlo dough sheet geometric manipulations method based on the multistage space cut tree of dereferenced.
Background technology
High-fidelity numerical simulation plays more and more important effect in the optimization of core system design with security evaluation, for example：
The design of advanced reactor, existing reactor lengthen the life, reduce nuke rubbish and improve fuel availability, overall process security evaluation etc.,
As society is to the concern of nuclear energy safety and the development of new nuclear power system, the urgency of the demand of high-fidelity numerical simulation is increasingly
It is prominent.
For the high fidelity simulation of core system, compared to determination method is discussed, DSMC have process challenge,
The significant advantages such as computational accuracy height.But device as general nuclear power system, particularly thermonuclear fusion reactor, its part tool
There are a large amount of spline surfaces, it is difficult to be converted directly into the Monte Carlo geometry of conventional construction geometric description, and with dough sheet geometry as generation
The geometry of table can easily represent these surface geometries.But dough sheet geometrical calculation efficiency 1～2 amount slow compared with constructive geometry speed
Level, be difficult to it is practical.
In existing Monte Carlo geometric manipulations method, the space cut tree of generation is applied to single dough sheet geometric model
Or in constructive geometry model, it is impossible to make full use of the advantage of constructive geometry model and dough sheet geometric model, it is difficult to further carry
Rise Monte Carlo Geometric Modeling, the efficiency for calculating.
The content of the invention
To solve the problems, such as that any geometry based on dough sheet covers the computational efficiency of card description method, the present invention provides one kind and is based on
The Monte Carlo dough sheet geometric manipulations method of the multistage space cut tree of dereferenced, on the one hand chases after there is provided double-deck fast particles ray
Track and stationkeeping ability, on the one hand can be such that efficient constructive solid geometry coexists with dough sheet geometry, energy in a geometric model
Card geometry is arbitrarily covered in enough expression, and is obviously improved the computational efficiency based on the Monte Carlo geometry of dough sheet, makes up to traditional structure
The similar computational efficiency of geometry is made, realizes that the calculating of arbitrary shape Monte Carlo geometry is practical.
The technology of the present invention solution：
The present invention is a kind of Monte Carlo dough sheet geometric manipulations method based on the multistage space cut tree of dereferenced；Wherein make
The multistage space cut tree of dereferenced is preserved with a kind of multistage space segmentation tree format of dereferenced；Lead in the geometric manipulations method
The multistage space of illiteracy card particle fast track method application dereferenced crossed under a kind of many sheaf space cut trees for patch model
Cut tree carries out Monte Carlo Calculation acceleration.
Step (1), to cover calorimeter calculate geometric model, by it is therein cannot with constructive solid geometry body description solid turn
It is changed to dough sheet solid；
Step (2), to it is whole cover calorimeter and calculate space and be iterated segmentation generate solid level space cut tree, until all
The solid quantity included in leaf node is less than predetermined value；
Step (3), to each dough sheet solid in model, the subspace that solid bounding box is formed is iterated point
Generation patch-level space cut tree is cut, the dough sheet quantity included in all leaf nodes is less than predetermined value；
Step (4), solid level space cut tree and patch-level space cut tree are combined to form the multistage space of dereferenced
Cut tree, is stored in file, in Monte Carlo particle trajectory tracing computation with a kind of multistage space segmentation tree format of dereferenced
In, the multistage space cut tree of file acquisition dereferenced that tree format is split in the multistage space of dereferenced is read first, then using one
Planting the illiteracy card particles track method under multistage space cut tree for dough sheet solid carries out quick Monte Carlo particles track.
Geometric model level and patch-level space cut tree are described, if additionally, having nesting, such as reactor between solid
There is fuel rod in component, there is the situation of multiple structure in fuel rod, except the space cut tree of its dough sheet on solid, in addition it is also necessary to
The space cut tree of nested geometry is set up, many sheaf space cut trees more than two-layer will be so formed.
Tree format is split in the multistage space of dereferenced, and the geometry preserves form not only to be included saving as the form of file, is also wrapped
Include the form in calculator memory：
The multistage space segmentation tree format of the dereferenced includes three parts, geological information part, the segmentation of solid level space
Tree part and patch-level space cut tree part.
(1) geological information part：Whole geometry model is by n geometry entity set S={ s1,s2,K sn, if wherein
Solid siFor dough sheet solid, then solid is by niThe dough sheet set of individual tri patch compositionGroup
Into each tri patch is constituted by three summits and towards the normal information on the outside of solid；The geometry of wherein non-dough sheet
The form of body is the geometry form or other constructive solid geometry forms for covering card program itself, without particular/special requirement；
(2) solid level space cut tree：Cover card computation model and only include a solid level space cut tree, it is by one
M cuboid subspace set B={ b of group1,b2,K bmAnd subspace between filiation set R={ (bi,bj) group
Into each of which item (bi,bj) represent biFor bjChild node, the root node b of the space cut tree0Calculate empty for the whole calorimeter that covers
Between, i.e.,The child node of tree interior joint represents some subspaces that node is divided into.The leaf section in tree
Point records the subspace b of its representativeiMeetIts solid set for including is recorded in leaf node
(3) patch-level space cut tree：Each dough sheet solid siContain a patch-level space cut tree, be similar to several
What body level space cut tree, is also made up of subspace set with subspace filiation set, and difference is its leaf section
Point records the set that the tri patch included in its subspace is constituted
Specially：In the cut tree part of patch-level space, each dough sheet solid siContaining a patch-level space point
Tree is cut, it is by one group of niIndividual cuboid subspace geometryWith the filiation set R of these subspacesi=
{(bij,bik) composition, each of which item (bij,bik) represent bijIt is bikChild node, the root node b of the space cut treei0Table
Show the bounding box space of whole dough sheet solid, i.e.,Its leaf node is recorded included in its subspace
Tri patch constitute set
In (2) and (3), space cut tree is the type of organization of subspace, in tree after a kind of iterative segmentation in space
Node can contain any number of child nodes, and primary cut tree can have iterative relation, such as solid has nest relation
In the case of, the solid level space cut tree that wherein nested solid is formed can be included in geometry body；Solid level space point
The nesting and patch-level space cut tree in the present invention and the hierarchical relationship of solid level space cut tree for cutting tree itself is two kinds
Concept, only for dough sheet solid, the dough sheet of itself carries out space segmentation to patch-level space cut tree, does not represent the embedding of solid
Set relation；If there is nesting between the cut tree of solid level space, overall cut tree is more than two-stage, is otherwise two-stage space point
Cut tree.
For the feature for covering card particles track method of dough sheet solid under multistage space cut tree：The multistage space segmentation
The lower illiteracy card particles track method for dough sheet solid of tree passes solid point calculating method, particle and flies into geometry including particle
Three parts of particles spatial localization method under body point calculating method and space cut tree：
(1) for particle passes the position calculation of dough sheet solid, particle trajectory is carried out empty with place solid patch-level
Between split the intersecting judgement of dough sheet in tree node, return joining if intersecting and pass solid point for particle, otherwise pass through
Particle passes present node position and obtains next space segmentation tree node, carries out same judgement and passes until finding particle
Point；
(2) for particle penetrates the position calculation of dough sheet solid, particle and place solid level space cut tree are carried out
In each solid intersecting judgement；For each solid, whether particle is judged through dough sheet solid bounding box, if if
Position particles carry out the phase of particle trajectory and solid dough sheet in leaf node to the leaf node of its patch-level space cut tree
Hand over and calculate, if intersecting dough sheet, then record intersection point flies into the point of the solid for particle；Choose particle fly into a little and particle
The point of the minimum solid flown into for the particle next one of current location distance；
(3) position for particles spatial under many sheaf space cut trees of dough sheet solid, first position particles place geometry
The leaf node of body level space cut tree, afterwards for each solid of the leaf node, by bounding box Primary Location grain
Sub- place solid, if dough sheet solid, then usage right requires that 3 method (1) is calculated along any directionCalculate particle
Pass the point of solid, if successfully obtain the point that particle passes solid, and the normal vector of the point place dough sheet withInner product
Less than zero, represent particle along directionGeometry is passed, then position particles are in the dough sheet solid；In three of the above method, such as
Fruit is not dough sheet solid, then calculated using existing constructive solid geometry computational methods.
Present invention advantage compared with prior art is：The present invention can be used in mixed way based on structure in Monte Carlo Calculation
Make entity geometry and dough sheet geometry；The model of pure constructive solid geometry is compared, can be reduced to constructive solid geometry cannot be converted to
Illiteracy card geometry pretreatment, lifted modeling efficiency；Pure dough sheet geometry is compared, the calculating of constructive solid geometry can be made full use of high
Effect property, lifts computational efficiency.
Description of the drawings
Fig. 1 is the flow chart that multistage space cut tree is generated in the present invention；
Fig. 2 is solid level space cut tree and patch-level space cut tree schematic diagram；
Fig. 3 is block mold and solid level space cut tree；
Fig. 4 is the patch-level space cut tree of a dough sheet solid in Fig. 3 block molds.
Specific embodiment
Below in conjunction with the accompanying drawings, to generate the special case of two grades of binary trees of dereferenced, the invention will be further described, two grade two
Fork tree is solid level space cut tree non-nesting and solid level space cut tree and the n omicronn-leaf in the cut tree of patch-level space
Child node contains two child nodes：
1. as shown in figure 1, the present invention has developed a kind of Monte Carlo dough sheet geometry meter based on two grades of binary trees of dereferenced
Calculate the generation method of two grades of binary trees in accelerated method：
Whole CAD model is read first, after carrying out necessary calculating material, source, counting distribution, obtains block mold
Total bounding box, based on total bounding box primary binary tree is initialized, now comprising all of solid in model in primary binary tree,
And export the subdivision convergence principle of binary tree, including the solid upper limit that includes in binary tree leaf node and y-bend leaf
The lower size limit of node.Afterwards according to the subdivision of following algorithm performs binary tree.
A) initialize binary tree and initialize binary tree leaf node list to be segmented；
B) leaf node is taken out from leaf node list to be segmented, by one of most rational x, y, the vertical direction of z-axis
Divide the leaf node equally, obtain new two child node, for two child nodes, check wherein solid quantity and size, such as
Child node is then added leaf node list to be segmented by fruit less than limit value；
C) repeat step B until leaf node list to be segmented is sky, as shown in Fig. 2 left sides, correspondence will be generated whole several
The space cut tree of what model, Fig. 2 left sides show a schematic diagram, and representation space defines each leaf by successively two points
Node only has the space segmentation of a geometry entity.It is the space segmentation example in a Practical Calculation shown in Fig. 3, it can be seen that
Whole space comprising geometric model is divided into a large amount of cuboid subspaces.
Secondly, for each solid, trial is automatically converted to constructive solid geometry body, if it is real to be converted to construction
Body solid then TURNs TO PATCH solid；Dough sheet solid to being wherein converted into carries out y-bend division, to single solid
Generate secondary binary tree.The process is similar to the generation step of above-mentioned primary binary tree, and difference is for node subdivision
Index is tri patch quantity, and Fig. 2 right sides are the space segmentation corresponding to a dough sheet solid, wherein each rectangular parallelepiped grid
Only containing the tri patch less than desired quantity, Fig. 4 is the space point of a dough sheet solid in model shown in correspondence Fig. 3
Situation is cut, its space is divided for a large amount of cuboid subspaces, wherein the quantity per sub-spaces inner sheet is less than 10.
2. the Monte Carlo dough sheet geometry of two grades of binary trees of dereferenced preserves form and its storage in a computer：
A) in a computer the dough sheet geometric model of two grades of binary trees of storage tape when, the letter of primary binary tree is preserved first
Breath, secondly preserves the information of all solids.
B) in primary binary tree information, by depth-first traversal mode or the primary y-bend of random order preservation can be extended to
The node of tree, the numbered list for having the solid of its association in nodal information (only preserves numbering row in leaf node
Table), the father node of node and child node numbering.
C) solid message part includes the information of each solid that solid quantity and order are preserved.
D) in each solid, there are secondary binary tree and dough sheet information respectively.Secondary binary tree information presses depth-first
Traversal or other sequentially preserve all nodes of the binary tree, the numbered list of all dough sheets comprising its association in each node
(only leaf node preserves numbered list), the father node of node and child node are numbered.Dough sheet information is preserved in order
Each dough sheet information, including three summits of dough sheet and dough sheet point to the external normal vector of geometry.
3. under two grades of binary trees of dereferenced, card dough sheet geometrical calculation method is covered：
(1) calculate for particle passes solid point, in carrying out particle trajectory and place solid secondary y-bend tree node
The intersecting judgement of dough sheet, returns joining and passes solid point for particle if intersecting, is otherwise passed by particle and works as prosthomere
Point position obtains next y-bend tree node, carries out same judgement until finding particle exit points；Wherein particle is passed currently
Node obtains next node using tree backtracking and the method for extreme saturation, and the position p that particle passes present node is obtained first,
Binary tree is recalled upwards, until a border surrounds upper layer node A of p, then from the downward extreme saturation of the node, every time downwards
During search, to two child nodes A1 and A2, take child node Ai that p is besieged or point is entered from p, iteration until leaf node, i.e.,
Find the node that the particle is penetrated；Because particle is surrounded by A, thus its to penetrate node inevitable in the node of A lower floors；
(2) calculate for particle flies into solid point, carry out particle and intersect with each solid in the primary binary tree that is located
Judge；For each solid, whether particle is judged through solid bounding box, if the bounding box that its entrance is positioned if
The leaf node of the solid secondary binary tree that position is located, by secondary binary tree, carries out the phase of particle and solid dough sheet
The calculating of intersection point, if intersecting dough sheet, then records the point that the point flies into the solid for particle；Choose particle fly into a little with
The point of the minimum solid flown into for the particle next one of particle current location distance；
The method of the wherein leaf node that position particles are entered is the intersection point p for trying to achieve particle and solid bounding box first,
Start search downwards from the root node of the solid secondary binary tree, during node A downwards search, two sons to A
Node A1 and A2, choose Ais of the p on border, and iteration finds particle into the leaf node of solid until leaf node.Its
Middle particle and solid intersection location search for when judging to be passed with particle in method (1) intersect dough sheet method it is similar, simply need
Judge whether particle direction is opposite with dough sheet normal vector direction.
(3) for particles spatial positioning under binary tree, the leaf node of primary binary tree that position particles are located first, afterwards
For each solid of the leaf node, particle is judged whether in solid bounding box, if particle is in bounding box,
Using method (1) is along any directionCalculate particle and pass the point of solid, if successfully obtaining the point that particle passes solid,
And the normal vector of the point place dough sheet withInner product be less than zero, represent particle along directionGeometry is passed, then position particles are at this
In solid.For the robustness of ensuring method, multiple directions can be simultaneously selectedIf the intersecting dough sheet of multiple directions particle is
Pass the situation of solid, then it represents that particle represents solid existing defects in geometry body, otherwise, needs to carry out at watertightness
Reason.
In a word, the present invention can improve the grain for covering card patch model when illiteracy calorimeter is calculated by introducing multistage space cut tree
Sub-trajectory penetrates the efficiency of exit points calculating and particle position location Calculation；It is several with construction entity that patch model is capable of achieving simultaneously
What model coexists, it is to avoid is fully incorporated computational efficiency caused by patch model and declines to a great extent.The present invention can be obviously improved dough sheet
Model computational efficiency, makes it to reach the level suitable with conventional geometric, realizes that any geometry based on dough sheet covers what calorimeter was calculated
It is practical.
There is provided embodiment of above the purpose of the present invention for illustration only, and be not intended to limit the scope of the present invention.This
The scope of invention is defined by the following claims.The various equivalents made without departing from spirit and principles of the present invention and repair
Change, all should cover within the scope of the present invention.
Claims (3)
1. a kind of Monte Carlo dough sheet geometric manipulations method based on the multistage space cut tree of dereferenced, it is characterised in that include with
Lower step：
Step one, by each in the geometric model of Monte Carlo cannot with constructive geometry describe method description solid be converted to
Dough sheet solid, forms the Monte Carlo geometric model containing dough sheet solid；
Step 2, after the Monte Carlo geometric model containing dough sheet solid is obtained, generate the body for covering the geometric model
Bounding box, segmentation is iterated to the bounding box and generates solid level space cut tree, all leaves in the cut tree
The solid quantity included in child node is less than predetermined value；
Step 3, based on solid level space cut tree is generated, in the Monte Carlo geometric model containing dough sheet solid
The bounding box of each dough sheet solid is iterated segmentation and generates patch-level space cut tree, wraps in all leaf nodes
The dough sheet quantity for containing is less than predetermined value；
Step 4, the solid level space cut tree for generating and patch-level space cut tree are combined, generate the multistage sky of dereferenced
Between cut tree, and the multistage space cut tree of dereferenced is stored hereof；In the particle trajectory tracing computation of Monte Carlo, deposit
The file for splitting tree format for the multistage space of dereferenced is stored up, using the illiteracy card grain under multistage space cut tree for dough sheet solid
Sub- method for tracing, the node of position particles place cut tree step by step, only with node in solid, dough sheet carry out geometric operation,
To reduce amount of calculation.
2. a kind of Monte Carlo dough sheet geometric manipulations side based on the multistage space cut tree of dereferenced according to claim 1
Method, it is characterised in that：In the step 4, the file of the multistage space cut tree of dereferenced includes geological information part, solid
Level space cut tree part and patch-level space cut tree part, wherein：Geological information part is whole geometry model, overall several
What model is by n geometry entity set S={ s1,s2,K sn, if wherein solid siFor dough sheet solid, then solid by
niThe dough sheet set of individual tri patch compositionComposition, each tri patch is by three summits and court
Constitute to the normal information on the outside of solid；Solid level space cut tree part covers calorimeter and calculates mould to cover card computation model
Type only includes a solid level space cut tree, and it is by one group of m cuboid subspace set B={ b0,b1,K bmAnd
Filiation set R={ (b between subspacei,bj) composition, each of which item (bi,bj) represent biFor bjChild node, should
The root node b of space cut tree0Space is calculated for the whole calorimeter that covers, i.e.,The child node of tree interior joint represents section
Some subspaces that point is divided into；Leaf node records the subspace b of its representative in treeiMeetLeaf
Its solid set for including is recorded in child node
In the cut tree part of patch-level space, each dough sheet solid siContain a patch-level space cut tree, it is by one group
niIndividual cuboid subspace geometry Bi={ bi0,bi1,K bniAnd these subspaces filiation set Ri={ (bij,bik)}
Composition, each of which item (bij,bik) represent bijIt is bikChild node, the root node b of the space cut treei0Represent whole dough sheet
The bounding box space of solid, i.e.,Its leaf node records the tri patch included in its subspace
The set of composition
3. a kind of Monte Carlo dough sheet geometric manipulations side based on the multistage space cut tree of dereferenced according to claim 1
Method, it is characterised in that：The step 4, for the illiteracy card particles track method of dough sheet solid under multistage space cut tree, bag
Include particle and pass solid position calculation, particle and fly into solid and particle under solid position calculation and space cut tree and include
Relation is calculated：
(1) for particle passes dough sheet solid position calculation, carry out particle trajectory and split with place solid patch-level space
The intersecting judgement of dough sheet in tree node, returns joining and passes solid point for particle if intersecting, is otherwise worn by particle
Go out present node position and obtain next space segmentation tree node, carry out same judgement until finding particle exit points；
(2) for particle penetrates the position calculation of dough sheet solid, particle is carried out each with the cut tree of place solid level space
The intersecting judgement of solid；For each solid, particle is judged whether through dough sheet solid bounding box, if positioning if
Particle carries out particle trajectory and intersects meter with solid dough sheet in leaf node to the leaf node of its patch-level space cut tree
Calculate, if intersecting dough sheet, then record intersection point flies into the point of the solid for particle；That chooses that particle flies into a little is current with particle
The point of the minimum solid flown into for the particle next one of positional distance；
(3) position for particles spatial under many sheaf space cut trees of dough sheet solid, first position particles place solid level
The leaf node of space cut tree, afterwards for each solid of the leaf node, by bounding box Primary Location particle institute
In solid, if dough sheet solid, then calculated along any direction using step (1)The point that particle passes solid is calculated,
If successfully obtain the point that particle passes solid, and the normal vector of the point place dough sheet withInner product be less than zero, represent particle
Along directionGeometry is passed, then position particles are in the dough sheet solid；If not dough sheet solid, then using existing structure
Make entity geometry determination methods to be judged.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611246440.0A CN106599514B (en) | 2016-12-29 | 2016-12-29 | A kind of Monte Carlo dough sheet geometric manipulations method based on dereferenced multistage space cut tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611246440.0A CN106599514B (en) | 2016-12-29 | 2016-12-29 | A kind of Monte Carlo dough sheet geometric manipulations method based on dereferenced multistage space cut tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106599514A true CN106599514A (en) | 2017-04-26 |
| CN106599514B CN106599514B (en) | 2018-04-20 |
Family
ID=58605099
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611246440.0A Active CN106599514B (en) | 2016-12-29 | 2016-12-29 | A kind of Monte Carlo dough sheet geometric manipulations method based on dereferenced multistage space cut tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106599514B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107437270A (en) * | 2017-08-09 | 2017-12-05 | 安徽中科超安科技有限公司 | A kind of three-dimensional geometry cross-sectional image generation method based on bounding box cross-sectional image |
| CN108197355A (en) * | 2017-12-20 | 2018-06-22 | 中国原子能科学研究院 | A kind of virtual hierarchy modeling method for Monte Carlo simulation calculation procedure |
| CN108805886A (en) * | 2018-05-30 | 2018-11-13 | 中北大学 | A kind of persistence cluster segmentation method of more fusion physical signatures |
| CN111932597A (en) * | 2020-10-09 | 2020-11-13 | 江苏原力数字科技股份有限公司 | Interactive self-penetrating grid deformation method based on proxy geometry |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101145245A (en) * | 2007-10-17 | 2008-03-19 | 北京航空航天大学 | Non-homogeneous space partition based scene visibility cutting method |
| US20110310101A1 (en) * | 2010-06-22 | 2011-12-22 | Schlumberger Technology Corporation | Pillar grid conversion |
| CN103065358A (en) * | 2013-01-14 | 2013-04-24 | 中国科学院合肥物质科学研究院 | Organ geometry reconstruction method based on image volume element operation |
| CN104867177A (en) * | 2014-12-23 | 2015-08-26 | 上海电机学院 | Parallel collision detection method based on bounding box tree method |
-
2016
- 2016-12-29 CN CN201611246440.0A patent/CN106599514B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101145245A (en) * | 2007-10-17 | 2008-03-19 | 北京航空航天大学 | Non-homogeneous space partition based scene visibility cutting method |
| US20110310101A1 (en) * | 2010-06-22 | 2011-12-22 | Schlumberger Technology Corporation | Pillar grid conversion |
| CN103065358A (en) * | 2013-01-14 | 2013-04-24 | 中国科学院合肥物质科学研究院 | Organ geometry reconstruction method based on image volume element operation |
| CN104867177A (en) * | 2014-12-23 | 2015-08-26 | 上海电机学院 | Parallel collision detection method based on bounding box tree method |
Non-Patent Citations (2)
| Title |
|---|
| 甘佺: ""基于参数可视化的裂变堆中子学精细建模方法研究"", 《中国博士学位论文全文数据库》 * |
| 甘佺等: ""基于参数的可视化裂变堆芯蒙特卡罗自动建模方法"", 《核技术》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107437270A (en) * | 2017-08-09 | 2017-12-05 | 安徽中科超安科技有限公司 | A kind of three-dimensional geometry cross-sectional image generation method based on bounding box cross-sectional image |
| CN107437270B (en) * | 2017-08-09 | 2018-09-25 | 安徽中科超安科技有限公司 | A kind of three-dimensional geometry cross-sectional image generation method based on bounding box cross-sectional image |
| CN108197355A (en) * | 2017-12-20 | 2018-06-22 | 中国原子能科学研究院 | A kind of virtual hierarchy modeling method for Monte Carlo simulation calculation procedure |
| CN108805886A (en) * | 2018-05-30 | 2018-11-13 | 中北大学 | A kind of persistence cluster segmentation method of more fusion physical signatures |
| CN108805886B (en) * | 2018-05-30 | 2021-09-03 | 中北大学 | Persistent clustering segmentation method for multi-fusion physical signatures |
| CN111932597A (en) * | 2020-10-09 | 2020-11-13 | 江苏原力数字科技股份有限公司 | Interactive self-penetrating grid deformation method based on proxy geometry |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106599514B (en) | 2018-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106599514B (en) | A kind of Monte Carlo dough sheet geometric manipulations method based on dereferenced multistage space cut tree | |
| CN102508973B (en) | Rapid intersection method for STL (stereo lithography) models of products | |
| CN104794221B (en) | A kind of multi-Dimensional Data Analytical System based on business object | |
| CN104794133B (en) | Based on STEP files from CAD model to the transfer algorithm of MCNP geometrical models | |
| CN110084817A (en) | Digital elevation model production method based on deep learning | |
| CN110533389A (en) | The determination method and device of Project Cost | |
| CN106844610A (en) | A kind of distributed structured three-dimensional point cloud image processing method and system | |
| CN104867177A (en) | Parallel collision detection method based on bounding box tree method | |
| CN106981097A (en) | A kind of T spline surface approximating methods based on subregion Local Fairing weight factor | |
| CN107391745A (en) | Extensive spatial data classification fast indexing method and device | |
| CN109670037A (en) | K-means Text Clustering Method based on topic model and rough set | |
| WO2024108580A1 (en) | Multi-dimensional parameterized city information model construction method and system, and computer device | |
| CN108875936B (en) | Method for solving nearest distance between any two polyhedrons in three-dimensional space | |
| Pardalos | Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems | |
| CN102508971A (en) | Method for establishing product function model in concept design stage | |
| CN106528916B (en) | A kind of adaptive subspace segmentation cooperative system for fusion reactor kernel analysis | |
| CN117236821B (en) | Online three-dimensional boxing method based on hierarchical reinforcement learning | |
| CN102622467A (en) | Method for automatic division of three-dimensional finite element mesh comprising multiple components | |
| CN101430693A (en) | Spacing query method for triangular gridding curve model | |
| Zhao et al. | Co-optimization of design and fabrication plans for carpentry | |
| CN107330209B (en) | Modeling wall intelligent template implementation method based on parametric design | |
| CN102831241A (en) | Dynamic index multi-target self-adaptive construction method for product reverse engineering data | |
| Guérin et al. | Efficient modeling of entangled details for natural scenes | |
| CN101256600A (en) | Structure reimplantation method in complex product dissociation design | |
| CN104346393B (en) | The modeling method of atomic scale data element model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 230031 room 422, 4th floor, entrepreneurship center, No. 9 Daoxiang Road, new industrial park, Shushan District, Hefei City, Anhui Province Patentee after: Zhongke Chao'an Technology Co.,Ltd. Address before: Room 516, Building 7, Independent Innovation Industrial Base, Zhenxing Road, New Industrial Park, Shushan District, Hefei City, Anhui Province, 230600 Patentee before: ANHUI ZHONGKE CHAOAN TECHNOLOGY CO.,LTD. |
|
| CP03 | Change of name, title or address |