CN103914879A - Method for generating cubic grid data through triangle surface metadata in parabolic equation - Google Patents
Method for generating cubic grid data through triangle surface metadata in parabolic equation Download PDFInfo
- Publication number
- CN103914879A CN103914879A CN201310006196.0A CN201310006196A CN103914879A CN 103914879 A CN103914879 A CN 103914879A CN 201310006196 A CN201310006196 A CN 201310006196A CN 103914879 A CN103914879 A CN 103914879A
- Authority
- CN
- China
- Prior art keywords
- grid
- model
- subdivision
- ray
- coordinate
- 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.)
- Pending
Links
Landscapes
- Image Generation (AREA)
Abstract
The invention discloses a method for generating cubic grid data through triangle surface metadata in a parabolic equation. The method comprises the steps of in a rectangular coordinate system, obtaining a circumscribed cuboid of an object through a triangle surface metadata file, projecting the hexahedron in any coordinate plane, and performing projection intersection on the triangle surface metadata of surfaces of the object in the projection region to obtain a cubic grid model of the object. Cubic grid modeling suitable for the parabolic equation can be performed for one time according to the triangle surface metadata file of the object, less manual work is involved, and modeling efficiency is increased. In addition, by means of the method, FDTD modeling applied to complex objects can be promoted further.
Description
Technical field
The present invention relates to calculate electromagnetics field, especially in the time calculating the Radar RCS (Chinese: RCS) of body surface, object model is carried out to subdivision modeling method, specifically a kind of method that is generated cube grid data in parabolic equation by triangular facet metadata.
Background technology
At present, in the time calculating the RCS (being Radar RCS) of body surface, object model is carried out to subdivision modeling.In Numerical Calculation of Electromagnetic Fields and emulation, there is multi-modeling method, as method of moment (MOM), Finite Difference-Time Domain separating method (FDTD), Finite Element Method (FEM), parabolic equation method (PE) etc., diverse ways needs different subdivision unit conventionally, make subdivision unit as method of moment and Finite Element Method adopt triangle bin, Finite Difference-Time Domain separating method and parabolic equation method need with hexahedron (cube) as basic calculating unit.The data model of triangle bin can be from number of ways, comprises that some business softwares are as obtained in ANSYS, Supermesh, 3DMAX, ANSOFT, and cube grid is than being more difficult to get, and general full-automatic modeling software yet there are no reports for work.
Summary of the invention
The object of the invention is, for the problem that needs object model to carry out subdivision in electromagnetism calculates, to propose a kind of solution that is generated cube grid data by triangular facet metadata.
Technical scheme of the present invention is:
A method that is generated cube grid data in parabolic equation by triangular facet metadata, it comprises the following steps:
(a). the step of reading data and establishment subdivision scope:
Obtain the triangle bin subdivision model data of object model, comprise the numbering on three summits and the coordinate information on each summit that dough sheet number, dough sheet numbering, each dough sheet comprise, the external rectangular parallelepiped that obtains this object model according to aforementioned information is as subdivision scope, described subdivision scope be the external rectangular parallelepiped of object model by object model at X, Y, the bound coordinate x in Z coordinate axis
l, x
h, y
l, y
h, z
l, z
hform;
Does is (precision that refers to subdivision grid the length of side according to the calculation requirement of parabolic equation method or Finite Difference-Time Domain separating method?), determine the length of side size δ (getting 0.1 wavelength in literary composition) of subdivision grid, calculate the quantity of wanting subdivision grid, it is determined by formula below again:
n
x=(x
h-x
l)/δ n
y=(y
h-y
l)/δ
n
z=(z
h-z
l)/δ N=n
x×n
y×n
z
N
x, n
y, n
zbe respectively X, Y, the quantity of subdivision grid in Z coordinate axis, if integer directly obtains, if not integer, makes to spend remaining transfer method and rounds;
At z
0=z
lin the plane of-δ/2, by x
l, x
h, y
l, y
hthe square forming carries out n
x× n
ydecile, obtains n
x× n
yindividual square, more each square is divided into M=m × m lattice; M=2 or m=3; Take the centre coordinate of each lattice as starting point, make the ray of M bar directive object model triangle bin subdivision model along positive z direction of principal axis, obtain the crossing situation on each ray and object model surface, and deposit intersecting point coordinate in array;
(b). ask each ray and whole object model triangle bin subdivision model intersection point and judge that this intersection point is whether in the step of bin inside:
While asking the intersection point of ray and triangle bin, first ask the intersection point of each ray and triangle bin place plane, and then judge that this intersection point is whether in triangle bin.The data file of the first triangle bin from target, read each triangle bin, be made as 3 apex coordinates of ABC, then try to achieve the geometric equation of this triangle bin place plane from 3 apex coordinates, last simultaneous is parallel to the mesh lines l equation of z axle, and coordinate that just can find intersection, is made as P point;
Judge whether intersection point P can utilize the projection in xoy face to analyze in triangle bin ABC, establish triangle bin ABC and the projection of intersection point P in xoy face is respectively A ' B ' C ' and P ';
3 vectors can be constructed in 3 summits of P' and projected triangle A ' B ' C '
and form successively vector multiplication cross,
with
if 3 each other jack per line represent that intersection point P is in triangle bin ABC; Otherwise intersection point P is not in triangle bin ABC.When P is just in time on triangle bin ABC sideline, there is one to be zero in 3.
(c). generate cube subdivision grid
Set out and set up cube grid model of target by triangular facet metadata schema data, whether judgement cube cellular is positioned at target, generates a M × n
zdimension group; Corresponding every the ray of row, is listed as the subdivision grid that corresponding each ray passes; Each that choose successively M bar ray judges, for closed body, the line segment that every antinode intercepts ray gained is exactly the interior zone of target; Take δ as step-length, from the minimum Z coordinate z of external rectangular parallelepiped
lstart, take grid element center as starting point, each row in the grid that is δ along the directions of rays placement length of side successively corresponding array, draw the coordinate of each grid element center, get its Z coordinate, each ray is judged to whether this grid element center is in line segment corresponding to ray, as corresponding element in array being set to 1, otherwise be set to 0; After completeer all rays, corresponding each grid array element is added, as its value is greater than M/2, shows that grid is in model inside, otherwise in model outside, record the centre coordinate of grid; All square n in traversal XY plane
x× n
yindividual, can obtain subdivision data, the model that each grid stacks up is the model after subdivision;
(d). finally obtain the outermost layer frontier point of this cube of grid model, travel through all points in model inner mesh, if 26 points of the length of side centered by it on the large cube face of 2 δ are not entirely in model inside, also not entirely in model outside, this point is exactly borderline point.
Step of the present invention (a) afterwards, is carried out triangle bin subdivision by ANSYS software to object model, the scope of finally establishing a subdivision, and take the centre coordinate of each lattice as starting point, make the ray of M bar directive model along positive z direction.
In step of the present invention (b), try to achieve the intersection point of ray and triangle bin and judge that whether this intersection point is in bin inside.
Each that choose successively M bar ray in step of the present invention (c) judges, for closed body, the line segment that every antinode intercepts ray gained is exactly the interior zone of target.After completeer all rays, corresponding each grid array element is added, as its value is greater than M/2, show that grid is in model inside, otherwise in model outside.
The all points in model inner mesh of traversal in step of the present invention (d), if 26 points of the length of side centered by it on the large cube face of 2 δ not entirely in model inside, also not entirely in model outside, this point is exactly borderline point.
Beneficial effect of the present invention:
The triangle bin that the present invention can be easily generates ANSYS be converted into a cube grid, need not by design drawing, shop drawings craft or semi-hand remove tectonic model, reduced workload; Modeling method and program all have versatility, and one-time programming can complete any modeling of corresponding situation.
Accompanying drawing explanation
Fig. 1 is process flow diagram of the present invention.
Fig. 2 is the intersection point of the trying to achieve schematic diagram in triangle bin inside.
Fig. 3 is the intersection point of the trying to achieve schematic diagram in triangle bin outside.
Fig. 4 is the model schematic diagram of metal cylinder.
Fig. 5 is the ball Based On The Conic Model schematic diagram in coordinate system.
Fig. 6 is by pad é-(1, the 0) triangle bin-cube two station of the ball that grid conversion PE algorithm is tried to achieve cone RCS value.
Embodiment
Below in conjunction with drawings and Examples, the present invention is further illustrated.
It is as shown in Figure 1, a kind of that below in conjunction with drawings and Examples, the present invention is further illustrated.
(a). reading data and establishment subdivision scope
First utilize ANSYS software to carry out triangle bin subdivision to object model, in the LIST file of output, can obtain dough sheet number, dough sheet numbering, some information such as the numbering on three summits that each dough sheet comprises and corresponding coordinate, utilize these information can obtain the external rectangular parallelepiped of this object, obtain the X of body, Y, the bound x of Z coordinate
l, x
h, y
l, y
h, z
l, z
h, the subdivision scope of indication in Here it is literary composition.Determine the big or small δ (getting 0.1 wavelength in literary composition) of subdivision grid according to parabolic equation calculation requirement, then calculate the quantity of wanting subdivision grid, it is determined by formula below:
n
x=(x
h-x
l)/δ n
y=(y
h-y
l)/δ
n
z=(z
h-z
l)/δ N=n
x×n
y×n
z
N
x, n
y, n
zmight not be integer, can make to spend remaining transfer method and round, make it become integer, n
x, n
y, n
zdetermine the size of calculated amount and memory space.At z
0=z
lin the plane of-δ/2, by x
l, x
h, y
l, y
hthe square determining carries out n
x× n
ydecile, obtains n
x× n
yindividual square.Again each square is further divided into M=m × m lattice (m=2 or m=3).Take the centre coordinate of each lattice as starting point, make the ray of M bar directive model along positive z direction, obtain the crossing situation of each ray and model surface, and deposit array in (if square is not divided into lattice, gained discriminative information is less, can not reflect the details of complex object, modeling degree of accuracy is poor).
(b). ask the intersection point of ray and triangle bin and judge that whether this intersection point is in bin inside
While asking the intersection point of ray and triangle bin, first ask the intersection point of ray and triangle bin place plane, and then judge that this intersection point is whether in triangle bin.The data file of the first triangle bin from target, read 3 apex coordinates of each triangle bin (being made as ABC), then try to achieve the geometric equation of this triangle bin place plane from 3 apex coordinates, last simultaneous is parallel to the mesh lines l equation of z axle, coordinate that just can find intersection (is made as P point, as shown in Figures 2 and 3).
Judge whether intersection point P can utilize the projection in xoy face to analyze in triangle bin ABC.If triangle bin ABC and the projection of intersection point P in xoy face are respectively A ' B ' C ' and P '.Fig. 2 represents the situation of intersection point in triangle bin, and Fig. 3 represents the not situation in triangle bin of intersection point.
3 vectors can be constructed in 3 summits of P' and projected triangle A'B'C'
and form successively vector multiplication cross,
with
if 3 each other jack per line represent that intersection point P is in triangle bin ABC; Otherwise intersection point P is not in triangle bin ABC.When P is just in time on triangle bin ABC sideline, there is one to be zero in 3.
(c). generate cube subdivision grid
Set out and set up cube grid model of target by triangular facet metadata schema data, key is whether judgement cube cellular is positioned at target.Generate a M × n
zdimension group (corresponding every the ray of row, is listed as the subdivision grid that corresponding each ray passes).Each that choose successively M bar ray judges, for closed body, the line segment that every antinode intercepts ray gained is exactly the interior zone of target.Take δ as step-length, from the minimum Z coordinate z of external rectangular parallelepiped
lstart, take grid element center as starting point, each row in the grid that is δ along the directions of rays placement length of side successively corresponding array, draw the coordinate of each grid element center, get its Z coordinate, each ray is judged to whether this grid element center is in line segment corresponding to ray, as corresponding element in array being set to 1, otherwise be set to 0.After completeer all rays, corresponding each grid array element is added, as its value is greater than M/2, show that grid is in model inside, otherwise in model outside.Record the centre coordinate of grid.All square (n in traversal XY plane
x× n
yindividual) can obtain subdivision data.The model that each grid stacks up is the model after subdivision.Fig. 4 is the triangle bin subdivision model of metal cylinder.
(d). finally obtain the outermost layer frontier point of this cube of grid model, we adopt such method at this: travel through all points in model inner mesh, if 26 points of the length of side centered by it on the large cube face of 2 δ are not entirely in model inside, also not entirely in model outside, this point is exactly borderline point.
Embodiment mono-:
1. analyze the electromagnetic scattering problems of ball cone
As shown in Figure 5, hemisphere and radius that ball cone is 5m by bottom surface radius are 5m, height is the circular cone composition of 8m, free space is 300MHz along x axle incident horizontal polarized wave frequency, applying three-dimensional pad é-(1,0) parabolic equation algorithm obtains 0 °～40 ° bistatic radar RCS, as shown in Figure 6.
The part that the present invention does not relate to all prior art that maybe can adopt same as the prior art is realized.
Claims (5)
1. a method that is generated cube grid data in parabolic equation by triangular facet metadata, is characterized in that it comprises the following steps:
(a). the step of reading data and establishment subdivision scope:
Obtain the triangle bin subdivision model data of object model, comprise the numbering on three summits and the coordinate information on each summit that dough sheet number, dough sheet numbering, each dough sheet comprise, the external rectangular parallelepiped that obtains this object model according to aforementioned information is as subdivision scope, described subdivision scope be the external rectangular parallelepiped of object model by object model at X, Y, the bound coordinate x in Z coordinate axis
l, x
h, y
l, y
h, z
l, z
hform;
Does is (precision that refers to subdivision grid the length of side according to the calculation requirement of parabolic equation method or Finite Difference-Time Domain separating method?), determine the length of side size δ (getting 0.1 wavelength in literary composition) of subdivision grid, calculate the quantity of wanting subdivision grid, it is determined by formula below again:
n
x=(x
h-x
l)/δ n
y=(y
h-y
l)/δ
n
z=(z
h-z
l)/δ N=n
x×n
y×n
z
N
x, n
y, n
zbe respectively X, Y, the quantity of subdivision grid in Z coordinate axis, if integer directly obtains, if not integer, makes to spend remaining transfer method and rounds;
At z
0=z
lin the plane of-δ/2, by x
l, x
h, y
l, y
hthe square forming carries out n
x× n
ydecile, obtains n
x× n
yindividual square, more each square is divided into M=m × m lattice; M=2 or m=3; Take the centre coordinate of each lattice as starting point, make the ray of M bar directive object model triangle bin subdivision model along positive z direction of principal axis, obtain the crossing situation on each ray and object model surface, and deposit intersecting point coordinate in array;
(b). ask each ray and whole object model triangle bin subdivision model intersection point and judge that this intersection point is whether in the step of bin inside:
While asking the intersection point of ray and triangle bin, first ask the intersection point of each ray and triangle bin place plane, and then judge that this intersection point is whether in triangle bin.The data file of the first triangle bin from target, read each triangle bin, be made as 3 apex coordinates of ABC, then try to achieve the geometric equation of this triangle bin place plane from 3 apex coordinates, last simultaneous is parallel to the mesh lines l equation of z axle, and coordinate that just can find intersection, is made as P point;
Judge whether intersection point P can utilize the projection in xoy face to analyze in triangle bin ABC, establish triangle bin ABC and the projection of intersection point P in xoy face is respectively A ' B ' C' and P ';
3 vectors can be constructed in 3 summits of P' and projected triangle A'B'C'
and form successively vector multiplication cross,
with
if 3 each other jack per line represent that intersection point P is in triangle bin ABC; Otherwise intersection point P is not in triangle bin ABC.When P is just in time on triangle bin ABC sideline, there is one to be zero in 3.
(c). generate cube subdivision grid
Set out and set up cube grid model of target by triangular facet metadata schema data, whether judgement cube cellular is positioned at target, generates a M × n
zdimension group; Corresponding every the ray of row, is listed as the subdivision grid that corresponding each ray passes; Each that choose successively M bar ray judges, for closed body, the line segment that every antinode intercepts ray gained is exactly the interior zone of target; Take δ as step-length, from the minimum Z coordinate z of external rectangular parallelepiped
lstart, take grid element center as starting point, each row in the grid that is δ along the directions of rays placement length of side successively corresponding array, draw the coordinate of each grid element center, get its Z coordinate, each ray is judged to whether this grid element center is in line segment corresponding to ray, as corresponding element in array being set to 1, otherwise be set to 0; After completeer all rays, corresponding each grid array element is added, as its value is greater than M/2, shows that grid is in model inside, otherwise in model outside, record the centre coordinate of grid; All square n in traversal XY plane
x× n
yindividual, can obtain subdivision data, the model that each grid stacks up is the model after subdivision;
(d). finally obtain the outermost layer frontier point of this cube of grid model, travel through all points in model inner mesh, if 26 points of the length of side centered by it on the large cube face of 2 δ are not entirely in model inside, also not entirely in model outside, this point is exactly borderline point.
2. the method that is generated cube grid data in parabolic equation by triangular facet metadata according to claim 1, it is characterized in that in step (a) afterwards, by ANSYS software, object model is carried out to triangle bin subdivision, final scope of establishing a subdivision, and take the centre coordinate of each lattice as starting point, make the ray of M bar directive model along positive z direction.
3. the method that is generated cube grid data in parabolic equation by triangular facet metadata according to claim 1, is characterized in that trying to achieve the intersection point of ray and triangle bin in step (b) and judges that whether this intersection point is in bin inside.
4. in parabolic equation, generated the method for cube grid data by triangular facet metadata, each that it is characterized in that choosing successively M bar ray in step (c) judges, for closed body, the line segment that every antinode intercepts ray gained is exactly the interior zone of target.After completeer all rays, corresponding each grid array element is added, as its value is greater than M/2, show that grid is in model inside, otherwise in model outside.
5. the method that is generated cube grid data in parabolic equation by triangular facet metadata according to claim 1, it is characterized in that all points in model inner mesh of traversal in step (d), if 26 points of the length of side centered by it on the large cube face of 2 δ are not entirely in model inside, also not entirely in model outside, this point is exactly borderline point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310006196.0A CN103914879A (en) | 2013-01-08 | 2013-01-08 | Method for generating cubic grid data through triangle surface metadata in parabolic equation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310006196.0A CN103914879A (en) | 2013-01-08 | 2013-01-08 | Method for generating cubic grid data through triangle surface metadata in parabolic equation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103914879A true CN103914879A (en) | 2014-07-09 |
Family
ID=51040532
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310006196.0A Pending CN103914879A (en) | 2013-01-08 | 2013-01-08 | Method for generating cubic grid data through triangle surface metadata in parabolic equation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103914879A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104573257A (en) * | 2015-01-22 | 2015-04-29 | 北京航空航天大学 | High-speed algorithm for judging electromagnetic shelter based on surface element space diversity |
| CN104573376A (en) * | 2015-01-22 | 2015-04-29 | 北京航空航天大学 | Method of calculating far extrapolation of transient field of electromagnetic scattering through finite difference time domain |
| CN105279320A (en) * | 2015-10-09 | 2016-01-27 | 江苏大学 | Method for generating FDTD (Finite Difference Time Domain) grids |
| CN105303611A (en) * | 2015-12-08 | 2016-02-03 | 新疆华德软件科技有限公司 | Virtual human limb modeling method based on revolution paraboloids |
| CN107871043A (en) * | 2017-11-08 | 2018-04-03 | 南方电网科学研究院有限责任公司 | The recognition methods of singular point and device |
| CN110717285A (en) * | 2019-09-11 | 2020-01-21 | 哈尔滨工程大学 | Fluid-solid coupling simulation method for large-amplitude six-degree-of-freedom motion |
| CN111008461A (en) * | 2019-11-20 | 2020-04-14 | 中国辐射防护研究院 | Human body digital model design method, system and model for radiation protection |
| CN111201448A (en) * | 2017-10-10 | 2020-05-26 | 罗伯特·博世有限公司 | Method and apparatus for generating an inverse sensor model and method for identifying obstacles |
| CN116740303A (en) * | 2023-06-07 | 2023-09-12 | 中国人民解放军91977部队 | Discrete grid generation method for underwater target |
-
2013
- 2013-01-08 CN CN201310006196.0A patent/CN103914879A/en active Pending
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104573376A (en) * | 2015-01-22 | 2015-04-29 | 北京航空航天大学 | Method of calculating far extrapolation of transient field of electromagnetic scattering through finite difference time domain |
| CN104573257A (en) * | 2015-01-22 | 2015-04-29 | 北京航空航天大学 | High-speed algorithm for judging electromagnetic shelter based on surface element space diversity |
| CN104573376B (en) * | 2015-01-22 | 2017-09-19 | 北京航空航天大学 | A kind of Finite-Difference Time-Domain Method calculates the transient field far field Extrapolation method of electromagnetic scattering |
| CN105279320B (en) * | 2015-10-09 | 2018-05-22 | 江苏大学 | A kind of method for generating FDTD grids |
| CN105279320A (en) * | 2015-10-09 | 2016-01-27 | 江苏大学 | Method for generating FDTD (Finite Difference Time Domain) grids |
| CN105303611A (en) * | 2015-12-08 | 2016-02-03 | 新疆华德软件科技有限公司 | Virtual human limb modeling method based on revolution paraboloids |
| CN111201448A (en) * | 2017-10-10 | 2020-05-26 | 罗伯特·博世有限公司 | Method and apparatus for generating an inverse sensor model and method for identifying obstacles |
| CN111201448B (en) * | 2017-10-10 | 2024-03-15 | 罗伯特·博世有限公司 | Method and device for generating an inverted sensor model and method for identifying obstacles |
| CN107871043A (en) * | 2017-11-08 | 2018-04-03 | 南方电网科学研究院有限责任公司 | The recognition methods of singular point and device |
| CN107871043B (en) * | 2017-11-08 | 2021-07-02 | 南方电网科学研究院有限责任公司 | Singular point identification method and device |
| CN110717285A (en) * | 2019-09-11 | 2020-01-21 | 哈尔滨工程大学 | Fluid-solid coupling simulation method for large-amplitude six-degree-of-freedom motion |
| CN111008461A (en) * | 2019-11-20 | 2020-04-14 | 中国辐射防护研究院 | Human body digital model design method, system and model for radiation protection |
| CN111008461B (en) * | 2019-11-20 | 2023-11-14 | 中国辐射防护研究院 | Human body digital model design method, system and model for radiation protection |
| CN116740303A (en) * | 2023-06-07 | 2023-09-12 | 中国人民解放军91977部队 | Discrete grid generation method for underwater target |
| CN116740303B (en) * | 2023-06-07 | 2023-11-07 | 中国人民解放军91977部队 | Discrete grid generation method for underwater target |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103914879A (en) | Method for generating cubic grid data through triangle surface metadata in parabolic equation | |
| CN102129523B (en) | Method for analyzing electromagnetic scattering of complex target through MDA and MLSSM | |
| CN105359163A (en) | Method for fitting primitive shapes to a set of 3D points | |
| CN107392875A (en) | A kind of cloud data denoising method based on the division of k neighbours domain | |
| CN104317772B (en) | A kind of Monte Carlo PARTICLE TRANSPORT FROM fast geometric disposal route based on space lattice segmentation | |
| CN106777822B (en) | Two-dimentional high-content particle enhancing composite material three-phase meso-mechanical model and method for building up | |
| CN102853763A (en) | Method for measuring volumes of historical relics with irregular surfaces | |
| CN106529082A (en) | Method for rapidly calculating electromagnetic scattering characteristics of electrically large targets | |
| CN105223480B (en) | The Positioning Error Simulation method of aerial array time difference method positioning transformer station Partial Discharge Sources | |
| CN104036095A (en) | Regional-decomposition based high-precision coupling fast-calculation method for complex-shape flow field | |
| CN103176179A (en) | Method of real-time simulation on SAR (synthetic aperture radar) echo | |
| CN104318622A (en) | Triangular mesh modeling method of indoor scene inhomogeneous three dimension point cloud data | |
| CN102708229A (en) | Matrix decomposition and novel singular value decomposition combined method for complex layered medium structures | |
| CN104050710A (en) | 3-d graphics rendering with implicit geometry | |
| CN101281552A (en) | Method for dividing electromechanical synthetic graticule of double-reflecting plane antenna system | |
| CN105404898A (en) | Loose-type point cloud data segmentation method and device | |
| CN110246205A (en) | A kind of flat work pieces automatic composing method | |
| CN114996658A (en) | Projection-based hypersonic aircraft aerodynamic heat prediction method | |
| CN105469415A (en) | Multi-view remote sensing image fusion method | |
| Cakir et al. | An FDTD-based parallel virtual tool for RCS calculations of complex targets | |
| CN109767492A (en) | A kind of distance computation method of substation's threedimensional model | |
| CN113850917A (en) | Three-dimensional model voxelization method and device, electronic equipment and storage medium | |
| CN104525668B (en) | Shape method adjusted by the drift of a kind of multi-point forming processing curve | |
| CN103914878A (en) | Method for calculating k-error linear complexity of periodic sequence | |
| CN115564820B (en) | Volume determination method, system, device and medium based on greedy projection triangularization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140709 |