CN112199804B - Calculation and drawing method of wireless network simulation area - Google Patents
Calculation and drawing method of wireless network simulation area Download PDFInfo
- Publication number
- CN112199804B CN112199804B CN202010920122.8A CN202010920122A CN112199804B CN 112199804 B CN112199804 B CN 112199804B CN 202010920122 A CN202010920122 A CN 202010920122A CN 112199804 B CN112199804 B CN 112199804B
- Authority
- CN
- China
- Prior art keywords
- point
- coordinates
- vertex
- area
- polygon
- 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.)
- Active
Links
- 238000004088 simulation Methods 0.000 title claims abstract description 70
- 238000004364 calculation method Methods 0.000 title claims abstract description 57
- 238000000034 method Methods 0.000 title claims abstract description 26
- 101150050759 outI gene Proteins 0.000 claims description 12
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- PCTMTFRHKVHKIS-BMFZQQSSSA-N (1s,3r,4e,6e,8e,10e,12e,14e,16e,18s,19r,20r,21s,25r,27r,30r,31r,33s,35r,37s,38r)-3-[(2r,3s,4s,5s,6r)-4-amino-3,5-dihydroxy-6-methyloxan-2-yl]oxy-19,25,27,30,31,33,35,37-octahydroxy-18,20,21-trimethyl-23-oxo-22,39-dioxabicyclo[33.3.1]nonatriaconta-4,6,8,10 Chemical compound C1C=C2C[C@@H](OS(O)(=O)=O)CC[C@]2(C)[C@@H]2[C@@H]1[C@@H]1CC[C@H]([C@H](C)CCCC(C)C)[C@@]1(C)CC2.O[C@H]1[C@@H](N)[C@H](O)[C@@H](C)O[C@H]1O[C@H]1/C=C/C=C/C=C/C=C/C=C/C=C/C=C/[C@H](C)[C@@H](O)[C@@H](C)[C@H](C)OC(=O)C[C@H](O)C[C@H](O)CC[C@@H](O)[C@H](O)C[C@H](O)C[C@](O)(C[C@H](O)[C@H]2C(O)=O)O[C@H]2C1 PCTMTFRHKVHKIS-BMFZQQSSSA-N 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007429 general method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/206—Drawing of charts or graphs
-
- G06T3/08—
Abstract
The invention provides a calculation and drawing method of a wireless network simulation area, which comprises the following steps: step 1, drawing polygons on a map; step 2, converting polygon vertexes from geographic coordinates to projection coordinates; step 3, judging the concave-convex performance of the polygon vertexes; step 4, setting a coverage radius and determining an expansion range; step 5, calculating the vertex coordinates of the simulation calculation area; and 6, converting the plane coordinates into geographic coordinates.
Description
Technical Field
The invention belongs to the technical field of mobile communication, and particularly relates to a method for calculating and drawing a wireless network simulation area.
Background
The simulation plays an important role in wireless network planning, is beneficial to the fine deployment of wireless networks and the optimization of networking cost, and can provide a high-quality solution for clients. The simulation computing efficiency is critically dependent on the quantity of the simulation computing resources, and the simulation computing resources are screened according to the simulation computing area.
The existing simulation calculation area mainly has two schemes, namely, manually drawing the simulation calculation area and not setting the simulation calculation area.
(1) Manually drawing simulated computing regions
The method is easily understood, i.e. the planner draws an outwardly extending and shaped region outside the simulation region.
(2) Setting simulation calculation area in general
As shown in fig. 1, the method is that a planner firstly draws a simulation area, then takes four vertex coordinates of a circumscribed rectangle of the simulation area, and then extends the rectangle outwards at equal intervals to form final four vertex coordinates. As shown in FIG. 1, A 1 A 2 A 3 A 4 A 5 For the drawn simulation area, ABCD is the circumscribed rectangle thereof, A 'B' C 'D' is the expanded simulation calculation area, and the simulation coverage radius is L.
The existing method needs to manually draw the simulation calculation area or set the simulation calculation area in a general way. The manual drawing calculation region has a certain human error, cannot be finely expanded according to the coverage radius, and the manual drawing also takes some time and cost. If the simulation calculation area is set in a general way, the cell project parameters which are not in the coverage area can be also incorporated into the simulation calculation during the simulation calculation, and the final simulation result is not affected, but the calculation operation efficiency is greatly reduced. Therefore, the conventional technical method has difficulty in solving the following problems:
1. how to expand the calculation region equidistantly based on the drawing region;
2. how the geometric relationship of the region under the geographic coordinate system is established;
3. how to improve the efficiency of simulation calculation.
Disclosure of Invention
The invention aims to: in order to solve the technical problems in the background technology, the invention provides a method for calculating and drawing a wireless network simulation area, which comprises the following steps:
step 1, drawing polygons on a map;
step 2, converting polygon vertexes from geographic coordinates to projection coordinates;
step 3, judging the concave-convex performance of the polygon vertexes;
step 4, setting a coverage radius and determining an expansion range;
step 5, calculating the vertex coordinates of the simulation calculation area;
and 6, converting the plane coordinates into geographic coordinates.
The step 1 comprises the following steps: n points which are not on the same straight line are continuously drawn on the map, wherein N is more than or equal to 3, namely, the points 1 are connected with 2,2 are connected with 3, … … and N are connected with 1, and the points form a polygonal closed area, namely, a drawing area. Because the map adopts a geographic coordinate system, polygon vertexes are geographic coordinates, namely common longitude and latitude coordinates, and the geographic coordinate of the ith vertex is recorded as (J) i ,W i )。
The step 2 comprises the following steps: converting the geographic coordinates of the polygon vertexes into geodetic coordinates, and converting the geographic coordinates of the ith polygon vertexes A i Is (x) i ,y i ) I is 1 to N.
The step 3 comprises the following steps: for the ith polygon vertex A i Setting (x) i+1 ,y i+1 ) Is A i Referring to adjacent vertex coordinates of the sequential direction, (x i-1 ,y i-1 ) Is A i Referring to adjacent vertex coordinates in the reverse direction of the order, then:
(1) When y is i ≠y i+1 And y is i ≠y i-1 In the time-course of which the first and second contact surfaces,
d is vector->Is->Slope difference of (2);
(2) When y is i ＝y i-1 In the time-course of which the first and second contact surfaces,
if x i >x i-1 Taking outI.e. d>0；
If x i <x i-1 Taking outI.e. d<0；
(3) When y is i ＝y i+1 In the time-course of which the first and second contact surfaces,
if x i+1 >x i Taking outI.e. d<0；
If x i+1 <x i Taking outI.e. d>0；
Thus, if vertex A is set i The reference order of (2) is counterclockwise, and when d is greater than 0, the point is a convex vertex; d is less than 0, the point is a concave top point;
if set the vertex A i The reference sequence of (2) is clockwise, when d is greater than 0, the point is a concave vertex; d is less than 0, the point is a convex vertex.
Step 4 comprises: and (3) setting the coverage radius of the cell as L, and respectively making parallel lines to the outer sides of each side of the polygon, wherein the vertical distance between the two lines is L, and the parallel lines intersect to form an expanded polygon area, which is called a simulation calculation area.
The step 5 comprises the following steps:
step 5-1, point A i Respectively drawing as starting pointsIs->Vector;
step 5-2, < beta > is vectorAnd->The angle formed is that there is a unique point A on the bisector of the angle beta i '(x i ',y i ') to->And->Is L, and +.theta.is +.>And->The included angle is->Is A i Point to A i The distance of the' point, derived from the geometric relationship:
angle gamma isAnd the included angle with the horizontal coordinate X is less than or equal to 90 degrees, and then:
if x i+1 ≠x i ，
If x i+1 ＝x i ，∠γ＝90°，
Angle delta isAnd->The angle formed is = < delta = < gamma +< theta >, point A i '(x i ',y i ') satisfies the following formula:
solving to obtain:
the four sets of coordinates are obtained according to the above formula, but the four sets of coordinates are also satisfiedAnd->Since the perpendicular distances of (2) are equal to each other and L, the target points satisfying the condition are defined on the bisector of the angle beta, and one is the point inside the angle beta, which is marked as A i '(x i ',y i ') the other is the point outside of +.beta.noted A i ″(x i ″,y i ″)；
Step 5-3, A is obtained according to the step 3 i Is obtained by the convexity and concavity ofTo the following results:
if A i Is concave, the point after the point is expanded outwards is A i '(x i ',y i ')；
If A i Is a convex point, and the point after the point is expanded outwards is A i ″(x i ″,y i ″)；
And 5-4, sequentially calculating the vertexes of the simulation calculation areas according to the steps 5-1 to 5-3.
The step 6 comprises the following steps: and 5, converting the plane coordinates into geographic coordinates according to the vertex coordinates of the simulation calculation areas calculated in the step 5 as the plane coordinates, so as to obtain the simulation calculation areas under a geographic coordinate system.
The invention has the following beneficial effects:
1. and automatically drawing a simulation calculation area.
One of the traditional methods for setting the wireless network simulation calculation area is that a user draws manually, and the method is not accurate enough and is not convenient to use. By extending the coverage radius of the simulation area and the like based on the simulation area and the coverage radius, the automatic drawing of the simulation calculation area can be realized.
2. The polygonal areas are expanded equidistantly and in parallel.
One of the conventional methods for setting the wireless network simulation calculation region is to make a certain distance offset based on the coordinates of the vertices of the circumscribed rectangle of the drawing region. This approach may add invalid simulated parametric calculations. The method can accurately screen effective industrial parameters according to the calculation area range, so that the calculation efficiency of simulation is improved.
Drawings
The foregoing and/or other advantages of the invention will become more apparent from the following detailed description of the invention when taken in conjunction with the accompanying drawings and detailed description.
Fig. 1 is a schematic diagram of a general set-up simulation calculation area.
FIG. 2 is a schematic diagram of a drawing area and a simulation calculation area.
Fig. 3 is a schematic diagram of the calculation of the vertex coordinates of the simulation calculation area.
Detailed Description
The invention provides a calculation and drawing method of a wireless network simulation area, which optimizes and improves the traditional method, automatically draws the simulation calculation area, reduces the simulation calculation range and improves the simulation calculation efficiency.
The method comprises the following specific steps:
step one, drawing polygons on a map.
A plurality of points are continuously drawn on the map, which forms a polygonal closed area, hereinafter referred to as a drawing area, which is essentially a simulation result area. As shown in FIG. 2, the drawing area is a polygon A 1 A 2 A 3 A 4 A 5 。
And step two, converting the polygon vertexes from geographic coordinates to projection coordinates.
The longitude and latitude coordinates used in daily life are geographic coordinates. Because the geographic coordinates are non-planar coordinates, the geographic coordinates are inconvenient to calculate and analyze and need to be converted into planar coordinates. In general, the longitude and latitude coordinates are converted into the geodetic coordinates, and the longitude and latitude coordinates of each platform are inconsistent due to certain confidentiality of the longitude and latitude conversion, so that the formula of converting the longitude and latitude into the geodetic coordinates is not described herein. As shown in FIG. 2, the coordinates of the transformed polygon vertices are A respectively 1 (x 1 ,y 1 )、A 2 (x 2 ,y 2 )、A 3 (x 3 ,y 3 )、A 4 (x 4 ,y 4 )、A 5 (x 5 ,y 5 )。
And thirdly, judging the convexity and convexity of the polygon vertexes of the drawing area.
Next, it is necessary to first determine the convexity of each vertex of the polygon. The simplest method for judging the concave-convex performance of the polygon vertex is to judge according to a ray method, the deduction process is not detailed, and the result is directly displayed below. As shown in fig. 3, a (x i ,y i ) For the vertex coordinates of the certain polygon, (x) i+1 ,y i+1 ) To refer to the coordinates of adjacent vertices in the sequential direction,(x i-1 ,y i-1 ) For reference to adjacent vertex coordinates in the reverse direction of the sequence.
(1) When y is i ≠y i+1 And y is i ≠y i-1 Time of day
d is vector->Is->Is a slope difference of (c).
(2) When y is i ＝y i-1 Time of day
If x i >x i-1 Taking outI.e. d>0；
If x i <x i-1 Taking outI.e. d<0。
(3) When y is i ＝y i+1 Time of day
If x i+1 >x i Taking outI.e. d<0；
If x i+1 <x i Taking outI.e. d>0。
(4) Conclusion(s)
1. If the reference sequence of the vertexes is assumed to be anticlockwise, when d is greater than 0, the point is a convex vertex; d is less than 0, which is a concave apex.
2. If the reference sequence of the vertexes is assumed to be clockwise, when d is greater than 0, the point is a concave vertex; d is less than 0, the point is a convex vertex.
And fourthly, setting a coverage radius and determining an expansion range.
Since the drawing area is a simulation result area, a part of cells at the periphery of the drawing area also has a certain influence on the simulation result area, and therefore the drawing area needs to be expanded equidistantly to form an expanded polygonal area, which is hereinafter referred to as a simulation calculation area. And (3) setting the coverage radius of the cell as L, and respectively making parallel lines to the outer sides of each side of the polygon, wherein the vertical distance between the two lines is L. As shown in FIG. 2, a region polygon A is drawn 1 A 2 A 3 A 4 A 5 After expansion, the simulation calculation area of the production is A 1 'A 2 'A 3 'A 4 'A 5 '. Furthermore, the distance L in the planar coordinate system, the distance in the geographic coordinate system is actually slightly greater than L. However, the slight expansion of the simulation calculation area does not affect the simulation result, but rather is beneficial to the authenticity of the result. In order to reduce the actual calculation, means are taken here which approximate the radius of coverage.
And fifthly, calculating vertex coordinates of the simulation calculation area.
In point A i Respectively drawing as starting pointsIs->Vector.
As shown in FIG. 3, since the distances L of the covering radii are equal, i.e. the straight line distances from the target vertexes to the two sides are equal, it is easy to prove that the geometric relationship is that the angle beta is a vectorAnd->The angle formed is that there is a unique point A on the bisector of the angle beta i '(x i ',y i ') to->And->Is L, and +.theta.is +.>And->The included angle is->Is A i Point to A i The distance of the' point, derived from the geometric relationship:
angle gamma isAnd the included angle with the horizontal coordinate X is less than or equal to 90 degrees, and then:
if x i+1 ≠x i ，
If x i+1 ＝x i ，∠γ＝90°，
And because = -delta = -gamma + -theta, the coordinates of point P (x p ,y p ) The following formula is satisfied
Solving to obtain:
the coordinates of four groups of points are obtained according to the above formula, and the points are required to be satisfiedAnd->Since the perpendicular distances of (2) are equal to each other and L, the target points satisfying the condition are defined on the bisector of the angle beta, and one is the point inside the angle beta, which is marked as A i '(x i ',y i ') the other is the point outside of +.beta.noted A i ″(x i ″,y i "is provided). The specific screening method is not described here.
Finally, according to the step A i The following conclusions can be easily drawn:
if the point is concave, the point after the point is expanded outwards is A i '(x i ',y i ')
If the point is a convex point, the point after the point is expanded outwards is A i ″(x i ″,y i ″)
And sequentially calculating the vertexes of the polygons of the simulation area according to the principle.
And step six, converting the plane coordinates into geographic coordinates.
The vertex coordinates of the simulation area calculated by the steps are plane coordinates, so that the vertex coordinates are also required to be turnedIs the geographic coordinates. Thus, a simulation calculation area under a geographic coordinate system can be drawn. Drawing area a of the same shape size 1 A 2 A 3 A 4 A 5 The polygon obtained by the general method is A 'B' C 'D', and as shown in FIG. 1, the simulation calculation area obtained by the method described herein is polygon A 1 'A 2 'A 3 'A 4 'A 5 ' as shown in fig. 2. By contrast calculation, we can easily find that the area of the polygon A 'B' C 'D' is significantly larger than A 1 'A 2 'A 3 'A 4 'A 5 ' area. Since the coverage radius of the base station is generally fixed, the simulation calculation area obtained by the method is more refined, and the number of the filtered calculation parameters is more accurate. Finally, the geographical coordinate set of the simulation calculation region is applied to the simulation calculation program, and the calculation program can screen the required industrial parameters according to the calculation region, so that the simulation calculation efficiency is improved under the condition of ensuring the calculation accuracy.
The invention provides a method for calculating and drawing a wireless network simulation area, and the method and the way for realizing the technical scheme are numerous, the above is only a preferred embodiment of the invention, and it should be pointed out that a plurality of improvements and modifications can be made to those skilled in the art without departing from the principle of the invention, and the improvements and modifications should be regarded as the protection scope of the invention. The components not explicitly described in this embodiment can be implemented by using the prior art.
Claims (3)
1. The method for calculating and drawing the wireless network simulation area is characterized by comprising the following steps:
step 1, drawing polygons on a map;
step 2, converting polygon vertexes from geographic coordinates to projection coordinates;
step 3, judging the concave-convex performance of the polygon vertexes;
step 4, setting a coverage radius and determining an expansion range;
step 5, calculating the vertex coordinates of the simulation calculation area;
step 6, converting the plane coordinates into geographic coordinates;
the step 1 comprises the following steps: continuously drawing N points which are not on the same straight line on the map, wherein N is more than or equal to 3, namely, the points 1 are connected with 2,2 are connected with 3, … … and N are connected with 1, and the points form a polygonal closed area, namely, a drawing area, and recording the geographic coordinate of the ith vertex as (J) i ,W i )；
The step 3 comprises the following steps: for the ith polygon vertex A i Setting (x) i+1 ,y i+1 ) Is A i Referring to adjacent vertex coordinates of the sequential direction, (x i-1 ,y i-1 ) Is A i Referring to adjacent vertex coordinates in the reverse direction of the order, then:
(1) When y is i ≠y i+1 And y is i ≠y i-1 In the time-course of which the first and second contact surfaces,
d is vector->Is->Slope difference of (2);
(2) When y is i ＝y i-1 In the time-course of which the first and second contact surfaces,
if x i >x i-1 Taking outI.e. d>0；
If x i <x i-1 Taking outI.e. d<0；
(3) When y is i ＝y i+1 In the time-course of which the first and second contact surfaces,
if x i+1 >x i Taking outI.e. d<0；
If x i+1 <x i Taking outI.e. d>0；
Thus, if vertex A is set i The reference order of (2) is counterclockwise, and when d is greater than 0, the point is a convex vertex; d is less than 0, the point is a concave top point;
if set the vertex A i The reference sequence of (2) is clockwise, when d is greater than 0, the point is a concave vertex; d is smaller than 0, the point is a convex point;
step 4 comprises: setting the coverage radius of a cell as L, and respectively making parallel lines to the outer sides of each side of the polygon, wherein the vertical distance between the two lines is L, and the parallel lines intersect to form an expanded polygon area, which is called a simulation calculation area;
the step 5 comprises the following steps:
step 5-1, point A i Respectively drawing as starting pointsIs->Vector;
step 5-2, < beta > is vectorAnd->The angle formed is that there is a unique point A on the bisector of the angle beta i '(x i ',y i ') to->And->Is L, and +.theta.is +.>And->The included angle is->Is A i Point to A i The distance of the' point, derived from the geometric relationship:
angle gamma isAnd the included angle with the horizontal coordinate X is less than or equal to 90 degrees, and then:
if x i+1 ≠x i ，
If x i+1 ＝x i ，∠γ＝90°，
Angle delta isAnd->The angle formed is = < delta = < gamma +< theta >, point A i '(x i ',y i ') satisfies the following formula:
solving to obtain:
the four sets of coordinates are obtained according to the above formula, but the four sets of coordinates are also satisfiedAnd->Since the perpendicular distances of (2) are equal to each other and L, the target points satisfying the condition are defined on the bisector of the angle beta, and one is the point inside the angle beta, which is marked as A i '(x i ',y i ') the other is the point outside of +.beta.noted A i ”(x i ”,y i ”)；
Step 5-3, A is obtained according to the step 3 i Is a concave-convex property of (c) to give the following result:
if A i Is concave, the point after the point is expanded outwards is A i '(x i ',y i ')；
If A i Is a convex point, and the point after the point is expanded outwards is A i ”(x i ”,y i ”)；
And 5-4, sequentially calculating the vertexes of the simulation calculation areas according to the steps 5-1 to 5-3.
2. The method of claim 1, wherein step 2 comprises: converting the geographic coordinates of the polygon vertexes into geodetic coordinates, and converting the geographic coordinates of the ith polygon vertexes A i Is (x) i ,y i )，i is 1 to N.
3. The method according to claim 2, wherein step 6 comprises: and (5) converting the plane coordinates into geographic coordinates according to the vertex coordinates of the simulation calculation region calculated in the step (5) as the plane coordinates, thereby obtaining the simulation calculation region under the geographic coordinate system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010920122.8A CN112199804B (en) | 2020-09-04 | 2020-09-04 | Calculation and drawing method of wireless network simulation area |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010920122.8A CN112199804B (en) | 2020-09-04 | 2020-09-04 | Calculation and drawing method of wireless network simulation area |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112199804A CN112199804A (en) | 2021-01-08 |
| CN112199804B true CN112199804B (en) | 2023-11-14 |
Family
ID=74006377
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010920122.8A Active CN112199804B (en) | 2020-09-04 | 2020-09-04 | Calculation and drawing method of wireless network simulation area |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112199804B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100916474B1 (en) * | 2009-04-28 | 2009-09-08 | 최준수 | Methods of partitioning a region represented by contours into smaller polygonal zones and calculating data for digital elevation model and data for constructing geographical surfaces of the region, and a recording medium in which programs for implementing the methods are recorded |
| CN107527831A (en) * | 2017-08-21 | 2017-12-29 | 武汉新芯集成电路制造有限公司 | A kind of characterizing method of wafer torsion resistance |
| WO2018182938A1 (en) * | 2017-03-07 | 2018-10-04 | Styku, LLC | Method and system for wireless ultra-low footprint body scanning |
| CN109522381A (en) * | 2018-11-02 | 2019-03-26 | 长江空间信息技术工程有限公司(武汉) | The hidden installation security detection method of building based on 3DGIS+BIM |
| CN109588059A (en) * | 2016-05-13 | 2019-04-05 | 瑞典爱立信有限公司 | The network architecture, method and apparatus for cordless communication network |
-
2020
- 2020-09-04 CN CN202010920122.8A patent/CN112199804B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100916474B1 (en) * | 2009-04-28 | 2009-09-08 | 최준수 | Methods of partitioning a region represented by contours into smaller polygonal zones and calculating data for digital elevation model and data for constructing geographical surfaces of the region, and a recording medium in which programs for implementing the methods are recorded |
| CN109588059A (en) * | 2016-05-13 | 2019-04-05 | 瑞典爱立信有限公司 | The network architecture, method and apparatus for cordless communication network |
| WO2018182938A1 (en) * | 2017-03-07 | 2018-10-04 | Styku, LLC | Method and system for wireless ultra-low footprint body scanning |
| CN107527831A (en) * | 2017-08-21 | 2017-12-29 | 武汉新芯集成电路制造有限公司 | A kind of characterizing method of wafer torsion resistance |
| CN109522381A (en) * | 2018-11-02 | 2019-03-26 | 长江空间信息技术工程有限公司(武汉) | The hidden installation security detection method of building based on 3DGIS+BIM |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112199804A (en) | 2021-01-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2021042829A1 (en) | Neighbor cell planning method and device based on thiessen polygon | |
| CN106447774B (en) | A kind of mapping method of GPS map to three-dimensional map | |
| CN106470427B (en) | A kind of partitioning method and device of cell scenario | |
| EP3213431A1 (en) | Method for predicting outdoor three-dimensional space signal field strength by extended cost-231-walfisch-ikegami propagation model | |
| CN108981734B (en) | Electronic map road expansion method and device, electronic equipment and storage medium | |
| WO2021175083A1 (en) | Three-dimensional model space coordinate correction method and three-dimensional model space coordinate encryption method | |
| WO2016095682A1 (en) | Method and device for processing joint of digital terrain model | |
| CN111935732B (en) | Method, device, computer system and server for identifying network coverage structure holes | |
| CN104463970A (en) | Method for determining three-dimensional gravity center of city based on remote-sensing image and application thereof | |
| CN108513305A (en) | A kind of the base station selection method, apparatus and equipment of target area | |
| CN107462220B (en) | Projection polar coordinates geometric expression method towards moon base earth observation image | |
| CN109827573B (en) | Method, system and application for judging coordinate system | |
| CN112199804B (en) | Calculation and drawing method of wireless network simulation area | |
| CN106875330B (en) | Method for rotating plane model into spherical model | |
| CN101609563A (en) | A kind of construction method of binary tree of 3 D model shape features | |
| CN110298778A (en) | One kind being based on raster data and the modified traffic zone demographics method of area ratio | |
| CN109710994B (en) | Airport obstacle limiting surface overrun analysis method based on digital earth | |
| CN105957005A (en) | Method for bridge image splicing based on feature points and structure lines | |
| CN106658538B (en) | Mobile phone base station signal coverage area simulation method based on Thiessen polygon | |
| WO2021129349A1 (en) | Laser point cloud map merging method, apparatus, and computer readable storage medium | |
| CN116878456A (en) | Method for refining ground-like level surface of plain strip-shaped water channel | |
| CN114387419B (en) | Three-dimensional geographic entity coding method and device based on multi-dimensional space subdivision | |
| CN105760451A (en) | Big data real-time display and output end based on coordinate transformation and used for urban planning | |
| CN102324096B (en) | Method and device for splicing characteristic point correction partitions | |
| CN108731648B (en) | 2000 independent coordinate system parameter obtaining method, device and computer readable storage medium |
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 |