CN107766516A - A kind of geographical map retained based on border deforms method for visualizing - Google Patents
A kind of geographical map retained based on border deforms method for visualizing Download PDFInfo
- Publication number
- CN107766516A CN107766516A CN201710997882.7A CN201710997882A CN107766516A CN 107766516 A CN107766516 A CN 107766516A CN 201710997882 A CN201710997882 A CN 201710997882A CN 107766516 A CN107766516 A CN 107766516A
- Authority
- CN
- China
- Prior art keywords
- map
- region
- rectangle
- block
- geographical
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Processing Or Creating Images (AREA)
- Instructional Devices (AREA)
Abstract
A kind of geographical map retained based on border deforms method for visualizing, comprises the following steps：1) geographical frontier data are extracted；2) map simplifies；3) mesh generation：Using plane grid subdivision algorithm by map distortion into grid map, in order to ensure the shape of rule is presented in map corresponding with actual geographic region, the grid division on map is simplified；4) block matches：Judge which region is all square types belong to；5) after aforesaid operations, each region is converted into the block being made up of multiple rectangles, and all areas have different colours, so that vision is distinguished.The present invention is by each region of map by extracting its border geodata, the rectangular grid of each of which regional restructuring, and the relative position arrangement of grid corresponds to original geographical position, and this method successfully solves the irregular problem of map boundary line, and remains the geographical frontier in region.
Description
Technical field
The present invention relates to deform method for visualizing based on a kind of geographical map retained based on border.
Background technology
Spatial visualization is always a main direction of studying of information visualization and visual analysis.Wherein, map is empty
Between a kind of visual most common exhibition method, it has the characteristics that simple, directly perceived.
With GPS popularization, geodata and time tag data that map includes are sharply increased, and the visualization of map is entered
Enter the big data epoch.Spatial visualization shows the attribute change of spatial information and geographical phenomenon with visual manner, so as to comprehensive
The evolution of complicated geographical phenomenon is solved, analyzing its rule of development contributes to further simulator variation tendency.Therefore, space can
Have the function that depending on change on complete display data irreplaceable.
Spatial information is typically based on map and carries out visual design and displaying.Map is the most basic composition portion of spatial visualization
Point, it can show data message largely related to geographical position, be favored by numerous big data visual research personnel.
Many researchers based on map making, herein on be superimposed substantial amounts of information, such as traffic data, space coordinates
Data and social network data.However, existing map view is difficult complete coverage information or compares different zones on map
Difference.To find out its cause, one is the lack of standardization of map --- traditional map does not allow user, and superposition is believed in an orderly manner on map
Breath；Second, existing technology such as map distortion technology is intended to enable map that information is vivo presented.
The content of the invention
In order to overcome the shortcomings of that boundary line existing for existing map distortion technology is difficult to completely retain, the present invention proposes one
The method for visualizing for the geographical map deformation that kind is retained based on border, by each region of map by extracting its border geography number
Correspond to original geographical position according to the relative position arrangement of, the rectangular grid of each of which regional restructuring, and grid, this method into
Work(solves the irregular problem of map boundary line, and remains the geographical frontier in region.
The technical solution adopted for the present invention to solve the technical problems is：
A kind of geographical map retained based on border deforms method for visualizing, and the method for visualizing comprises the following steps：
1) geographical frontier data are extracted：Extract the data boundary of map, it is ensured that the ground of algorithm generation provided by the present invention
Diagram shape is identical with the region correspondence position in reality；
2) map simplifies：Simplified map is obtained by Douglas-Peucker algorithms, to reduce in original map data
Distortion point；
3) mesh generation：Using plane grid subdivision algorithm by map distortion into grid map, in order to ensure with practically
Manage the shape that rule is presented in map corresponding to region, the grid division on map is simplified；Process is as follows：
M bar vertical line V { v are drawn on map is simplified1,v2,v3,…vmAnd m bar horizontal line Ls { l1,l2,l3,…lm, m
Value is independently defined by user, and its size illustrates its similarity with traditional map, and m values are bigger, and both similarities are higher；Choosing
Take two adjacent horizontal linear li-1,liWith vertical line vi-1,viAs the component of a rectangle, in this way, all choose
Rectangle all without repeat, so as to form be free of repeat element rectangular set R { R1,R2,R3,…Rn}.Plane grid subdivision algorithm
Realize that step is as follows：Define m values；Draw vertical line collection V { v1,v2,v3,…vmAnd horizontal linear collection L { l1,l2,l3,…
lm}；Straight line in V is arranged from small to large according to subscript, the straight line in L arranges from big to small according to subscript；To V cathetus
vi-1,vi(i=1,2 ... m), by itself and li-1,li(i, 2 ... m) form rectangle, obtain rectangular set R { R1,R2,R3,…Rn}；
4) block matches：Judge which region is all square types belong to：First determine whether rectangle and simplify map in region whether
There is lap, and calculate the area, thus, the intersecting area size by calculating rectangle and region divides rectangle and returned
Category, using following criterion：
If rectangle does not intersect with any region, it is not belonging to any region；
If rectangle is located inside a certain region, rectangle belongs to the region；
If rectangle intersects with two regions, rectangle is attributed to the region big with its intersecting area, with multiple region phases
Friendship scape is equally applicable；
5) after aforesaid operations, each region is converted into the block being made up of multiple rectangles, and all areas have different grids
Filling, so that vision is distinguished.
Further, in the step 2), the process for simplifying map is as follows：
2.1) straight line AB is connected between two point A, B of curve head and the tail, the straight line is the string of curve；
2.2) obtain calculating its distance d with AB from point C maximum with a distance from the straightway on curve；
2.3) size of the distance and previously given threshold value is compared, if less than threshold value, then the straightway is as curve
Approximation, this section of curve processing finish；
2.4) if distance is more than threshold value, curve is divided into two sections of AC and BC with C, and progress that two sections are won the confidence respectively
2.1) processing~2.3)；
2.5) when all curves are all disposed, the broken line that each cut-point is formed is sequentially connected, i.e., as curve
It is approximate；It is simplified map.
In the step 2), in order to be accurately obtained target map, following constraints is provided：
(1) ensure that the block of structure keeps original relative position, avoid information from losing；
(2) ensure that block and original geographic area have similar shape；
(3) ensure that each angle of block deforms at a right angle so that final block map keeps the shape of rule；
(4) ensure that all blocks will not overlap；
(5) ensure there is no white space between two blocks.
The present invention technical concept be：The original boundary information of map is remained, has provided the user certain space
Overlapped information, while aesthetically give people pleasure, clearly feel.This method for visualizing is in traditional Douglas-Peucker
On the basis of algorithm, plane grid subdivision algorithm and block matching algorithm are proposed for geographical map.
The data basis of institute's foundation of the present invention is the area format data such as administration constructed by a series of geographic coordinate datas
The geodata in region, shown in Fig. 1 a is 13, Zhejiang Province local administrative area domain and its county-level city of subordinate or the map in area.
Each zone boundary is made up of substantial amounts of geographical coordinate point, and the underlying attribute in each region includes region ID, zone name, region
Coordinate (being made up of the boundary point of longitude and latitude) and regional center point.Above-mentioned geodata can be read in this method for visualizing, leads to
Algorithm is crossed by traditional Map Design into the deformable map for meeting actual demand, so as to more efficient and vivo show needs
Content.
The present invention devises a kind of based on Douglas-Peucker algorithms and the matching of plane grid subdivision algorithm and block
The variations of algorithms that algorithm combines, the map distortion method for visualizing for the purpose of excavating map boundary line information.With traditional map
Or deformable map form is different, the present invention proposes the deformation method for retaining map boundary information, utilizes Douglas-Peucker
Algorithm, plane grid subdivision algorithm and block matching algorithm, system is set to automatically generate the passing deformable map for needing manual drawing,
It remains the profile of regional on the basis of the relative position of original geographic area is inherited, and as so-called border is protected
Stay.In order to be accurately obtained target map, inventive algorithm gives following constraints：
(1) ensure that the block of structure keeps original relative position, avoid information from losing；
(2) ensure that block and original geographic area have similar shape；
(3) ensure that each angle of block deforms at a right angle so that final block map keeps the shape of rule；
(4) ensure that all blocks will not overlap；
(5) ensure there is no white space between two blocks.
The data boundary of present invention extraction map, forms and is abstracted map with each regional location identical of real map, utilize
The original geographical edge data of Douglas-Peucker algorithm process, map datum is simplified, and is reduced follow-up amount of calculation and is reduced ground
Scheme the cost time of structure；The plane grid subdivision algorithm for simplifying map provides a kind of very novel thinking solution block stroke
Divide problem, judge to overlap using Polygon Collision, reduce the workload divided using geographical coordinate point calculation block；Matching is calculated
Rule is matched block in correct region using simple maximum area matching algorithm, ensure that final map area and original
Beginning, region had similar shape, retained original geographic fringes tendency.
Beneficial effects of the present invention are mainly manifested in：Structure simplifies map simplicity, and workload is less compared to passing technology,
Retain original geographic fringes.
Brief description of the drawings
Fig. 1 a are traditional geographical illustrated example of the present invention, and the border that Fig. 1 b are the present invention retains deformable map example.
Fig. 2 a are the Douglas-Peucker algorithm schematic diagrames of the present invention, wherein, (a) represents Douglas-Peucker
The flow chart of algorithm, (b) represent the schematic diagram of Douglas-Peucker algorithms；The Douglas-Peucker that 2b is the present invention is calculated
Method simplifies map, wherein, (a) represents original map, and (b) represents the map after the simplification of Douglas-Peucker algorithms, (c) table
Show simplification figure gridding.
The plane grid subdivision algorithm that Fig. 3 is the present invention simplifies map.
Fig. 4 is the block matching algorithm schematic diagram of the present invention.
Fig. 5 is the system architecture figure of the present invention.
Embodiment
The invention will be further described below in conjunction with the accompanying drawings.
1~Fig. 5 of reference picture, a kind of geographical map retained based on border deform method for visualizing, the method for visualizing
Comprise the following steps：
1) geographical frontier data are extracted：Extract the data boundary of map, it is ensured that the ground of algorithm generation provided by the present invention
Diagram shape is identical with the region correspondence position in reality；
2) map simplifies：Simplified map is obtained by Douglas-Peucker algorithms, to reduce in original map data
Distortion point.This method is described as follows：2.1) straight line AB is connected between two point A, B of curve head and the tail, the straight line is song
The string of line；2.2) obtain calculating its distance d with AB from point C maximum with a distance from the straightway on curve；2.3) distance is compared
With the size of previously given threshold value, if less than threshold value, then approximation of the straightway as curve, this section of curve processing are complete
Finish.2.4) if distance is more than threshold value, curve is divided into two sections of AC and BC with C, and carry out 2.1 that two sections are won the confidence respectively)~
2.3) processing.2.5) when all curves are all disposed, it is sequentially connected the broken line that each cut-point is formed, you can to make
For the approximation of curve.In this test, threshold value is set to 1 by us.All boundary curves of map are processed as above, obtain letter
Change map.
3) mesh generation：This method propose plane grid subdivision algorithm by map distortion into grid map, in order to ensure with
The shape of rule is presented in map corresponding to actual geographic region, the grid division on map is simplified.Us are operated for this to do
Illustrate briefly below：M bar vertical line V { v are drawn on map is simplified1,v2,v3,…vmAnd m bar horizontal line Ls { l1,l2,l3,…
lm, m values are independently defined by user, and its size illustrates its similarity with traditional map, and m values are bigger, and both get at similarity
It is high.Choose two adjacent horizontal linear li-1,liWith vertical line vi-1,viAs the component of a rectangle, in this way, institute
There is the rectangle chosen all without repetition, to form the rectangular set R { R for being free of repeat element1,R2,R3,…Rn}.Plane grid cuts open
That divides algorithm realizes that step is as follows：Define m values；Draw vertical line collection V { v1,v2,v3,…vmAnd horizontal linear collection L { l1,
l2,l3,…lm}；Straight line in V is arranged from small to large according to subscript, the straight line in L arranges from big to small according to subscript；To V
Cathetus vi-1,vi(i=1,2 ... m), by itself and li-1,li(i, 2 ... m) form rectangle, obtain rectangular set R { R1,R2,R3,…
Rn}。
4) block matches：This method proposes block matching algorithm, judges which region is all square types belong to：First determine whether square
Whether region has lap in shape and simplified map, and calculates the area.Thus, by calculating rectangle and the phase in region
Hand over size division rectangle ownership.Using following criterion：
If rectangle does not intersect with any region, it is not belonging to any region；
If rectangle is located inside a certain region, rectangle belongs to the region；
If rectangle intersects with two regions, rectangle is attributed to the region big with its intersecting area, with multiple region phases
Friendship scape is equally applicable.
5) after aforesaid operations, each region is converted into the block being made up of multiple rectangles, and all areas have different grids
Filling, so that vision is distinguished.
The data basis of institute's foundation of the present invention is the area format data such as administration constructed by a series of geographic coordinate datas
The geodata in region, shown in Fig. 1 a is 13, Zhejiang Province local administrative area domain and its county-level city of subordinate or the map in area.
Each zone boundary is made up of substantial amounts of geographical coordinate point, and the underlying attribute in each region includes region ID, zone name, region
Coordinate (being made up of the boundary point of longitude and latitude) and regional center point.Above-mentioned geodata can be read in this method for visualizing, leads to
Algorithm is crossed by traditional Map Design into the deformable map for meeting actual demand, so as to more efficient and vivo show needs
Content.
The present invention devises a kind of based on Douglas-Peucker algorithms and the matching of plane grid subdivision algorithm and block
The variations of algorithms that algorithm combines, the map distortion method for visualizing for the purpose of excavating map boundary line information.With traditional map
Or deformable map form is different, the present invention proposes the deformation method for retaining map boundary information, utilizes Douglas-Peucker
Algorithm, plane grid subdivision algorithm and block matching algorithm, system is set to automatically generate the passing deformable map for needing manual drawing,
It remains the profile of regional on the basis of the relative position of original geographic area is inherited, and as so-called border is protected
Stay.In order to be accurately obtained target map, inventive algorithm gives following constraints：
Ensure that the block of structure keeps original relative position, avoid information from losing；
Ensure that block and original geographic area have similar shape；
Ensure that each angle of block deforms at a right angle so that final block map keeps the shape of rule；
Ensure that all blocks will not overlap；
Ensure there is no white space between two blocks.
The present embodiment retains the deformable map on border based on plane grid subdivision algorithm and block matching algorithm, generation
Method for visualizing, specific implementation step are as follows：
1) geographical frontier data are extracted：Extract the data boundary of map, it is ensured that the ground of algorithm generation provided by the present invention
Diagram shape is identical with the region correspondence position in reality.
2) map simplifies：Simplified map is obtained by Douglas-Peucker algorithms, to reduce in original map data
Distortion point.This method is described as follows：2.1) straight line AB is connected between two point A, B of curve head and the tail, the straight line is song
The string of line；2.2) obtain calculating its distance d with AB from point C maximum with a distance from the straightway on curve；2.3) distance is compared
With the size of previously given threshold value, if less than threshold value, then approximation of the straightway as curve, this section of curve processing are complete
Finish.2.4) if distance is more than threshold value, curve is divided into two sections of AC and BC with C, and carry out 2.1 that two sections are won the confidence respectively)~
2.3) processing.2.5) when all curves are all disposed, it is sequentially connected the broken line that each cut-point is formed, you can to make
For the approximation of curve.In this test, threshold value is set to 1 by us.All boundary curves of map are processed as above, obtain letter
Change map.
3) mesh generation：This method propose plane grid subdivision algorithm by map distortion into grid map, in order to ensure with
The shape of rule is presented in map corresponding to actual geographic region, the grid division on map is simplified.Us are operated for this to do
Illustrate briefly below：M bar vertical line V { v are drawn on map is simplified1,v2,v3,…vmAnd m bar horizontal line Ls { l1,l2,l3,…
lm, m values are independently defined by user, and its size illustrates its similarity with traditional map, and m values are bigger, and both get at similarity
It is high.
Choose two adjacent horizontal linear li-1,liWith vertical line vi-1,viAs the component of a rectangle, such as
This, all rectangles chosen are all without repetition, to form the rectangular set R { R for being free of repeat element1,R2,R3,…Rn}.Plane
Mesh generation algorithm realizes that step is as follows：Define m values；Draw vertical line collection V { v1,v2,v3,…vmAnd horizontal linear collection
L{l1,l2,l3,…lm}；Straight line in V is arranged from small to large according to subscript, the straight line in L is arranged from big to small according to subscript
Row；To V cathetus vi-1,vi(i=1,2 ... m), by itself and li-1,li(i, 2 ... m) form rectangle, obtain rectangular set R { R1,
R2,R3,…Rn}。
4) block matches：This method proposes block matching algorithm, judges which region is all square types belong to：First determine whether square
Whether region has lap in shape and simplified map, and calculates the area.Thus, by calculating rectangle and the phase in region
Hand over size division rectangle ownership.Using following criterion：
If rectangle does not intersect with any region, it is not belonging to any region；
If rectangle is located inside a certain region, rectangle belongs to the region；
If rectangle intersects with two regions, rectangle is attributed to the region big with its intersecting area, with multiple region phases
Friendship scape is equally applicable.
5) after aforesaid operations, each region is converted into the block being made up of multiple rectangles, and all areas have different nets
Lattice are filled, so that vision is distinguished.
Described above is the map change that the case study on implementation that the present invention provides illustrates Zhejiang Province geography administrative region
Shape, it is clear that the present invention is not only limited to above-described embodiment, without departing from essence spirit of the present invention and without departing from essence of the present invention
A variety of deformations can be made on the premise of scope involved by appearance to it to be carried out.The visualization scheme proposed is applied to various geography
The deformation of map.
Claims (3)
1. a kind of geographical map retained based on border deforms method for visualizing, it is characterised in that：The method for visualizing includes
Following steps：
1) geographical frontier data are extracted：Extract the data boundary of map；
2) map simplifies：Simplified map is obtained by Douglas-Peucker algorithms；
3) mesh generation：Using plane grid subdivision algorithm by map distortion into grid map, in order to ensure with actual geographic area
The shape of rule is presented in map corresponding to domain, the grid division on map is simplified；Process is as follows：
M bar vertical line V { v are drawn on map is simplified1,v2,v3,…vmAnd m bar horizontal line Ls { l1,l2,l3,…lm, m values by with
Family independently defines, and its size illustrates its similarity with traditional map, and m values are bigger, and both similarities are higher；Choose adjacent
Two horizontal linear li-1,liWith vertical line vi-1,viAs the component of a rectangle, in this way, all rectangles chosen
All without repetition, to form the rectangular set R { R for being free of repeat element1,R2,R3,…Rn}.The realization of plane grid subdivision algorithm
Step is as follows：Define m values；Draw vertical line collection V { v1,v2,v3,…vmAnd horizontal linear collection L { l1,l2,l3,…lm}；By V
In straight line arranged from small to large according to subscript, the straight line in L arranges from big to small according to subscript；To V cathetus vi-1,vi(i
=1,2 ... m), by itself and li-1,li(i, 2 ... m) form rectangle, obtain rectangular set R { R1,R2,R3,…Rn}；
4) block matches：Judge which region is all square types belong to：First determine whether rectangle and simplify whether region in map has weight
Folded part, and the area is calculated, thus, the intersecting area size by calculating rectangle and region divides rectangle and belonged to, and adopts
With following criterion：
If rectangle does not intersect with any region, it is not belonging to any region；
If rectangle is located inside a certain region, rectangle belongs to the region；
If rectangle intersects with two regions, rectangle is attributed to the region big with its intersecting area, with multiple region phase friendship
Scape is equally applicable；
5) after aforesaid operations, each region is converted into the block being made up of multiple rectangles, and all areas have different colours, so as to
Vision is distinguished.
2. a kind of geographical map retained based on border as claimed in claim 1 deforms method for visualizing, it is characterised in that：Institute
State in step 2), the process for simplifying map is as follows：
2.1) straight line AB is connected between two point A, B of curve head and the tail, the straight line is the string of curve；
2.2) obtain calculating its distance d with AB from point C maximum with a distance from the straightway on curve；
2.3) size of the distance and previously given threshold value is compared, if less than threshold value, then the straightway is as the near of curve
Seemingly, this section of curve processing finishes；
2.4) if distance is more than threshold value, curve is divided into two sections of AC and BC with C, and carry out 2.1 that two sections are won the confidence respectively)~
2.3) processing；
2.5) when all curves are all disposed, the broken line that each cut-point is formed, the i.e. approximation as curve are sequentially connected；
It is simplified map.
3. a kind of geographical map retained based on border as claimed in claim 1 or 2 deforms method for visualizing, its feature exists
In：In the step 2), in order to be accurately obtained target map, following constraints is provided：
(1) ensure that the block of structure keeps original relative position, avoid information from losing；
(2) ensure that block and original geographic area have similar shape；
(3) ensure that each angle of block deforms at a right angle so that final block map keeps the shape of rule；
(4) ensure that all blocks will not overlap；
(5) ensure there is no white space between two blocks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710997882.7A CN107766516A (en) | 2017-10-24 | 2017-10-24 | A kind of geographical map retained based on border deforms method for visualizing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710997882.7A CN107766516A (en) | 2017-10-24 | 2017-10-24 | A kind of geographical map retained based on border deforms method for visualizing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107766516A true CN107766516A (en) | 2018-03-06 |
Family
ID=61269961
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710997882.7A Pending CN107766516A (en) | 2017-10-24 | 2017-10-24 | A kind of geographical map retained based on border deforms method for visualizing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107766516A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109029421A (en) * | 2018-06-22 | 2018-12-18 | 南京擎天科技有限公司 | A kind of regional location coordinate acquisition method based on LBS technology |
| CN110246202A (en) * | 2018-03-07 | 2019-09-17 | 苏州猫耳网络科技有限公司 | A kind of grid drawing method based on map area boundary GPS coordinate |
| CN110930748A (en) * | 2019-10-18 | 2020-03-27 | 深圳智慧园区信息技术有限公司 | Vehicle searching system and vehicle searching method |
| CN111222682A (en) * | 2019-11-12 | 2020-06-02 | 浙江工业大学 | Second-order optimization simplification method for map boundary data |
| CN111383235A (en) * | 2020-03-27 | 2020-07-07 | 许昌泛网信通科技有限公司 | Map region processing method |
| CN112529243A (en) * | 2020-10-22 | 2021-03-19 | 西安超越申泰信息科技有限公司 | Flow direction map path optimization display method based on road network image |
| CN113693494A (en) * | 2021-02-10 | 2021-11-26 | 北京石头世纪科技股份有限公司 | Map drawing method and device, medium and electronic equipment |
| WO2023142692A1 (en) * | 2022-01-27 | 2023-08-03 | 追觅创新科技(苏州)有限公司 | Map beautification method and system, and cleaning device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101707026A (en) * | 2009-11-25 | 2010-05-12 | 中国人民解放军信息工程大学 | Combined optimization method for simplifying digital map linear factors |
| CN102298640A (en) * | 2011-09-14 | 2011-12-28 | 清华大学 | Method for preprocessing map display data |
| CN103309859A (en) * | 2012-03-06 | 2013-09-18 | 腾讯科技（深圳）有限公司 | Data thinning method and device |
| CN103578348A (en) * | 2012-08-10 | 2014-02-12 | 袁明千 | Grid method for drawing city map and application thereof |
-
2017
- 2017-10-24 CN CN201710997882.7A patent/CN107766516A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101707026A (en) * | 2009-11-25 | 2010-05-12 | 中国人民解放军信息工程大学 | Combined optimization method for simplifying digital map linear factors |
| CN102298640A (en) * | 2011-09-14 | 2011-12-28 | 清华大学 | Method for preprocessing map display data |
| CN103309859A (en) * | 2012-03-06 | 2013-09-18 | 腾讯科技（深圳）有限公司 | Data thinning method and device |
| CN103578348A (en) * | 2012-08-10 | 2014-02-12 | 袁明千 | Grid method for drawing city map and application thereof |
Non-Patent Citations (2)
| Title |
|---|
| DONG YOUFU 等: "Comparison of Popular Methods for Simplifying Terrain Based on Grid DEMs", 《2010 THE 2ND CONFERENCE ON ENVIRONMENTAL SCIENCE AND INFORMATION APPLICATION TECHNOLOGY》 * |
| 邵世维: "基于几何特征的多尺度矢量面状实体匹配方法研究与应用", 《中国博士学位论文全文数据库 基础科学辑（月刊）》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110246202A (en) * | 2018-03-07 | 2019-09-17 | 苏州猫耳网络科技有限公司 | A kind of grid drawing method based on map area boundary GPS coordinate |
| CN109029421A (en) * | 2018-06-22 | 2018-12-18 | 南京擎天科技有限公司 | A kind of regional location coordinate acquisition method based on LBS technology |
| CN110930748A (en) * | 2019-10-18 | 2020-03-27 | 深圳智慧园区信息技术有限公司 | Vehicle searching system and vehicle searching method |
| CN111222682A (en) * | 2019-11-12 | 2020-06-02 | 浙江工业大学 | Second-order optimization simplification method for map boundary data |
| CN111222682B (en) * | 2019-11-12 | 2022-05-03 | 浙江工业大学 | Second-order optimization simplification method for map boundary data |
| CN111383235A (en) * | 2020-03-27 | 2020-07-07 | 许昌泛网信通科技有限公司 | Map region processing method |
| CN111383235B (en) * | 2020-03-27 | 2023-04-21 | 许昌泛网信通科技有限公司 | Map area processing method |
| CN112529243A (en) * | 2020-10-22 | 2021-03-19 | 西安超越申泰信息科技有限公司 | Flow direction map path optimization display method based on road network image |
| CN113693494A (en) * | 2021-02-10 | 2021-11-26 | 北京石头世纪科技股份有限公司 | Map drawing method and device, medium and electronic equipment |
| CN113693494B (en) * | 2021-02-10 | 2023-11-14 | 北京石头创新科技有限公司 | Map drawing method and device, medium and electronic equipment |
| WO2023142692A1 (en) * | 2022-01-27 | 2023-08-03 | 追觅创新科技(苏州)有限公司 | Map beautification method and system, and cleaning device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107766516A (en) | A kind of geographical map retained based on border deforms method for visualizing | |
| CN103236086B (en) | One takes the contextual multiple dimensioned DEM modeling method of the earth's surface hydrology into account | |
| CN102169650B (en) | System, apparatus and method for mapping | |
| JP2011512606A (en) | Geospace modeling system and related methods for providing tree trunks and branches by simulation for groups of crown vegetation points | |
| CN103955566B (en) | A kind of transmission line of electricity three-dimensional design method and system based on Google Earth | |
| CN104268145B (en) | A kind of map fast drawing method of complexity vector data | |
| CN105513131B (en) | A kind of three-dimensional geological structural model Corner-point Grids subdivision method taking fold into account | |
| CN103065361B (en) | Three-dimensional island sand table implementation method | |
| CN106651609A (en) | Auxiliary information system and method of remote-sensing monitoring for mineral resource exploitation environment | |
| CN104008570A (en) | Double three-dimensional modeling method for mine | |
| CN107967702A (en) | The thermodynamic chart method for visualizing of reverse color applying drawing | |
| CN102663800A (en) | City building complex and rendering method considering city image | |
| CN102214367A (en) | Three dimensional (3D) modeling and visualizing method of prehistoric settlement sites | |
| CN116152461B (en) | Geological modeling method, device, computer equipment and computer readable storage medium | |
| JP2010503119A (en) | Geospace modeling system and related methods to give tree trunks by simulation of groups of canopy vegetation points | |
| CN105975512A (en) | Method for constructing multidimensional attribute visual generalized model considering spatial position | |
| CN109902120A (en) | A kind of visual analysis method towards grid text precipitation data | |
| CN105354882A (en) | Method for constructing big data architecture based three-dimensional panoramic display platform for large-spatial-range electricity transmission | |
| CN105184862B (en) | A kind of three dimension strata model dynamic fixing method | |
| CN107944089A (en) | A kind of plot limit for height analysis system and its analysis method for regarding corridor because of the present circumstance | |
| García et al. | 3D modeling and representation of the Spanish Cadastral cartography | |
| Rui et al. | Quantifying the spatial quality of urban streets with open street view images: A case study of the main urban area of Fuzhou | |
| Zahran et al. | 3D visualization of traffic-induced air pollution impacts of urban transport schemes | |
| CN106772433B (en) | Building line based on airborne laser radar data draws drawing generating method | |
| WO2018196214A1 (en) | Statistics system and statistics method for geographical influence on vernacular architectural form |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180306 |