CN109766398B - Method and device for dividing raster subareas based on GIS data - Google Patents
Method and device for dividing raster subareas based on GIS data Download PDFInfo
- Publication number
- CN109766398B CN109766398B CN201811625700.4A CN201811625700A CN109766398B CN 109766398 B CN109766398 B CN 109766398B CN 201811625700 A CN201811625700 A CN 201811625700A CN 109766398 B CN109766398 B CN 109766398B
- Authority
- CN
- China
- Prior art keywords
- data
- road
- grid
- closed
- sub
- 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
Images
Abstract
The invention discloses a method and a device for dividing raster subareas based on GIS data; setting the grid size of a map area to be divided; utilizing GIS road data expansion to connect the road data end to end and process the road data into closed space data; calculating the intersection point of the closed area of the road or the building and the grid, and inserting the intersection point into the original closed area data set to obtain new closed area boundary data; calculating a cross subregion; calculating the relation of GIS data point sets in other grids, outputting a subregion set, and if the whole grid is in a closed region, determining the grid as a subregion corresponding to the closed region; all the sub-areas of the indoor attributes and the sub-areas of the road attributes can be obtained in a gathering mode. The sub-regions with overlapped roads are marked as road attributes, the sub-regions with overlapped buildings are marked as indoor attributes, the regions with the rest grids are used as one sub-region, and then the library building process can extract characteristic values of each sub-region to build an MR fingerprint library.
Description
Technical Field
The invention relates to a technology for grid data division positioning, in particular to a method and a device for dividing grid sub-regions based on GIS data.
Background
With the gradual maturation and rapid development of telecommunication operator communication technology and the continuous progress of big data technology, data value is more and more important, data mining and using capacity is achieved, the data value is fully played, and the next key point of business expansion and service improvement of operators is achieved.
The latest mainstream technology of operators at present, which can provide more accurate position capability, is a fingerprint positioning technology based on MR; MR means that the mobile terminal periodically reports information such as downlink signal strength and quality of the cell to the base station in an MR manner at a certain time interval on a traffic channel through a control channel, and the base station uploads downlink information reported by the terminal and uplink physical information collected by the base station to the base station controller and collects and counts the information. Taking TD-SCDMA network as an example, each MR mainly includes uplink and downlink received signal code power, uplink and downlink signal-to-noise ratio, timing advance, uplink and downlink path loss, UE transmission power, NodeB transmission power, and the like. The reported MR can be used for triggering events such as switching and the like by a radio resource control sublayer in the system, and can also be used for maintaining the system and observing the running state of the system; location fingerprints refer to scene features of the location where the user is located.
The principle of MR-based fingerprinting techniques is: dividing an actual map into continuous square grids according to a certain distance, then dropping massive MR data points into the grids, extracting information characteristics in each grid, and constructing an MR fingerprint database; extracting the characteristics of the MR data, comparing the characteristics with the characteristics of each grid in the existing library, calculating the Euclidean distance, taking the grid with the minimum distance as the grid positioned by the MR data, and taking the central point of the grid as the positioning longitude and latitude; however, after the grid is positioned, only latitude and longitude information can be provided, so that the method has great limitation in the practical application process, and an undesirable place exists, and the positioned grid needs to be further improved and added with attribute information.
When a piece of MR data is located in a certain grid, the center point of the grid is approximately regarded as the position of the user, and the user may be actually located at any position in the grid, and the following defects exist in the actual application process: when practical application needs to know that the position of a user belongs to a road, a building or the like, one grid may include the road, the building, other areas and the like, the user may belong to any one of the areas representing the practical position of the user, and at present, the user can only use a returned central point as a judgment basis, so that errors obviously exist, and many applications cannot be developed.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: how to combine the grid and the GIS data to divide the sub-grid area of the building road on the map provides a method and a device for dividing the sub-grid area based on the GIS data.
The invention solves the technical problems through the following technical scheme, and the method for dividing the grid subareas based on the GIS data comprises the following steps:
(1) setting the grid size of a map area to be divided;
(2) the method comprises the following steps of utilizing GIS road data expansion to connect the road data end to end and process the road data into closed space data, so that the GIS road data and GIS building data are in the same form;
(3) calculating the intersection point of the closed area of the road or the building and the grid, and inserting the intersection point into the original closed area data set to obtain new closed area boundary data;
(4) calculating a crossed sub-area according to the new boundary data of the closed area;
(5) then calculating the relation of GIS data point sets in other grids, and outputting a subregion set, wherein the intersection subregion of the road data and the grid data is a road subregion, and the intersection subregion of the building data and the grid data is an indoor subregion;
(6) if the whole grid is in the closed area, the grid is a sub-area corresponding to the closed area;
(7) all the sub-areas of the indoor attributes and the sub-areas of the road attributes can be obtained in a gathering mode.
In the step (1), the size of each grid divided by default is equal, that is, the length and the width of each grid are the same.
The GIS data comprises GIS building data and GIS road data, the GIS building data comprises boundary point survey and drawing data of buildings, and the survey and drawing data of a single building is a series of closed data point sets which are arranged in sequence; the GIS data comprises mapping data of each road, and the single road drive test data is a series of non-closed data point sets which are arranged in sequence.
In the step (2), if the road data is only a connection line of road center points, the road data is a line formed by a plurality of points, the actual condition of the road is not the same, the road data needs to be expanded to two sides by N meters to approximately restore the actual condition of the road, and then a series of expanded points are sequentially connected to form a closed area.
In the step (4), the calculation of the cross sub-region specifically includes the following steps:
(41) starting from a point A serving as a starting point and connecting the point A with a cross point P1 on the grid edge according to a sequence relation, wherein the point A is a side of the closed sub-region AP 1;
(42) from point P1, connecting P1 with a grid vertex V1 in the region, if there are other cross points between P1V1, then connecting sequentially, and if there are no other cross points, then connecting P1V1, P1V1 is an edge of the closed sub-region;
(43) and sequentially traversing all the intersection points and the grid vertexes in sequence to form a closed sub-region.
In the step (6), the specific process is as follows:
(61) finding out grids in a certain range around the closed region;
(62) calculating whether four vertexes of a certain grid are all in the closed area, if so, the grid is a sub-area of the closed area;
(63) repeating the previous step to find all sub-areas of the closed area with the attribute.
An apparatus for raster sub-region partitioning based on GIS data, comprising:
the initial module is used for setting the grid size of a map area to be divided;
the expansion module is used for expanding the GIS road data, connecting the road data end to end and processing the road data into closed space data, so that the GIS road data and the GIS building data are in the same form;
the first calculation module is used for calculating the intersection point of the closed area of the road or the building and the grid, and inserting the intersection point into the original closed area data set to obtain new closed area boundary data;
the second calculation module is used for calculating the crossed sub-regions according to the new closed region boundary data;
the third calculation module is used for calculating the relation of GIS data point sets in other grids and outputting a sub-area set, wherein the intersection sub-area of the road data and the grid data is a road sub-area, and the intersection sub-area of the building data and the grid data is an indoor sub-area;
the judging module is used for judging whether the whole grid is in the closed area or not, if so, the grid is a sub-area corresponding to the closed area;
and the summarizing module is used for summarizing all the sub-areas of the indoor attributes and the sub-areas of the road attributes.
Compared with the prior art, the invention has the following advantages: when the grid is divided, the normal grid area is combined with actual geographic information, the normal grid area is crossed with the areas of actual roads and construction objects, an overlapped area is found out to be used as a sub-area, the sub-area overlapped by the roads is marked as road attribute, the sub-area overlapped by the construction objects is marked as indoor attribute, the remaining area of the grid is used as a sub-area (which can be marked as other sub-area), and then a library building process can extract a characteristic value of each sub-area to build an MR fingerprint library; at this time, when positioning is performed again, the user can be directly positioned in the sub-grids, the center point of the sub-grids is returned, the attribute of the position where the user is located can be determined, position data with the attribute is provided for subsequent position application analysis, and realization of application analysis based on the number of the positions of the attribute, such as road correlation analysis, indoor correlation analysis and the like, becomes possible.
Drawings
FIG. 1 is a schematic flow diagram of the present invention;
FIG. 2 is a schematic illustration of the region boundaries of the heart formed after intersection insertion;
fig. 3 is a schematic illustration of the determination of the closed sub-region.
Detailed Description
The following examples are given for the detailed implementation and specific operation of the present invention, but the scope of the present invention is not limited to the following examples.
As shown in fig. 1, the present embodiment includes the following steps:
the GIS data of this embodiment includes:
GIS building data: the method comprises the steps of containing boundary point survey and drawing data of the buildings, wherein the survey and drawing data of the single building is a series of closed data point sets which are arranged in sequence;
GIS road data: the mapping data of each road is contained, and the single road drive test data is a series of non-closed data point sets which are arranged in sequence.
(1) The user sets the length and width of the grid of the map area to be divided, and the length and width of the grid are equal by default.
(2) GIS road data expansion, connecting the end of the road data, processing the road data into closed space data, if the road data is only a road center point connecting line, the road data is a line formed by a plurality of points, but not the actual condition of the road, the road data needs to be expanded to the two sides by N meters, approximately restoring the actual condition of the road, and then sequentially connecting a series of expanded points to form a closed area; the processed road data is a closed area and has the same data form as the data form of the building, so that the road and the building are regarded as the same type of data to be subjected to the same method operation.
(3) To calculate the intersection area of the road or building and the grid, the intersection points of the closed area of the road or building and the grid are calculated first, and these intersection points are inserted into the original closed area data set, so as to obtain new area boundary data, as shown in fig. 2:
the original closed region Area1 has a point sequence of A-B-C-D-A, the intersection points of the line segments AB, BC, CD and DA with the grid can be respectively calculated, and the intersection points are sequentially inserted into the A-B-C-D-A, so that a new closed region A-P1-P2-P3-P4-P5-P6-B-P8-P9-P10-P11-C-P12-P13-P14-P15-D-P16-A can be obtained.
(4) Calculating a crossed sub-area according to the new boundary data of the closed area; taking the grid in fig. 2 as an example, taking point a as a starting point, determining the grid id to which point a belongs and the points P1 and P16 on the sides of the grid, as shown in fig. 3:
the steps of how to determine a closed sub-region are as follows:
(41) because A, P1 and P16 have a sequential relationship, starting from the point A, the next point of A is P1, and is connected with AP1, and the AP1 is one edge of the closed sub-region;
(42) starting from point P1, since the grid vertex V1 is in the closed region belonging to Area1 and V4 is not in the closed region belonging to Area1, P1- > V1 can be communicated, and P1- > V4 cannot be communicated, the connection P1V1, P1V1 is one side of the closed sub-region;
(43) from V1, V1P1 can be connected, but P1V1 has been added to the subregion, V1 can only connect points on the side of V1V2, since V1V2 has only V2 and V2 points in Area1, V1V2 is connected, P1V1 is one side of the closed subregion;
(44) starting from V2, since the path of V2V1 has already traversed, only the point of V2P16 can be connected;
(45) from point P16, V4 is not in the closed Area of Area1, and P16- > V4 cannot be communicated, so that P16A is connected;
(46) all points in the grid are traversed to the end, and A-P1-V1-V2-P16-A subregions are formed.
(5) According to the steps, the relation of GIS data point sets in other grids is calculated, a subregion set is output, wherein the intersection subregion of road data and grid data is a road subregion, and the intersection subregion of building data and grid data is a building subregion which is also called an indoor subregion;
(6) calculating the situation that the whole grid is in the closed region, wherein the grid is the sub-region corresponding to the closed region, and the calculation process is as follows:
(61) finding out the grids in a certain range around the closed area;
(62) calculating whether four vertexes of a certain grid all belong to the closed region, and if the condition is met, the grid is a sub-region of the closed region;
(63) repeating the previous step to find all the sub-regions of the closed region.
(7) Summarizing the results of the two steps to obtain all the subareas of the indoor attributes and the subareas of the road attributes.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (5)
1. A method for dividing raster subareas based on GIS data is characterized by comprising the following steps:
(1) setting the grid size of a map area to be divided;
(2) the method comprises the following steps of utilizing GIS road data expansion to connect the road data end to end and process the road data into closed space data, so that the GIS road data and GIS building data are in the same form;
(3) calculating the intersection point of the closed area of the road or the building and the grid, and inserting the intersection point into the original closed area data set to obtain new closed area boundary data;
the original closed region Area1 has the point sequence of A-B-C-D-A, the intersection points of the line segments AB, BC, CD and DA and the grid can be respectively calculated, and the intersection points are sequentially inserted into the A-B-C-D-A, so that a new closed region A-P1-P2-P3-P4-P5-P6-B-P8-P9-P10-P11-C-P12-P13-P14-P15-D-P16-A can be obtained;
(4) calculating a crossed sub-area according to the new boundary data of the closed area; taking the point A as a starting point, determining the grid id to which the point A belongs and the points P1 and P16 on the edge of the grid,
the steps of how to determine a closed sub-region are as follows:
(41) because A, P1 and P16 have a sequential relationship, starting from the point A, the next point of A is P1, and is connected with AP1, and the AP1 is one edge of the closed sub-region;
(42) starting from point P1, since the grid vertex V1 is in the closed region belonging to Area1 and V4 is not in the closed region belonging to Area1, P1- > V1 can be communicated, and P1- > V4 cannot be communicated, the connection P1V1, P1V1 is one side of the closed sub-region;
(43) from V1, V1P1 can be connected, but P1V1 has been added to the subregion, V1 can only connect points on the side of V1V2, since V1V2 has only V2 and V2 points in Area1, V1V2 is connected, P1V1 is one side of the closed subregion;
(44) starting from V2, since the path of V2V1 has already traversed, only the point of V2P16 can be connected;
(45) from point P16, V4 is not in the closed Area of Area1, and P16- > V4 cannot be communicated, so that P16A is connected;
(46) all points in the grid are traversed to end, and an A-P1-V1-V2-P16-A sub-region is formed;
(5) according to the steps, the relation of GIS data point sets in other grids is calculated, a subregion set is output, wherein the intersection subregion of road data and grid data is a road subregion, and the intersection subregion of building data and grid data is a building subregion which is also called an indoor subregion;
(6) calculating the situation that the whole grid is in the closed region, wherein the grid is the sub-region corresponding to the closed region, and the calculation process is as follows:
(61) finding out the grids in a certain range around the closed area;
(62) calculating whether four vertexes of a certain grid all belong to the closed region, and if the condition is met, the grid is a sub-region of the closed region;
(63) repeating the previous step to find out all the sub-regions of the closed region;
(7) summarizing the results of the two steps to obtain all the subareas of the indoor attributes and the subareas of the road attributes.
2. The method for partitioning sub-regions of a grid based on GIS data as claimed in claim 1, wherein in step (1), the size of each grid of the default partition is equal.
3. The method of claim 1, wherein the GIS data comprises GIS building data and GIS road data, the GIS building data comprises boundary point survey and drawing data of buildings, and the survey and drawing data of a single building is a series of closed data point sets arranged in sequence; the GIS data comprises mapping data of each road, and the single road drive test data is a series of non-closed data point sets which are arranged in sequence.
4. The method according to claim 1, wherein in the step (2), if the road data is only a road center point connection line, the road data is a line formed by a plurality of points, which is not an actual situation of a road, the road data needs to be expanded bilaterally by N meters to approximately restore the actual situation of the road, and then a series of expanded points are sequentially connected to form a closed area.
5. An apparatus for grid subregion partitioning using the method of claim 1, comprising:
the initial module is used for setting the grid size of a map area to be divided;
the expansion module is used for expanding the GIS road data, connecting the road data end to end and processing the road data into closed space data, so that the GIS road data and the GIS building data are in the same form;
the first calculation module is used for calculating the intersection point of the closed area of the road or the building and the grid, and inserting the intersection point into the original closed area data set to obtain new closed area boundary data;
the second calculation module is used for calculating the crossed sub-regions according to the new closed region boundary data;
the third calculation module is used for calculating the relation of GIS data point sets in other grids and outputting a sub-area set, wherein the intersection sub-area of the road data and the grid data is a road sub-area, and the intersection sub-area of the building data and the grid data is an indoor sub-area;
the judging module is used for judging whether the whole grid is in the closed area or not, if so, the grid is a sub-area corresponding to the closed area;
and the summarizing module is used for summarizing all the sub-areas of the indoor attributes and the sub-areas of the road attributes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811625700.4A CN109766398B (en) | 2018-12-28 | 2018-12-28 | Method and device for dividing raster subareas based on GIS data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811625700.4A CN109766398B (en) | 2018-12-28 | 2018-12-28 | Method and device for dividing raster subareas based on GIS data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109766398A CN109766398A (en) | 2019-05-17 |
| CN109766398B true CN109766398B (en) | 2020-10-30 |
Family
ID=66451749
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811625700.4A Active CN109766398B (en) | 2018-12-28 | 2018-12-28 | Method and device for dividing raster subareas based on GIS data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109766398B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110442659B (en) * | 2019-07-03 | 2022-06-07 | 武汉大学 | Region division method and device |
| CN113064413B (en) * | 2019-12-31 | 2023-04-07 | 速感科技（北京）有限公司 | Map processing method and device for closed space and movable equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102129715A (en) * | 2011-03-24 | 2011-07-20 | 山东大学 | Generation method of quadrilateral grid of geometric model with any internal feature constraints |
| CN105222793A (en) * | 2015-10-23 | 2016-01-06 | 华中科技大学 | A kind of city stratification region partitioning method based on map vector data model |
| CN107563803A (en) * | 2017-08-24 | 2018-01-09 | 北京工商大学 | A kind of market area partition method based on cost grid |
| CN108242203A (en) * | 2016-12-23 | 2018-07-03 | 中兴通讯股份有限公司 | A kind of region partitioning method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8144937B2 (en) * | 2008-10-15 | 2012-03-27 | The Boeing Company | System and method for airport mapping database automatic change detection |
-
2018
- 2018-12-28 CN CN201811625700.4A patent/CN109766398B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102129715A (en) * | 2011-03-24 | 2011-07-20 | 山东大学 | Generation method of quadrilateral grid of geometric model with any internal feature constraints |
| CN105222793A (en) * | 2015-10-23 | 2016-01-06 | 华中科技大学 | A kind of city stratification region partitioning method based on map vector data model |
| CN108242203A (en) * | 2016-12-23 | 2018-07-03 | 中兴通讯股份有限公司 | A kind of region partitioning method and device |
| CN107563803A (en) * | 2017-08-24 | 2018-01-09 | 北京工商大学 | A kind of market area partition method based on cost grid |
Non-Patent Citations (2)
| Title |
|---|
| "Formation of a near optimal solution for raster region having min/max cell value";Raja M W等;《International Conference on Frontiers of Information Technology》;20121217;第377-381页 * |
| "矢量与栅格结合的分块平面区域几何划分算法";陈国军等;《系统仿真学报》;20161031;第28卷(第10期);第2460-2466页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109766398A (en) | 2019-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109996186B (en) | Network coverage problem identification method and device and readable storage medium | |
| CN109769201B (en) | Smart city management platform capable of achieving accurate positioning of user | |
| CN109714712B (en) | Method and device for dropping data to grid based on attribute matching | |
| CN106658399B (en) | Method for positioning mobile phone position based on mobile phone user position fingerprint | |
| US10306415B2 (en) | Method for positioning using wireless signal and positioning server | |
| CN114173356B (en) | Network quality detection method, device, equipment and storage medium | |
| KR101909365B1 (en) | Route planning method and device for navigation system and storage medium | |
| JP2002057614A (en) | Method and device for evaluating rf propagation in radio communication system | |
| CN109766398B (en) | Method and device for dividing raster subareas based on GIS data | |
| CN108289302B (en) | Method and system for positioning atmospheric waveguide interference of TD-LTE network | |
| WO2020024597A1 (en) | Indoor positioning method and apparatus | |
| CN105828393B (en) | Method and device for configuring adjacent cells between systems | |
| US20240040501A1 (en) | Processing method and processing apparatus for saving energy of base station | |
| CN108770057B (en) | Method for determining predetermined fingerprint database, method and device for positioning fingerprint, and storage medium | |
| CN112887910B (en) | Method and device for determining abnormal coverage area and computer readable storage medium | |
| CN109739866B (en) | Automatic updating and optimizing device and method containing fingerprint database | |
| CN109218963B (en) | Position fingerprint data processing method, device, equipment and storage medium | |
| CN114363824B (en) | Commute track depiction method and system based on MR (magnetic resonance) position and road GIS (geographic information System) information | |
| CN111385804B (en) | Cell cluster dividing method and electronic equipment | |
| CN114885369A (en) | Network coverage quality detection processing method and device, electronic equipment and storage medium | |
| CN109769216B (en) | Method and device for grouping users in complex environment based on mobile phone signals | |
| CN108513310A (en) | Virtual road measuring method and device | |
| CN115087023A (en) | Road network analysis method and device | |
| CN111491255B (en) | Backfill longitude and latitude positioning and expanding method, system and storage medium | |
| CN113133049B (en) | Method, apparatus, device and medium for determining primary coverage cell |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220822 Address after: Room 403, No. 355, Wenqu Road, High-tech Zone, Hefei City, Anhui Province, 230094 Patentee after: Anhui Zhongke guochuanggao trusted software Co.,Ltd. Address before: No.355, Wenqu Road, high tech Zone, Hefei City, Anhui Province 230000 Patentee before: USTC SINOVATE SOFTWARE CO.,LTD. |