CN107239508A - One kind is used for geographical two-dimensional vector data abbreviation and transmission method - Google Patents
One kind is used for geographical two-dimensional vector data abbreviation and transmission method Download PDFInfo
- Publication number
- CN107239508A CN107239508A CN201710339391.3A CN201710339391A CN107239508A CN 107239508 A CN107239508 A CN 107239508A CN 201710339391 A CN201710339391 A CN 201710339391A CN 107239508 A CN107239508 A CN 107239508A
- Authority
- CN
- China
- Prior art keywords
- curve
- data
- monotonous
- max
- angle
- 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/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
- G06F16/56—Information retrieval; Database structures therefor; File system structures therefor of still image data having vectorial format
Abstract
The disclosure of the invention is a kind of to be used for geographical two-dimensional vector data abbreviation and transmission method, belongs to image processing field, particularly simplifies field in curve.First in remotely-sensed data, each image curve section is divided, each curve in image is set all to be split as monotonous curve, triangular apex is layered further according to three points adjacent in monotonous curve triangle area, the method that vertex data after to layering is intersected using curved section deletes noise spot, finally carry out the transmission for having sequencing, this avoid the curve that there is curve selfing in image processing process, the amount of calculation of image procossing is also calculated significantly, in transmitting procedure, the real-time display graph data that reciever also can be smooth.
Description
Technical field
The invention belongs to image processing field, particularly simplify field in curve.
Background technology
Curve data abbreviation is one of multiple dimensioned field core research contents of curve.Main task is that primitive curve is carried out
Abbreviation, to keep the original form of curve in the case of less data volume, realizes the network transmission of curve data.At present,
Many effective line simplification algorithms are there are, such as Visvalingam and Whyatt propose Visvalingam-
Whyatt algorithms.Basic Visvalingam-Whyatt algorithms are effectively line simplification algorithms, and it can have no to examine
It is gradual under conditions of feel to remove coordinate points, but easily there is self intersection, needs to build triangle repeatedly in the curve after abbreviation
Areal calculation is carried out, time complexity is big.Therefore, it is still a big research challenge to work out reliable and stable line simplification algorithm,
Its achievement in research has great practical value.
The content of the invention
, there is self intersection for curve after abbreviation and asks in the deficiency of the basic Visvalingam-Whyatt algorithms of present invention analysis
Primitive curve, is split as one or more monotonous curves by topic, then deletes interference monotonous curve using curve intersection algorithm, can
It is effectively prevented from curve self intersection；Using adjacent 2 points and itself build triangle area, curve can be kept well
Original form, time complexity is small.
Technical solution of the present invention is used for geographical two-dimensional vector data abbreviation and transmission method to be a kind of, and this method includes：
Step 1：Geography two is obtained using geographic information data acquisition method (sensoring, vector quantization, text message etc.)
N dimensional vector n data；
Step 2：One or more monotonous curve is split as to each bar primitive curve in the two-dimensional vector data of acquisition；
Step 3：Each bar monotonous curve is layered；
First choice, which is slided, chooses continuous three points in monotonous curve, and sliding step is 1 point, calculates 3 structures chosen
Into triangle area, the triangle of selection is divided into 2-7 layers by 2-7 area of setting interval according to the area interval of setting,
Area it is maximum for first layer, descending follow-up area is other layers；
Step 4：According to the layering result of step 3, the summit on each bar monotonous curve is saved as into corresponding 2-7 numbers respectively
According to bag, the summit of the first layer divided according to area saves as first order packet, is subsequently corresponding in turn to and saves as corresponding data bag；
Step 5：Judging the curve of the same level one data bag reduction for each monotonous curve that same primitive curve is split into is
No exist intersecting, if intersecting, deletes DBMS bag belonging to the shorter monotonous curve of length in intersecting monotonous curve；
Step 6：In data transmission procedure, by series of the remaining packet according to packet, since the first order according to
Secondary transmission.
Further, the method for each bar line segment being split as into monotonous curve in the step 2 is：
Step 2.1：Each point in curve is labeled as p1, p2, p3, p4, p5 ... successively；
Step 2.2：Vector p1p2 and vector p2p3 angle is calculated, the value of the angle is assigned in min and max two
Between data；
Step 2.3：Vector p1p2 and vector p3p4 angle is calculated, the angle is compared with min and max, if more than max
Max is then updated using the numeral of the angle, it is small and weak that min is then updated using the numeral of the angle in min, otherwise directly cast out；Such as
Fruit min and max, which exist, to be updated, then calculates the difference that max subtracts min, is calculated if the difference is less than 180 degree into step 2.4,
If the difference is more than or equal to 180 degree, curve blocks with regard to this, it is believed that the curve of point composition is monotonous curve above, into new
A curve calculating；
Step 2.4：Vector p1p2 and vector p4p5 angle is calculated, if the angle is compared with min and max more than max
Max is then updated using the numeral of the angle, it is small and weak that min is then updated using the numeral of the angle in min, otherwise directly cast out；Such as
Fruit min and max, which exist, to be updated, then calculates the difference that max subtracts min, is calculated if the difference is less than 180 degree into step 2.5,
If the difference is more than or equal to 180 degree, curve blocks with regard to this, it is believed that the curve of point composition is monotonous curve above, into new
A curve calculating；
Step 2.5,：Using the method follow-up point of calculated curve successively of above-mentioned steps 2.3- steps 2.4, until this is original
Curve terminates.
Further, the M DBMS bags for each monotonous curve that same primitive curve is split into are judged in the step 5
Middle group of data points into curve it is whether intersecting and delete the specific method of packet and be：
Step 5.1：Data point in 1~M DBMS bags of n articles of monotonous curve is taken out, n data point set is constituted；
Step 5.2：Judge that the line of any two data point in each data point set is concentrated with remainder data point successively to appoint
The line for two data points of anticipating is with the presence or absence of intersecting；
Step 5.3：The length of the single curve belonging to two intersecting data point sets is judged if in the presence of intersecting；
Step 5.4：Delete the M DBMS bags of the shorter monotonous curve of length.
It is of the invention a kind of to be used for geographical two-dimensional vector data abbreviation and transmission method, first in remotely-sensed data, each image
Curved section is divided, and each curve in image is all split as monotonous curve, further according to three structures adjacent in monotonous curve
The area of triangularity is layered to triangular apex, and vertex data after to layering uses the method that curved section intersects
Noise spot is deleted, the transmission for having sequencing is finally carried out, this avoid there is curve selfing in image processing process
Curve, also calculates the amount of calculation of image procossing significantly, in transmitting procedure, the real-time display figure number that reciever also can be smooth
According to.
Brief description of the drawings
Fig. 1 is monotonous curve schematic diagram.
Fig. 2 simplifies curve map for the present invention is a kind of for geographical two-dimensional vector data abbreviation and transmission method.
Fig. 3 simplifies comparison diagram for the present invention is a kind of for geographical two-dimensional vector data abbreviation and transmission method.
Fig. 4 simplifies Dependence Results figure for the present invention is a kind of for geographical two-dimensional vector data abbreviation and transmission method.
Embodiment
Monotonous curve refers to given straight line, makees vertical line by this curve and straight line, vertical line at most only has with curve
One intersection point.Such as Fig. 1, straight line v1v2 and the most intersection points of p1pn are moved left and right.The combination of monotonous curve and line segment intersection method
The problem of curve self intersection can effectively being solved.
Of the invention a kind of for geographical two-dimensional vector data abbreviation and transmission method, this method includes：
Step 1：Geographical two-dimensional vector data is obtained using geographical remote sensing device；
Step 2：One or more monotonous curve is split as to each bar primitive curve in the two-dimensional vector data of acquisition；
Step 2.1：Each point in curve is labeled as p1, p2, p3, p4, p5 ... successively；
Step 2.2：Vector p1p2 and vector p2p3 angle is calculated, the value of the angle is assigned in min and max two
Between data；
Step 2.3：Vector p1p2 and vector p3p4 angle is calculated, the angle is compared with min and max, if more than max
Max is then updated using the numeral of the angle, it is small and weak that min is then updated using the numeral of the angle in min, otherwise directly cast out；Such as
Fruit min and max, which exist, to be updated, then calculates the difference that max subtracts min, is calculated if the difference is less than 180 degree into step 2.4,
If the difference is more than or equal to 180 degree, curve blocks with regard to this, it is believed that the curve of point composition is monotonous curve above, into new
A curve calculating；
Step 2.4：Vector p1p2 and vector p4p5 angle is calculated, if the angle is compared with min and max more than max
Max is then updated using the numeral of the angle, it is small and weak that min is then updated using the numeral of the angle in min, otherwise directly cast out；Such as
Fruit min and max, which exist, to be updated, then calculates the difference that max subtracts min, is calculated if the difference is less than 180 degree into step 2.5,
If the difference is more than or equal to 180 degree, curve blocks with regard to this, it is believed that the curve of point composition is monotonous curve above, into new
A curve calculating；
Step 2.5,：Using the method follow-up point of calculated curve successively of above-mentioned steps 2.3- steps 2.4, until this is original
Curve terminates；
Step 3：Each bar monotonous curve is layered；
First choice, which is slided, chooses continuous three points in monotonous curve, and sliding step is 1 point, calculates 3 structures chosen
Into triangle area, the triangle of selection is divided into 2-7 layers by 2-7 area of setting interval according to the area interval of setting,
Area it is maximum for first layer, descending follow-up area is other layers；
Step 4：According to the layering result of step 3, the summit on each bar monotonous curve is saved as into corresponding 2-7 numbers respectively
According to bag, the summit of the first layer divided according to area saves as first order packet, is subsequently corresponding in turn to and saves as corresponding data bag
Step 5：Judging the curve of the same level one data bag reduction for each monotonous curve that same primitive curve is split into is
No exist intersecting, if intersecting, deletes DBMS bag belonging to the shorter monotonous curve of length in intersecting monotonous curve；
Step 5.1：Data point in 1~M DBMS bags of n articles of monotonous curve is taken out, n data point set is constituted；
Step 5.2：Judge that the line of any two data point in each data point set is concentrated with remainder data point successively to appoint
The line for two data points of anticipating is with the presence or absence of intersecting；
Step 5.3：The length of the single curve belonging to two intersecting data point sets is judged if in the presence of intersecting；
Step 5.4：Delete the M DBMS bags of the shorter monotonous curve of length；
Step 6：In data transmission procedure, by series of the remaining packet according to packet, since the first order according to
Secondary transmission.
Experiment effect is contrasted：Such as Fig. 3, figure (a) is the simple raw experimental data built in ArcGIS, and figure (b) is this
The improvement Visvalingam-Whyatt algorithms of invention simplify design sketch to figure (a).As can be seen from the figure Monotone Method is used
Visvalingam-Whyatt algorithms be good at it is enough good the problem of avoiding figure self intersection.
Such as Fig. 4, it is shown that the number after Visvalingam-Whyatt algorithms simplification of the land use data after improvement
According to the display renderings of five level of detail in some areas, from figure (a) to figure (e) it can be seen that the node of figure is in increase, details
Degree is in increase, and it is also more smooth that figure is shown.In addition to first layer, other layers transmission be increment node data.Work as user
During request data, rough data are first transmitted from server end, detail data is then transmitted again.
Claims (3)
1. one kind is used for geographical two-dimensional vector data abbreviation and transmission method, this method includes：
Step 1：Geographical two dimension arrow is obtained using geographic information data acquisition method (sensoring, vector quantization, text message etc.)
Measure data；
Step 2：One or more monotonous curve is split as to each bar primitive curve in the two-dimensional vector data of acquisition；
Step 3：Each bar monotonous curve is layered；
First choice, which is slided, chooses continuous three points in monotonous curve, and sliding step is 1 point, calculates what 3 points chosen were constituted
The area of triangle, 2-7 area of setting is interval, and the triangle of selection is divided into 2-7 layers, area according to the area interval of setting
It is maximum for first layer, descending follow-up area is other layers；
Step 4：According to the layering result of step 3, the summit on each bar monotonous curve is saved as into corresponding 2-7 data respectively
Bag, the summit of the first layer divided according to area saves as first order packet, is subsequently corresponding in turn to and saves as corresponding data bag；
Step 5：Judge whether the curve of the same level one data bag reduction for each monotonous curve that same primitive curve is split into is deposited
Intersecting, if intersecting, deleting DBMS bag belonging to the shorter monotonous curve of length in intersecting monotonous curve；
Step 6：In data transmission procedure, series of the remaining packet according to packet is passed successively since the first order
It is defeated.
2. it is as claimed in claim 1 a kind of for geographical two-dimensional vector data abbreviation and transmission method, it is characterised in that described
The method that each bar line segment is split as into monotonous curve in step 2 is：
Step 2.1：Each point in curve is labeled as p1, p2, p3, p4, p5 ... successively；
Step 2.2：Vector p1p2 and vector p2p3 angle is calculated, the value of the angle is assigned to two mediants of min and max
According to；
Step 2.3：Vector p1p2 and vector p3p4 angle is calculated, the angle is compared with min and max, is adopted if max is more than
Max is updated with the numeral of the angle, it is small and weak that min is then updated using the numeral of the angle in min, otherwise directly cast out；If min
Exist with max and update, then calculate the difference that max subtracts min, calculated if the difference is less than 180 degree into step 2.4, if should
Difference is more than or equal to 180 degree, then curve is blocked with regard to this, it is believed that the curve of point composition is monotonous curve above, into new one
The calculating of bar curve；
Step 2.4：Vector p1p2 and vector p4p5 angle is calculated, the angle is compared with min and max and adopted if max is more than
Max is updated with the numeral of the angle, it is small and weak that min is then updated using the numeral of the angle in min, otherwise directly cast out；If min
Exist with max and update, then calculate the difference that max subtracts min, calculated if the difference is less than 180 degree into step 2.5, if should
Difference is more than or equal to 180 degree, then curve is blocked with regard to this, it is believed that the curve of point composition is monotonous curve above, into new one
The calculating of bar curve；
Step 2.5,：Using the method follow-up point of calculated curve successively of above-mentioned steps 2.3- steps 2.4, until the primitive curve
Terminate.
3. it is as claimed in claim 1 a kind of for geographical two-dimensional vector data abbreviation and transmission method, it is characterised in that described
Judge in step 5 group of data points in the M DBMS bags for each monotonous curve that same primitive curve is split into curve be
Specific method that is no intersecting and deleting packet is：
Step 5.1：Data point in 1~M DBMS bags of n articles of monotonous curve is taken out, n data point set is constituted；
Step 5.2：The line and remainder data point for judging any two data point in each data point set successively concentrate any two
The line of data point is with the presence or absence of intersecting；
Step 5.3：The length of the single curve belonging to two intersecting data point sets is judged if in the presence of intersecting；
Step 5.4：Delete the M DBMS bags of the shorter monotonous curve of length.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710339391.3A CN107239508A (en) | 2017-05-15 | 2017-05-15 | One kind is used for geographical two-dimensional vector data abbreviation and transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710339391.3A CN107239508A (en) | 2017-05-15 | 2017-05-15 | One kind is used for geographical two-dimensional vector data abbreviation and transmission method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107239508A true CN107239508A (en) | 2017-10-10 |
Family
ID=59985087
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710339391.3A Pending CN107239508A (en) | 2017-05-15 | 2017-05-15 | One kind is used for geographical two-dimensional vector data abbreviation and transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107239508A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109949236A (en) * | 2019-03-05 | 2019-06-28 | 深圳市科利德光电材料股份有限公司 | Self intersection figure digestion procedure, terminal device and computer readable storage medium |
| CN113487666A (en) * | 2021-09-08 | 2021-10-08 | 亿景智联(北京)科技有限公司 | Intersection method and device of polygonal chain |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102237010A (en) * | 2011-07-28 | 2011-11-09 | 中国测绘科学研究院 | Annotation method for complicated linear elements |
| CN102609898A (en) * | 2012-02-09 | 2012-07-25 | 武汉大学 | Method for simplifying shoreline of drowned valley by taking geographical features into account |
| CN102663958A (en) * | 2012-03-23 | 2012-09-12 | 北京师范大学 | Method for rapidly integrating large-scale vector maps under the condition of considering topology relation |
| CN103646158A (en) * | 2013-08-30 | 2014-03-19 | 大连海事大学 | Automatic radar simulated data simplifying method for simulation of marine simulator |
-
2017
- 2017-05-15 CN CN201710339391.3A patent/CN107239508A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102237010A (en) * | 2011-07-28 | 2011-11-09 | 中国测绘科学研究院 | Annotation method for complicated linear elements |
| CN102609898A (en) * | 2012-02-09 | 2012-07-25 | 武汉大学 | Method for simplifying shoreline of drowned valley by taking geographical features into account |
| CN102663958A (en) * | 2012-03-23 | 2012-09-12 | 北京师范大学 | Method for rapidly integrating large-scale vector maps under the condition of considering topology relation |
| CN103646158A (en) * | 2013-08-30 | 2014-03-19 | 大连海事大学 | Automatic radar simulated data simplifying method for simulation of marine simulator |
Non-Patent Citations (1)
| Title |
|---|
| SHENGLI WANG等: "《Progressive Network Transmission Method Research of Vector Data》", 《 GEO-SPATIAL KNOWLEDGE AND INTELLIGENCE. GRMSE 2016. COMMUNICATIONS IN COMPUTER AND INFORMATION SCIENCE》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109949236A (en) * | 2019-03-05 | 2019-06-28 | 深圳市科利德光电材料股份有限公司 | Self intersection figure digestion procedure, terminal device and computer readable storage medium |
| CN113487666A (en) * | 2021-09-08 | 2021-10-08 | 亿景智联(北京)科技有限公司 | Intersection method and device of polygonal chain |
| CN113487666B (en) * | 2021-09-08 | 2021-11-23 | 亿景智联(北京)科技有限公司 | Intersection method and device of polygonal chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104282221B (en) | A kind of method for the road network for building indoor map | |
| CN106780736A (en) | Map data processing method and device, three-dimensional map generation method and device | |
| CN105303590B (en) | The method of the Block Model cutting generation two-dimensional cross section with attribute three-dimensional ore body | |
| CN107610131A (en) | A kind of image cropping method and image cropping device | |
| MY149288A (en) | Method, system, and computer-readable medium for creating and laying out a graphic within an application program | |
| CN107239508A (en) | One kind is used for geographical two-dimensional vector data abbreviation and transmission method | |
| CN107886564A (en) | The method shown for realizing three-dimensional scenic | |
| CN107291874A (en) | Point map position polymerization and device | |
| US20160078650A1 (en) | Drawing data generation device and drawing device | |
| CN108229740A (en) | A kind of determining method, apparatus, server and the storage medium on commercial circle boundary | |
| CN102903134A (en) | Method for rapidly drawing curves multiple times | |
| CN105528248A (en) | Crowd sensing incentive mechanisms for multitask cooperative application | |
| CN106919733A (en) | Distributed conflict and occlusion | |
| CN108572999A (en) | The searching method and device of interest face AOI profiles | |
| CN111488527B (en) | Position recommendation method and device, electronic equipment and computer-readable storage medium | |
| CN107240153A (en) | Unmanned plane during flying safety zone based on DSM calculates display methods | |
| CN107545833A (en) | A kind of road method for drafting and device | |
| CN106204719B (en) | Magnanimity model real-time scheduling method in three-dimensional scenic based on two-dimensional neighbourhood retrieval | |
| CN110123208A (en) | A kind of method and robot controlling robot cleaner | |
| CN106294484B (en) | A kind of method and device updating electronic map data | |
| CN108627170A (en) | A kind of path optimization's visualization method | |
| CN109657022B (en) | Merchant searching method and device, electronic equipment and storage medium | |
| CN105721544A (en) | Inter-vehicle information sharing method and device based on contents | |
| CN101546438B (en) | Superposing analysis method of a plurality of region topology layers based on restricting Delaunay triangulation network technique | |
| CN107169080A (en) | A kind of geospatial analysis system being combined based on GIS and spatial database |
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: 20171010 |