CN101488141A - Electronic map data processing method - Google Patents
Electronic map data processing method Download PDFInfo
- Publication number
- CN101488141A CN101488141A CNA200810243866XA CN200810243866A CN101488141A CN 101488141 A CN101488141 A CN 101488141A CN A200810243866X A CNA200810243866X A CN A200810243866XA CN 200810243866 A CN200810243866 A CN 200810243866A CN 101488141 A CN101488141 A CN 101488141A
- Authority
- CN
- China
- Prior art keywords
- map
- execution
- compression
- point
- map data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a method used for mobile phone end map treatment, mainly comprising the following steps: superfluous attributes unused by a mobile phone end electronic map in original map data are deleted; the map clipping is carried out to realize the one-time selecting multi-region multi-layer clipping, and the condition that a plurality of geographic entities have the same mark in clipping results is automatically recognized and treated according to the requirements of users; the map compression is carried out, including lossless compression and loss compression, wherein, the lossless compression cannot influence the precision and the information amount of original maps, the loss compression realizes the maximum compression under the premise of losing part of the map precision, the users are supported to input compression tolerance to obtain maps which better accord with the practical application requirement; feature points on the map are automatically recognized and reserved, and the users are supported to appoint extra feature points; the loss compression adopts a strategy that common edges are compressed firstly and then the body of a polygon is compressed, therefore, the compression distortion phenomenon is avoided effectively; to the compression distortion caused by the original map data, the accuracy of the compressed data is guaranteed.
Description
Technical field
The present invention relates to a kind of geographic information system technology field, particularly a kind of electronic map data processing method of digital urban management mobile phone end.
Background technology
In the process of present information development, electronic chart has goed deep into also bringing into use electronic chart in the every aspect, particularly mobile phone of people life.In the digital urban management application system, the street patroller finds will utilize mobile phone to carry out problem escalation after the problem of city management aspect, mobile phone end must be able to provide the details (coordinate and normal address) of incident position, should also provide the information of all city management parts in addition and shows with special icon on map.The geographical packets of information in basis, city in the map is drawn together main roads, secondary road, river, buildings and street scope, responsibility grid, myriametre unit grid etc., the city management parts comprise dozens or even hundreds of figure layers such as street lamp, trees, various well lid, bus station's booth, mailbox, greenery patches, and the memory space that all these cartographic informations add together for mobile phone is appreciable; Mobile phone also is subjected to the restriction of transmission speed in addition, and the map that therefore is applied to mobile phone end must compress its data volume as far as possible on the basis that keeps certain quantity of information.
Each street patroller can be responsible for certain beat in the system of municipal administration, and for the zone outside the responsibility he and be indifferent to, therefore there is no need the map of entire city is stored on each patroller's the mobile phone, the area of responsibility of only storing him gets final product, and this has just related to map cutting problem.
After trimming operation is finished,, just need carry out the map compression if the map datum amount is still very big.Application at present map vector data compression method more widely is Douglas-Pu Ke algorithm, and its basic thought is: establish curve by point sequence P1, P2, Pn constitutes, and a Pi (i=2,3 are arranged in the calculated curve, n-1) to the distance D i of straight line P1Pn, choose its middle distance maximum point Pk, if Dk is poor less than given precision limit, then remove in the P1Pn have a few, otherwise Pk is as retention point.Utilize retention point Pk that primary curve is divided into two sections P1Pk, PkPn, use the same method the discrete point between their curve is detected, determine the next group retention point.Method is carried out repeatedly successively, till the ultimate range between 2 o'clock is less than precision limit difference.Douglas-Pu Ke algorithm Recursive Implementation from integral body to the part, from coarse to finely comes compression curve, and its advantage is the unchangeability with translation and rotation, after given curve and the limit difference, and its compression result unanimity.But also there are some problems in Douglas-Pu Ke algorithm in compression process, mainly show as: can't guarantee that unique point is not deleted.Unique point is meant some key points of the actual landforms of reaction, such as intersection point and some turning point of road, if these points are dropped the error that can cause in landform distortion and the spatial analysis.As shown in Figure 2, the words curve seriously distortions deleted as fruit dot 2 and point 3, this time point 2 and 3 should be used as the unique point reservation.Polygon compression public boundary problem of dtmf distortion DTMF.Shown in Fig. 3 a and Fig. 3 b, the starting point of polygon A is 1, and the starting point of polygon B is 2, the slit occurs between the polygon of compression back.Can't eliminate the influence that raw data causes compression.May there be the slight distortion situation in the raw data that the user provides in the practical application, two adjacent polygons are reacted to possibility and non-conterminous on the map in the real world, have trickle crack between them and overlap, this small distortion phenomenon does not influence its application within the accuracy requirement of raw data.Principle according to Douglas-Pu Ke algorithm can be released, and polygon compresses the amplification that must cause this trickle distortion, and along with compressing the poor expansion of limit and enlarging, reaches the stage of influence calculating and analysis result sometimes.
Summary of the invention
Goal of the invention: the present invention is directed to the high compression amount that to satisfy simultaneously and normal use of prior art, a kind of more complete mobile phone end map cutting and the electronic map data processing method of compression are provided.
Technical scheme: the invention discloses a kind of electronic map data processing method, it is characterized in that, this method may further comprise the steps:
Step 5 is checked data type, if point diagram layer execution in step 20 then, if line chart layer or face figure layer execution in step 6 then;
Step 6 is a foundation with angle and distance with consecutive point, and the key point of extracting reflection line and polygonal shape is as unique point;
Step 11 is checked data type, if line chart layer execution in step 17, if face figure layer execution in step 12 then;
Step 13 by the map vector data format conversion, is added topology information, and forces topology verification to be handled;
Step 17 adopts Douglas-Pu Ke compression algorithm line chart layer;
Among the present invention, the redundant points that described lossless compress causes for deletion map digitizing process; May further comprise the steps: (a) calculation level Pi and the definite straight line of some Pi+1 are designated as straight line L; (b) whether judging point Pi+2 on straight line L, be then to remove a Pi+1 counting i=i+1 and continue step (b), otherwise counting i=i+1 returns step (a).
Among the present invention, read in all polygons in the figure layer in the step 14 earlier, extract common edge more successively.
Among the present invention, all polygons in the step 14 in the disposable figure of the reading in layer also back up in internal memory, after all squeeze operations are finished again property write back map data base.
Judge in the step 12 whether original map adds topology information, step 13 is added topology information, is forced topology verification and go back to original data layout by Data Format Transform.
Among the present invention, input point then obtains accuracy of map height to the minor increment of straight line or Polygonal Boundary in the step 10.
Beneficial effect: the invention provides the complete mobile phone end map treatment method of a cover, comprise deletion redundancy of attribute, map cutting, map compression, deficiency at traditional algorithm has proposed corresponding solution, by introducing " polygon pond " and raw data topology detection mechanism is that the map compression is more accurate, simultaneously integrated multiple map treatment method makes the user make more selection according to concrete application demand.
Description of drawings
Below in conjunction with the drawings and specific embodiments the present invention is done further and to specify.
Fig. 1 is the process flow diagram of the method for the invention.
Fig. 2 is unique point example and testing mechanism explanation.
Fig. 3 is the explanation of Polygonal Boundary compression artefacts problem.
Fig. 4 is the trans-regional problem of the geographical entity in the map cutting.
Embodiment
As shown in Figure 1, the invention discloses a kind of electronic map data processing method, this method may further comprise the steps:
(1) deletion is at the no attribute information of mobile phone end electronic chart.With the digital urban management is example, original map has been added a lot of attribute datas for the consideration of spatial analysiss such as inquiry, calculating, statistics, make map comprise the more information amount, and do not need to do spatial analysis operation in mobile phone end, as long as can uniquely determine a component entity (comprising positional information and unique identification), for mobile phone end so most attribute all is a redundancy of attribute.The invention provides the function of removing these useless attributes, the attribute list of map can be enumerated out automatically in system, determines which keeps by the user.Be equal to or less than pre-provisioning request execution in step (20) if handle back map datum amount, otherwise execution in step (2).The user can import needed attribute information and user's decrement requirement in the program incipient stage.The redundancy of attribute of deletion original map data is the comparatively general technology in this area.
(2) judging whether need be by regional cutting map, is execution in step (3) then, otherwise execution in step (5).
(3) carry out the map cutting.
(4) detecting and eliminate the map cutting causes a plurality of geographical entities to have the like-identified problem.As shown in Figure 4, need clipping region A and B, dash area is represented the greenery patches parts, and same greenery patches parts will have two after cutting is finished in A, and the sign in these two greenery patchess is consistent.Detection method is, judge at first whether all entity identification quantity equal physical quantities in the figure layer, be then illustrate do not exist data not only problem directly carry out next step operation, otherwise find out entity and still import the entity of original map according to these entities of customer requirements decision deletion with duplicate marking.The execution in step (20) if the map datum amount is equal to or less than pre-provisioning request, otherwise execution in step (5).
(5) check data type, if point diagram layer execution in step (20) then, if line or face figure layer execution in step (6).
(6) be foundation with angle and distance with consecutive point, the key point of extracting reflection line and polygonal shape is as unique point.As shown in Figure 2, point 2 and point 3 have reflected the key turnover of line, if delete their lines shape will great changes will take place.The mechanism of detected characteristics point is: the angle PiPi+1Pi+2 of calculating consecutive point (i=1,2 ..., n-2), be designated as α, if α less than angle limit difference β, calculates the distance D 1 of PiPi+1, the distance D 2 of Pi+1Pi+2, if D1, D2 all limit difference d greater than distance, then putting Pi+1 is unique point.
(7) the undetected in addition unique point of given step (6).
(8) judge map compression method, lossless compress execution in step (9), lossy compression method execution in step (10) according to different demands to the accuracy of map and decrement.Map compression algorithm of the present invention is divided into lossless compress and lossy compression method.Lossless compress keeps the precision of original map constant, but decrement is less.Lossy compression method then takes to change with precision the mode of data volume, and the accuracy of map reduces, and data volume also reduces.Map compression is actually at an equilibrium point of seeking between the accuracy of map and the data volume, if the precision of strict maintenance original map is less demanding then carry out lossless compress to data volume, if focused data amount problem then carry out lossy compression method relatively.
(9) after the execution lossless compress, execution in step (19).Lossless compress is actually the redundant points that deletion map digitizing process causes, because comparatively dense is a little compared in adopting during digitizing, in actual map accuracy rating (6-8 position after generally keeping decimal) can occur adjacent 3 or more multiple spot be in the situation of straight line, lossless compress is eliminated this redundancy issue exactly.Specific algorithm is: (a) calculation level Pi (i=1,2 ..., n-2), be designated as straight line L with the definite straight line of some Pi+1; (b) whether judging point Pi+2 on straight line L, is then to remove a Pi+1 to calculate i=i+1 and continue step (b), returns step (a) otherwise calculate i=i+1.
(10) the compression limit of input lossy compression method is poor.Douglas-Pu Ke algorithm after lossy compression method adopt to be improved, the choosing of compression limit difference need be taken all factors into consideration the accuracy of map, data volume, the map mid point factors such as distance to line or Polygonal Boundary.If but the map ratio of precision is paid close attention to the minor increment of input point to straight line or Polygonal Boundary, if pay close attention to decrement more then can suitably to amplify the compression limit poor.The map compression should be an operating process of carrying out repeatedly, often needs repeatedly to adjust the poor repeatedly compression of compression limit and just can reach demand.
(11) check data type, if the line chart layer is according to execution in step (17), if face figure layer execution in step (12).
(12) accuracy of map that whether exists slight distortion and compression back to require according to original map data judges whether that needs carry out topology verification and handle, and is execution in step (14) then, otherwise execution in step (13).The present invention proposes and has solved the compression artefacts problem that is caused by original map data first, i.e. at first carry out topology verification before the map compression.The slight distortion problem that raw data exists is not generally added topology information and is caused, the storage format of current electronic map data mainly contains vector graphics format (Shapefile), spatial data library format (GeoDatabase) and based on the storage format (Coverage) of file, wherein vector graphics format (Shapefile) can not be added topology information.Therefore, before the map compression, to check at first whether whether original map adds topology information, carried out the pressure topology verification.
(13) carrying out topology verification handles.The process of topology verification is: (a) check original data type, if vector graphics format (Shapefile) then converts spatial data library format (GeoDatabase) to; (b) whether check data has topology information, if not then add " not allowing to exist the crack " (Must Not HaveGaps) and two topology rules of " not allowing to exist overlapping " (Must Not Overlap); (c) convert storage format (Coverage) to, and force topology verification based on file; (d) go back to spatial data library format (GeoDatabase); (e) if raw data is vector graphics format (Shapefile), then go back to this form.
(14) extract polygonal common edge.At first read in all polygons in the figure layer, extract common edge then successively.The present invention has adopted " polygon pond " technology first, and all polygons in the disposable figure of the reading in layer also back up in internal memory, after all squeeze operations are finished again property write back database.Compare general repeatedly read-write technology, it has brought the improvement of two aspects: reduced the storehouse operation that reads and writes data, improved operational efficiency; Be easy to obtain the modification of in the compression process figure layer being made.The two-way method of exhaustion is adopted in the extraction of polygon common edge, concrete steps are: (a) read the polygon Pi (i=1 in the polygon pond, 2,, n-1), Pi+1, judge whether the boundary rectangle of Pi and Pi+1 intersects, be then to calculate to intersect rectangle R, compare otherwise read Pi+2 and Pi,, and remember that again this polygon is Pk up to the polygon that finds and the Pi boundary rectangle intersects; (b) relatively Pi and Pk are positioned at coordinate points within the R, find the identical point of first coordinate (being Aj among the Pi, is Bj among the Pk), write down its period, are start_1 among the Pi, are start_2 among the Pk, if can not find the coordinate identical point then return step (a); (c) order relatively Am (m=j+1, j+2 ..., n) and Bm (m=j+1, j+2 ..., n), up to finding last to identical point, the period that writes down them is end_1 and end_2; Otherwise backward comparison Am (m=j+1, j+2 ..., n) and Bm (m=j-1, j-2 ..., 1), up to finding last to identical point, and the period that writes down them is end_1 and end_2; (d) point between start_1, end_1 and start_2, the end_2 is two polygonal common edge; (e) if period end_1=n finishes the search common edge; Otherwise continue relatively other points, because two polygonal common edge may more than one.
(15) adopt Douglas-all common edge of Pu Ke compression algorithm, and retention point is done sign.
(16) whether the point that detects in the polygon does the overcompression sign, if identify then do not compress.The compression common edge recompresses polygonal method and has not only eliminated the compression artefacts problem earlier, also can improve the speed of compression, because Douglas-Pu Ke algorithm is a kind of recursive calculation, the few more computing velocity of the point in the polygon is fast more.Adopt Douglas-Pu Ke compression algorithm not do the point of sign, execution in step (18).
(17) adopt Douglas-Pu Ke compression algorithm line chart layer.
(18) map after the output compression.
(19) the map mid point after check is compressed whether has broken away from original zone and whether data volume has reached pre-provisioning request, and two conditions all satisfy then execution in step (20), otherwise return step (8).
(20) obtain the mobile phone end map of finishing dealing with.
Embodiment 1:
Be the introduction that example is carried out embodiment with Yancheng digital urban management map below.Owing to the invention belongs to the invention of software approach, and be signed with the intellecture property confidentiality agreement,, meet the requirement of the relevant novelty of Patent Law so the described technical scheme of present patent application still is in confidential state with corresponding unit.
Yancheng digital urban management data comprise Tinghu District and Yandu District from administrative division, two districts comprise 13 streets such as five-pointed star street, ocean street, pioneer street again; From vertical figure layer, comprise the city management parts, city management, the urban geography coding, basis landform and administrative division 5 parts, wherein the city management parts comprise street lamp, shade tree, the rainwater well lid, mailbox, the greenery patches, the public lavatory, 76 figure layers such as propaganda board, city management comprises 2 figure layers, the urban geography coding comprises 4 figure layers, basal relief map comprises main roads, secondary road, railway, 9 figure layers such as river, administrative division comprises 4 figure layers, totally 95 figure layer, the 157MB data volume, and the pre-provisioning request of electronic map data decrement of mobile phone end is in the 5MB.Be that unit manages with the street in the digital urban management of Yancheng, each patroller's mobile phone end only need be stored the map that oneself is responsible for the street, and treatment scheme is:
(1) removes redundancy of attribute.With the street lamp parts is example, raw data has 38 attribute fields, but mobile phone end only needs an OBJCODE field to be used for street lamp of unique identification to get final product, and removes unsuppressible two fields (by the file layout decision) again, and this step has been deleted 35 attribute fields.
(2) each street patroller only needs oneself to be responsible for the map in zone in the digital urban management of Yancheng, therefore need carry out cutting by the street, execution in step (3).
(3) be all 95 figure layers of regional cutting with all 13 streets.
(4) detect each figure layer of each street and whether have not only problem of data, this step is finished automatically, need not manual intervention.The street of data volume maximum was 9MB (after tested, being 24.3MB when not deleting redundancy of attribute) after operation was finished, but data volume is still too big, so execution in step (5).
(5) once check the data type of each figure layer of each street, point diagram layer execution in step (20) be output map directly, the direct step of line chart layer (6), and this step is finished automatically, need not manual intervention.
(6) unique point in extraction point diagram layer and the line chart layer, this step is finished automatically.
(7) specify indivedual unique points of scheming in the layer according to actual needs, such as the intersection point of road.
(8) requirement of the decrement of Yancheng digital urban management mobile phone end map is bigger, and lossless compress can't reach, and therefore adopts lossy compression method, execution in step (10).
(9) this step is not carried out.
(10) input compression limit difference is 10 meters.
(11) check data type, line chart layer execution in step (17), face figure layer execution in step (12), this step is finished automatically.
(12) be spatial data library format (GeoDatabase) through check Yancheng digital urban management original map, but do not have topology information, therefore need carry out topology verification and handle execution in step (13).
(13) carrying out topology verification handles.
(14) extract polygonal common edge in the face figure layer.
(15) adopt Douglas-Pu Ke compression algorithm common edge.
(16) adopt Douglas-Pu Ku compression algorithm polygon.
(17) adopt Douglas-Pu Ke compression algorithm line chart layer.
(18) map after obtaining compressing.
(19) check finds that the accuracy of map after the compression is too low, need readjust compression method, and compression limit difference is changed into 1 meter, returns step (8).
(20) the mobile phone end electronic chart after obtaining compressing.After testing, the accuracy of map meets the requirements, and the data volume in maximum street is 4.8MB, and compression effectiveness is very good, fully satisfies the service requirement of mobile phone end fully, thinks coupling with the travelling speed and the tupe of mobile phone.
The invention provides a kind of thinking and method of electronic map data processing method; the method and the approach of this technical scheme of specific implementation are a lot; the above only is a preferred implementation of the present invention; should be understood that; for those skilled in the art; under the prerequisite that does not break away from the principle of the invention, can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.The all available prior art of each component part not clear and definite in the present embodiment is realized.
Claims (7)
1, a kind of electronic map data processing method is characterized in that, this method may further comprise the steps:
(1), in mobile phone end electronic chart respective attributes information, is equal to or less than the pre-provisioning request of decrement in the deletion original map data, execution in step (20) then, otherwise execution in step (2) if handle back map datum amount according to selection;
(2) judging whether need be by regional cutting map, is execution in step (3) then, otherwise execution in step (5);
(3) carry out the map cutting;
(4) detect and eliminate the cutting that causes owing to geographical entity is trans-regional after a plurality of geographical entities have the like-identified problem, if the map datum amount is equal to or less than the pre-provisioning request of decrement, execution in step (20) then, otherwise execution in step (5);
(5) check data type, if point diagram layer execution in step (20) then, if line chart layer or face figure layer execution in step (6) then;
(6) be foundation with angle and distance with consecutive point, the key point of extracting reflection line and polygonal shape is as unique point;
(7) the undetected in addition unique point of given step (6);
(8) judge the map compression method according to the demand of the accuracy of map in the practical application and amount of compressed data aspect,, then select lossless compress, execution in step (9) if be strict with the accuracy of map; If relatively pay close attention to decrement, then select lossy compression method, execution in step (10);
(9) after the execution lossless compress, execution in step (19);
(10) compression limit definite and the input lossy compression method is poor;
(11) check data type, if line chart layer execution in step (17), if face figure layer execution in step (12);
(12) accuracy of map that whether exists slight distortion and compression back to require according to original map data judges whether that needs carry out topology verification and handle, and is execution in step (14) then, otherwise execution in step (13);
(13), add topology information, and force topology verification to be handled by the map vector data format conversion;
(14) adopt the two-way method of exhaustion to extract polygonal common edge;
(15) adopt Douglas-Pu Ke compression algorithm common edge;
(16) adopt Douglas-Pu Ke compression algorithm polygon, execution in step (18);
(17) adopt Douglas-Pu Ke compression algorithm line chart layer;
(18) map after the output compression;
(19) the map mid point after check is compressed whether has broken away from original zone and whether data volume has reached the pre-provisioning request of decrement, and two conditions all satisfy then execution in step (20), otherwise return step (8);
(20) obtain the mobile phone end map of finishing dealing with.
2, electronic map data processing method according to claim 1 is characterized in that: the redundant points that described lossless compress causes for deletion map digitizing process; May further comprise the steps: (a) calculation level Pi and the definite straight line of some Pi+1 are designated as straight line L; (b) whether judging point Pi+2 on straight line L, be then to remove a Pi+1 counting i=i+1 and continue step (b), otherwise counting i=i+1 returns step (a).
3, electronic map data processing method according to claim 1 is characterized in that, reads in all polygons in the figure layer in the step (14) earlier, extracts common edge more successively.
4, electronic map data processing method according to claim 3 is characterized in that, all polygons in the step (14) in the disposable figure of the reading in layer also back up in internal memory, after all squeeze operations are finished again property write back map data base.
5, electronic map data processing method according to claim 1, it is characterized in that, judge whether original map adds topology information in the step (12), step (13) is added topology information, is forced topology verification and go back to original data layout by Data Format Transform.
6, electronic map data processing method according to claim 1 is characterized in that, input point then obtains accuracy of map height to the minor increment of straight line or Polygonal Boundary in the step (10).
7, electronic map data processing method according to claim 1 is characterized in that, the pre-provisioning request of electronic map data decrement of mobile phone end is in the 5MB.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200810243866 CN101488141B (en) | 2008-12-16 | 2008-12-16 | Electronic map data processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200810243866 CN101488141B (en) | 2008-12-16 | 2008-12-16 | Electronic map data processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101488141A true CN101488141A (en) | 2009-07-22 |
| CN101488141B CN101488141B (en) | 2011-03-09 |
Family
ID=40891035
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200810243866 Active CN101488141B (en) | 2008-12-16 | 2008-12-16 | Electronic map data processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101488141B (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102522043A (en) * | 2011-12-12 | 2012-06-27 | 光庭导航数据（武汉）有限公司 | Polygon compression method based on topological relation of line segments |
| CN102141999B (en) * | 2010-02-02 | 2012-12-05 | 武汉大学 | Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes |
| CN103136767A (en) * | 2011-11-24 | 2013-06-05 | 北京图盟科技有限公司 | Vector diagram drawing method and device |
| WO2013155974A1 (en) * | 2012-04-18 | 2013-10-24 | Dong futian | Relevant method and device for compression, decompression and progressive transmission of spatial data |
| CN103500223A (en) * | 2013-10-17 | 2014-01-08 | 宁波工程学院 | Vector map data compression method for mobile users |
| CN103678588A (en) * | 2013-12-12 | 2014-03-26 | 中国神华能源股份有限公司 | Method and device for simplifying spatial data |
| CN104143288A (en) * | 2013-05-06 | 2014-11-12 | 北京四维图新科技股份有限公司 | Method and device for marking electronic map road display text |
| CN106528572A (en) * | 2015-09-14 | 2017-03-22 | 高德软件有限公司 | Method and device for processing line element data of electronic map |
| CN107194959A (en) * | 2017-04-25 | 2017-09-22 | 北京海致网聚信息技术有限公司 | The method and apparatus that image registration is carried out based on section |
| CN108007470A (en) * | 2017-11-30 | 2018-05-08 | 深圳市隐湖科技有限公司 | A kind of mobile robot map file format and path planning system and its method |
| CN108701139A (en) * | 2015-12-16 | 2018-10-23 | 谷歌有限责任公司 | Tile map is split to render |
| KR20190114465A (en) * | 2018-03-30 | 2019-10-10 | 정원빈 | Virtual area based contents management system |
| CN110704550A (en) * | 2018-06-21 | 2020-01-17 | 苏州中科蓝迪软件技术有限公司 | Method for efficiently extracting large-data-volume topological-free vector polygon common edges |
| CN110853489A (en) * | 2019-11-05 | 2020-02-28 | 中电建生态环境集团有限公司 | Water system basin basic data acquisition method and device |
| CN110992813A (en) * | 2019-12-25 | 2020-04-10 | 江苏徐工工程机械研究院有限公司 | Map creation method and system for unmanned surface mine system |
| CN115167554A (en) * | 2022-07-19 | 2022-10-11 | 珠海格力电器股份有限公司 | Cooking temperature curve processing method and device and computer equipment |
| CN115167553A (en) * | 2022-07-19 | 2022-10-11 | 珠海格力电器股份有限公司 | Cooking temperature curve processing method and device and computer equipment |
| CN116505953A (en) * | 2023-06-30 | 2023-07-28 | 湖南腾琨信息科技有限公司 | Mass map data optimization compression processing method based on BIM and GIS |
| CN115167554B (en) * | 2022-07-19 | 2024-05-10 | 珠海格力电器股份有限公司 | Cooking temperature curve processing method and device and computer equipment |
-
2008
- 2008-12-16 CN CN 200810243866 patent/CN101488141B/en active Active
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102141999B (en) * | 2010-02-02 | 2012-12-05 | 武汉大学 | Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes |
| CN103136767B (en) * | 2011-11-24 | 2016-08-17 | 北京图盟科技有限公司 | A kind of vectorgraph charting method and apparatus |
| CN103136767A (en) * | 2011-11-24 | 2013-06-05 | 北京图盟科技有限公司 | Vector diagram drawing method and device |
| CN102522043A (en) * | 2011-12-12 | 2012-06-27 | 光庭导航数据（武汉）有限公司 | Polygon compression method based on topological relation of line segments |
| WO2013155974A1 (en) * | 2012-04-18 | 2013-10-24 | Dong futian | Relevant method and device for compression, decompression and progressive transmission of spatial data |
| CN104143288A (en) * | 2013-05-06 | 2014-11-12 | 北京四维图新科技股份有限公司 | Method and device for marking electronic map road display text |
| CN104143288B (en) * | 2013-05-06 | 2016-08-17 | 北京四维图新科技股份有限公司 | The method and device that electronic map road display word is labeled |
| CN103500223B (en) * | 2013-10-17 | 2017-12-01 | 宁波工程学院 | A kind of vector map data compression method towards mobile subscriber |
| CN103500223A (en) * | 2013-10-17 | 2014-01-08 | 宁波工程学院 | Vector map data compression method for mobile users |
| CN103678588A (en) * | 2013-12-12 | 2014-03-26 | 中国神华能源股份有限公司 | Method and device for simplifying spatial data |
| CN106528572B (en) * | 2015-09-14 | 2019-08-20 | 高德软件有限公司 | A kind of electronic map line feature data processing method and device |
| CN106528572A (en) * | 2015-09-14 | 2017-03-22 | 高德软件有限公司 | Method and device for processing line element data of electronic map |
| CN108701139A (en) * | 2015-12-16 | 2018-10-23 | 谷歌有限责任公司 | Tile map is split to render |
| CN107194959A (en) * | 2017-04-25 | 2017-09-22 | 北京海致网聚信息技术有限公司 | The method and apparatus that image registration is carried out based on section |
| CN108007470A (en) * | 2017-11-30 | 2018-05-08 | 深圳市隐湖科技有限公司 | A kind of mobile robot map file format and path planning system and its method |
| KR20190114465A (en) * | 2018-03-30 | 2019-10-10 | 정원빈 | Virtual area based contents management system |
| CN110704550A (en) * | 2018-06-21 | 2020-01-17 | 苏州中科蓝迪软件技术有限公司 | Method for efficiently extracting large-data-volume topological-free vector polygon common edges |
| CN110704550B (en) * | 2018-06-21 | 2023-12-15 | 苏州中科天启遥感科技有限公司 | Method for efficiently extracting large-data-volume topology-vector-free polygonal public edges |
| CN110853489A (en) * | 2019-11-05 | 2020-02-28 | 中电建生态环境集团有限公司 | Water system basin basic data acquisition method and device |
| CN110853489B (en) * | 2019-11-05 | 2021-08-10 | 中电建生态环境集团有限公司 | Water system basin basic data acquisition method and device |
| CN110992813A (en) * | 2019-12-25 | 2020-04-10 | 江苏徐工工程机械研究院有限公司 | Map creation method and system for unmanned surface mine system |
| CN115167554A (en) * | 2022-07-19 | 2022-10-11 | 珠海格力电器股份有限公司 | Cooking temperature curve processing method and device and computer equipment |
| CN115167553A (en) * | 2022-07-19 | 2022-10-11 | 珠海格力电器股份有限公司 | Cooking temperature curve processing method and device and computer equipment |
| CN115167554B (en) * | 2022-07-19 | 2024-05-10 | 珠海格力电器股份有限公司 | Cooking temperature curve processing method and device and computer equipment |
| CN116505953A (en) * | 2023-06-30 | 2023-07-28 | 湖南腾琨信息科技有限公司 | Mass map data optimization compression processing method based on BIM and GIS |
| CN116505953B (en) * | 2023-06-30 | 2023-09-08 | 湖南腾琨信息科技有限公司 | Mass map data optimization compression processing method based on BIM and GIS |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101488141B (en) | 2011-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101488141B (en) | Electronic map data processing method | |
| CN107145577A (en) | Address standardization method, device, storage medium and computer | |
| US9730028B2 (en) | Systems and methods to identify home addresses of mobile devices | |
| CN108628811B (en) | Address text matching method and device | |
| CN106530170B (en) | Boundary optimization method for regional ecological protection red line | |
| CN107368471B (en) | Method for extracting place name address from webpage text | |
| CN111324679B (en) | Method, device and system for processing address information | |
| US20210217138A1 (en) | Vector Tile Pyramiding | |
| CN103488633B (en) | Network electronic map information processing method | |
| Tucci et al. | Using spatial analysis and geovisualization to reveal urban changes: Milan, Italy, 1737–2005 | |
| CN105528460A (en) | Establishing method of tile pyramid model and tile reading method | |
| CN109933797A (en) | Geocoding and system based on Jieba participle and address dictionary | |
| CN104599069B (en) | A kind of transmission line of electricity paths planning method based on envirment factor and geographical feature | |
| Maoh et al. | Exploring the land development process and its impact on urban form in Hamilton, Ontario | |
| CN109598056B (en) | Method and system for measuring urban construction land form compactness and storage medium | |
| CN105913347A (en) | House coding method orienting house information acquisition | |
| CN116860905B (en) | Space unit coding generation method of city information model | |
| Lipson et al. | Harmonized gap-filled datasets from 20 urban flux tower sites | |
| CN101561286A (en) | Trans-regional map data loading and displaying method | |
| CN104156475B (en) | Geography information read method and device | |
| CN110442669A (en) | A kind of whole scene determines the method and system of administrative zone position where positioning device | |
| CN115481212A (en) | Building space-time coding method considering logical building | |
| CN110147420A (en) | A kind of place name address matching querying method and system based on spectrum model | |
| CN115393368A (en) | Method, system, equipment and medium for identifying colony site selection environment mode based on meta-learning | |
| CN112733782B (en) | Urban functional area identification method based on road network, storage medium and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |