CN112486928A - Data compression method and device and terminal - Google Patents
Data compression method and device and terminal Download PDFInfo
- Publication number
- CN112486928A CN112486928A CN202011343901.2A CN202011343901A CN112486928A CN 112486928 A CN112486928 A CN 112486928A CN 202011343901 A CN202011343901 A CN 202011343901A CN 112486928 A CN112486928 A CN 112486928A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- points
- included angle
- distance
- 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
- 238000013144 data compression Methods 0.000 title claims abstract description 48
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000004590 computer program Methods 0.000 claims description 3
- 230000007547 defect Effects 0.000 abstract description 3
- 238000007906 compression Methods 0.000 description 6
- 230000006835 compression Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000004888 barrier function Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
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/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/174—Redundancy elimination performed by the file system
- G06F16/1744—Redundancy elimination performed by the file system using compression, e.g. sparse files
-
- 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
-
- 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/51—Indexing; Data structures therefor; Storage structures
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Remote Sensing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The application relates to a data compression method, a device and a terminal, wherein the data compression method comprises the steps of obtaining a data node in fence data and a left node and a right node which are adjacent to the data node; respectively connecting the data node with the left node and the right node to form a line segment included angle taking the data node as a vertex, and judging whether the included angle is smaller than a preset angle limit difference; when the included angle is smaller than the preset angle limit difference, a left node is made into a fan shape, and whether a data node falls in the fan shape or not is judged; and if so, deleting the data node. The method and the device can make up the defect that the traditional James algorithm is used for data compression, particularly, the electronic map fence data is more effectively compressed, and the situation of the compressed graphic distortion is effectively improved.
Description
Technical Field
The application belongs to the technical field of data processing, and particularly relates to a data compression method, a data compression device and a terminal.
Background
As digital maps become more widely used, more and more pressure is placed on data storage, and demands for geographic data processing capability and data transmission capability are more rapid. And the internal storage modes of the digital map are mainly divided into two types of barriers and vector data. The data storage compression aiming at the vector is to extract a subset from a data set, the subset is required to be as small as possible and not lose accuracy to a certain extent, in the related technology, a James algorithm is used for data compression, the basic idea of the James algorithm is to sequentially calculate an included angle formed by each point and a front point and a rear point on a fence, if the included angles a1 and a2 exceed a boundary included angle J, the current node is reserved, and otherwise, the data of the fence node is discarded. The James algorithm determines the trade-off of the nodes through three adjacent points each time, so that the data compression efficiency is high, but the situation that the whole fence is distorted due to continuous small-angle change of local features is considered.
Disclosure of Invention
In order to overcome the problem that in the related art, data compression is performed by using a James algorithm, and only the situation that the overall fence distortion may occur due to continuous small-angle changes of local features is considered, the application provides a data compression method, a data compression device and a data compression terminal.
In a first aspect, the present application provides a data compression method, including:
acquiring a data node in the fence data and a left node and a right node adjacent to the data node;
respectively connecting the data node with the left node and the right node to form a line segment included angle with the data node as a vertex, and judging whether the included angle is smaller than a preset angle limit difference;
when the included angle is smaller than a preset angle limit difference, judging whether the data node falls in the fan shape or not by making the left node into the fan shape;
and if so, deleting the data node.
Further, making a sector by the left node includes:
connecting the left node and the data node, and making a vertical line through the data node;
two intersection points are taken on the vertical line, so that line segments formed by the two intersection points and the data nodes are equal;
and making a fan shape through the left node and the two intersection points.
Further, the taking two intersection points on the vertical line to make the two intersection points equal to a line segment formed by the data node includes:
and presetting a distance limit difference, and taking two intersection points on the vertical line according to the distance limit difference to enable the two intersection points to be formed, so that the length values of two line segments formed by the two intersection points and the data nodes are equal to the distance limit difference.
Further, the method also comprises the following steps:
and when the included angle is not smaller than a preset angle tolerance, reserving the data node as a characteristic point.
Further, after the data node is reserved as a feature point, the method further includes:
traversing all data nodes in the data fence to acquire all feature points in the data fence;
calculating the distance values between the characteristic points and the adjacent characteristic points respectively;
judging whether the maximum distance in the distance values is larger than a preset distance limit difference or not;
and if so, connecting the feature point with the adjacent feature point corresponding to the maximum distance.
Further, the calculating distance values between the feature points and the adjacent feature points respectively includes:
presetting a node number limit difference;
taking the feature points as head nodes, and taking the feature points with the distance from the feature points to the preset node number limit difference as tail nodes;
connecting the head node and the tail node to obtain a node line segment;
and respectively making a vertical line segment to the node line segment through the feature points between the head node and the tail node, wherein the vertical line segment is used for calculating the distance value between each feature point and the adjacent feature point.
Further, the method also comprises the following steps:
and deleting the adjacent characteristic points when the maximum distance is smaller than a preset distance tolerance.
Further, the method also comprises the following steps:
and traversing all the characteristic points in the data fence, and deleting redundant data points to realize data compression in the data fence.
In a second aspect, the present application provides a data compression apparatus comprising:
the system comprises an acquisition module, a data processing module and a data processing module, wherein the acquisition module is used for acquiring a data node in the fence data and a left node and a right node which are adjacent to the data node;
the line segment included angle judging module is used for respectively connecting the data node with the left node and the right node to form a line segment included angle with the data node as a vertex, and judging whether the included angle is smaller than a preset angle limit difference or not;
the fan-shaped judging module is used for judging whether the data node falls in the fan shape or not by making the fan shape through the left node when the included angle is smaller than the preset angle tolerance;
and the deleting module is used for deleting the data node when the data node is in the sector.
In a third aspect, the present application provides a terminal, comprising:
a processor and a memory;
the processor is adapted to execute a computer program stored in the memory to implement the data compression method as described in any of the first aspects.
The technical scheme provided by the embodiment of the application can have the following beneficial effects:
the data compression method comprises the steps of obtaining a data node in fence data and a left node and a right node which are adjacent to the data node, respectively connecting the data node with the left node and the right node to form a line segment included angle which takes the data node as a vertex, judging whether the included angle is smaller than a preset angle limit difference, judging whether the data node falls in a fan shape or not by making the left node into the fan shape when the included angle is smaller than the preset angle limit difference, and deleting the data node if the included angle is smaller than the preset angle limit difference.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.
Fig. 1 is a flowchart of a data compression method according to an embodiment of the present application.
Fig. 2 is a flowchart of a data compression method according to another embodiment of the present application.
Fig. 3 is a flowchart of a data compression method according to another embodiment of the present application.
Fig. 4 is a schematic diagram illustrating a data compression method according to an embodiment of the present application.
Fig. 5 is a schematic diagram illustrating a data compression method according to another embodiment of the present application.
Fig. 6 is a functional block diagram of a data compression apparatus according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail below. It is to be understood that the embodiments described are only a few embodiments of the present application and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the examples given herein without making any creative effort, shall fall within the protection scope of the present application.
Fig. 1 is a flowchart of a data compression method according to an embodiment of the present application, and as shown in fig. 1, the data compression method includes:
s11: acquiring a data node in the fence data and a left node and a right node adjacent to the data node;
s12: respectively connecting the data node with the left node and the right node to form a line segment included angle taking the data node as a vertex, and judging whether the included angle is smaller than a preset angle limit difference;
s13: when the included angle is smaller than the preset angle limit difference, the left node is made into a fan shape, and whether the data node falls in the fan shape or not is judged;
s14: and if so, deleting the data node.
In some embodiments, further comprising:
and when the included angle is not less than the preset angle tolerance, keeping the data node as a characteristic point.
As shown in fig. 4, a1 and a2 are line segment angles respectively, an angle between a p1p2 and a p2p3 is obtained, if the angle a2> J (angle tolerance), a p2 point is reserved, and p2 is marked as a characteristic point.
And sequentially traversing all data nodes in the fence data so as to obtain all feature points in the fence data.
The data compression is carried out by using a James algorithm, the basic idea of the James algorithm is to sequentially calculate an included angle formed by each point and a front point and a rear point on a fence, if the included angles a1 and a2 exceed a boundary included angle J, the current node is reserved, and otherwise, the data node of the fence is omitted. The James algorithm determines the node trade-off through three adjacent points at a time, only local features are considered, and the situation of overall fence distortion may occur if continuous small-angle changes occur.
In the embodiment, a data node in the fence data and a left node and a right node adjacent to the data node are obtained, the data node is respectively connected with the left node and the right node to form a line segment included angle with the data node as a vertex, whether the included angle is smaller than a preset angle limit difference or not is judged, when the included angle is smaller than the preset angle limit difference, the left node is in a fan shape, whether the data node falls in the fan shape or not is judged, if yes, the data node is deleted, the defect that data compression is carried out by a traditional James algorithm can be overcome, especially, compression processing on the fence data of the electronic map is more effective, and the distortion condition of the compressed graph is effectively improved.
An embodiment of the present application provides another data compression method, as shown in a flowchart in fig. 2, where the data compression method includes:
s21: connecting the left node and the data node, and making a vertical line through the data node;
s22: two intersection points are taken on the vertical line, so that the two intersection points are equal to the line segment formed by the data nodes;
in some embodiments, taking two intersections on a vertical line such that the two intersections are equal to the line segment formed by the data nodes comprises:
and presetting a distance limit difference, and taking two intersection points on the vertical line according to the distance limit difference to enable the two intersection points to be formed, so that the length values of two line segments formed by the two intersection points and the data nodes are equal to the distance limit difference.
S23: and making a fan shape through the left node and the two intersection points.
If a2< J (angle tolerance), connecting p1 and p2, making a vertical line through p2, taking two points q1 and q2 on the vertical line so that q1p2 is q2p2 is G (distance tolerance), intersecting the vertical line with a sector (an initialized sector is formed by p1q1 and q2p 1) to form points b1 and b2, judging whether the point q1 or the point q2 falls in the sector, if so, replacing the point q1 or the point q2 with b1 or b2 to form a new sector formed by the points p1, b1 and b2, and deleting the point p2, otherwise, continuing to judge a subsequent data node.
If pi +1 (subsequent node) is in the sector, then the pi point is discarded; then, the pi-1 point and the pi +1 point are connected, and the pi-1 point is regarded as the pi point. If pi +1 is not within the sector at this time, the pi point is retained.
In the embodiment, the sector judgment is continued after the judgment of the line segment included angle, so that the problem that the overall fence distortion condition is possibly caused due to continuous small-angle change is avoided, the compression effect is improved, and the compressed graph distortion condition is effectively improved.
Fig. 3 is a flowchart of a data compression method according to another embodiment of the present application, and as shown in fig. 3, the data compression method includes:
s31: traversing all data nodes in the data fence to acquire all feature points in the data fence;
s32: calculating the distance values between the characteristic points and the adjacent characteristic points respectively;
in some embodiments, as shown in fig. 5, calculating the distance values between the feature points and the adjacent feature points respectively includes:
s321: presetting a node number limit difference;
s322: taking the characteristic points as head nodes, and taking the characteristic points with preset node number limit difference from the characteristic points as tail nodes;
s323: connecting the head node and the tail node to obtain a node line segment;
s324: and respectively making a vertical line segment from the node line segment through the characteristic points between the head node and the tail node, wherein the vertical line segment is a distance value between the calculated characteristic points and the adjacent characteristic points.
S33: judging whether the maximum distance in the distance values is larger than a preset distance limit difference or not;
s34: if yes, connecting the feature point with the adjacent feature point corresponding to the maximum distance.
S35: and when the maximum distance is smaller than the preset distance tolerance, deleting the adjacent characteristic points.
S36: and traversing all the characteristic points in the data fence, and deleting the redundant data points to realize data compression in the data fence.
In this embodiment, the feature points are further filtered by calculating the distance values between the feature points and the adjacent feature points, so as to further improve the compression effect.
Fig. 6 is a functional block diagram of a data compression apparatus according to an embodiment of the present application, and as shown in fig. 6, the data compression apparatus includes:
the acquisition module 61 is configured to acquire one data node in the fence data and a left node and a right node adjacent to the data node;
a line segment included angle judging module 62, configured to connect the data node with the left node and the right node respectively to form a line segment included angle with the data node as a vertex, and judge whether the included angle is smaller than a preset angle tolerance;
the sector judging module 63 is configured to judge whether the data node falls in a sector or not by making a sector by the left node when the included angle is smaller than the preset angle tolerance;
and a deleting module 64, configured to delete the data node when the data node falls within the sector.
In some embodiments, the distance determining module 65 is further included for calculating distance values between the feature points and the adjacent feature points, determining whether the maximum distance among the distance values is greater than a preset distance tolerance, and determining whether to delete the adjacent feature points according to the determination result.
In the embodiment, a data node in the fence data and a left node and a right node adjacent to the data node are obtained through the obtaining module, the line segment included angle judging module is respectively connected with the data node and the left node and the right node to form a line segment included angle taking the data node as a vertex, whether the included angle is smaller than a preset angle limit difference is judged, the fan-shaped judging module makes a fan shape through the left node when the included angle is smaller than the preset angle limit difference, whether the data node falls in the fan shape is judged, and the data node is deleted when the data node falls in the fan shape by the deleting module, so that the defect that a traditional James algorithm carries out data compression can be overcome, especially, the compression processing on the electronic fence data is more effective, and the situation of graph distortion after compression is effectively improved.
The present embodiment provides a terminal, including:
a processor and a memory;
the processor is adapted to execute a computer program stored in the memory to implement the data compression method as described in any of the above embodiments.
It is understood that the same or similar parts in the above embodiments may be mutually referred to, and the same or similar parts in other embodiments may be referred to for the content which is not described in detail in some embodiments.
It should be noted that, in the description of the present application, the terms "first", "second", etc. are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. Further, in the description of the present application, the meaning of "a plurality" means at least two unless otherwise specified.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and the scope of the preferred embodiments of the present application includes other implementations in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present application.
It should be understood that portions of the present application may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present application may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.
In the description herein, reference to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the application. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
Although embodiments of the present application have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present application, and that variations, modifications, substitutions and alterations may be made to the above embodiments by those of ordinary skill in the art within the scope of the present application.
It should be noted that the present invention is not limited to the above-mentioned preferred embodiments, and those skilled in the art can obtain other products in various forms without departing from the spirit of the present invention, but any changes in shape or structure can be made within the scope of the present invention with the same or similar technical solutions as those of the present invention.
Claims (10)
1. A method of data compression, comprising:
acquiring a data node in the fence data and a left node and a right node adjacent to the data node;
respectively connecting the data node with the left node and the right node to form a line segment included angle with the data node as a vertex, and judging whether the included angle is smaller than a preset angle limit difference;
when the included angle is smaller than a preset angle limit difference, judging whether the data node falls in the fan shape or not by making the left node into the fan shape;
and if so, deleting the data node.
2. The data compression method of claim 1, wherein the fanning by the left node comprises:
connecting the left node and the data node, and making a vertical line through the data node;
two intersection points are taken on the vertical line, so that line segments formed by the two intersection points and the data nodes are equal;
and making a fan shape through the left node and the two intersection points.
3. The data compression method of claim 2, wherein taking two intersections on the vertical line such that the two intersections are equal to a line segment formed by the data node comprises:
and presetting a distance limit difference, and taking two intersection points on the vertical line according to the distance limit difference to enable the two intersection points to be formed, so that the length values of two line segments formed by the two intersection points and the data nodes are equal to the distance limit difference.
4. The data compression method of claim 3, further comprising:
and when the included angle is not smaller than a preset angle tolerance, reserving the data node as a characteristic point.
5. The data compression method according to claim 4, wherein after the retaining the data node as the feature point, further comprising:
traversing all data nodes in the data fence to acquire all feature points in the data fence;
calculating the distance values between the characteristic points and the adjacent characteristic points respectively;
judging whether the maximum distance in the distance values is larger than a preset distance limit difference or not;
and if so, connecting the feature point with the adjacent feature point corresponding to the maximum distance.
6. The data compression method according to claim 5, wherein the calculating distance values between the feature points and adjacent feature points comprises:
presetting a node number limit difference;
taking the feature points as head nodes, and taking the feature points with the distance from the feature points to the preset node number limit difference as tail nodes;
connecting the head node and the tail node to obtain a node line segment;
and respectively making a vertical line segment to the node line segment through the feature points between the head node and the tail node, wherein the vertical line segment is used for calculating the distance value between each feature point and the adjacent feature point.
7. The data compression method of claim 5, further comprising:
and deleting the adjacent characteristic points when the maximum distance is smaller than a preset distance tolerance.
8. The data compression method of claim 6, further comprising:
and traversing all the characteristic points in the data fence, and deleting redundant data points to realize data compression in the data fence.
9. A data compression apparatus, comprising:
the system comprises an acquisition module, a data processing module and a data processing module, wherein the acquisition module is used for acquiring a data node in the fence data and a left node and a right node which are adjacent to the data node;
the line segment included angle judging module is used for respectively connecting the data node with the left node and the right node to form a line segment included angle with the data node as a vertex, and judging whether the included angle is smaller than a preset angle limit difference or not;
the fan-shaped judging module is used for judging whether the data node falls in the fan shape or not by making the fan shape through the left node when the included angle is smaller than the preset angle tolerance;
and the deleting module is used for deleting the data node when the data node is in the sector.
10. A terminal, comprising:
a processor and a memory;
the processor is configured to execute a computer program stored in the memory to implement the data compression method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011343901.2A CN112486928A (en) | 2020-11-25 | 2020-11-25 | Data compression method and device and terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011343901.2A CN112486928A (en) | 2020-11-25 | 2020-11-25 | Data compression method and device and terminal |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112486928A true CN112486928A (en) | 2021-03-12 |
Family
ID=74934749
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011343901.2A Pending CN112486928A (en) | 2020-11-25 | 2020-11-25 | Data compression method and device and terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112486928A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113688108A (en) * | 2021-07-16 | 2021-11-23 | 深圳智慧林网络科技有限公司 | Data processing method and related equipment |
| CN114281915A (en) * | 2021-12-22 | 2022-04-05 | 广州小鹏自动驾驶科技有限公司 | Method, device and equipment for generating geometric road network and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107742313A (en) * | 2017-09-26 | 2018-02-27 | 华勤通讯技术有限公司 | A kind of data compression method and equipment applied to vector space |
| US20200120171A1 (en) * | 2017-08-14 | 2020-04-16 | Beijing Sankuai Online Technology Co., Ltd. | Node processing |
-
2020
- 2020-11-25 CN CN202011343901.2A patent/CN112486928A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200120171A1 (en) * | 2017-08-14 | 2020-04-16 | Beijing Sankuai Online Technology Co., Ltd. | Node processing |
| CN107742313A (en) * | 2017-09-26 | 2018-02-27 | 华勤通讯技术有限公司 | A kind of data compression method and equipment applied to vector space |
Non-Patent Citations (2)
| Title |
|---|
| 刘晓红, 李树军: "矢量数据压缩的角度分段道格拉斯算法研究", 四川测绘, no. 02, 25 July 2005 (2005-07-25), pages 51 - 52 * |
| 徐新;: "增强型矢量数据压缩算法的设计与实现", 计算机应用研究, no. 12, 15 December 2007 (2007-12-15), pages 394 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113688108A (en) * | 2021-07-16 | 2021-11-23 | 深圳智慧林网络科技有限公司 | Data processing method and related equipment |
| CN114281915A (en) * | 2021-12-22 | 2022-04-05 | 广州小鹏自动驾驶科技有限公司 | Method, device and equipment for generating geometric road network and storage medium |
| CN114281915B (en) * | 2021-12-22 | 2022-10-14 | 广州小鹏自动驾驶科技有限公司 | Method, device and equipment for generating geometric road network and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112486928A (en) | Data compression method and device and terminal | |
| CN110598541A (en) | Method and equipment for extracting road edge information | |
| CN111696059B (en) | Lane line smooth connection processing method and device | |
| CN112686972B (en) | Air pressure contour drawing method and device, electronic equipment and storage medium | |
| CN112733318B (en) | Adaptive grid subdivision method, device, equipment and storage medium | |
| CN108765445B (en) | Lung trachea segmentation method and device | |
| CN113936114B (en) | BIM model component class-level lightweight method and system | |
| CN116071519A (en) | Image processing method and device for generating grid model based on harmonic mapping | |
| CN116091771A (en) | Method, device and equipment for partitioning point cloud of cavity of complex casing | |
| CN117274535B (en) | Method and device for reconstructing live-action three-dimensional model based on point cloud density and electronic equipment | |
| CN114708400A (en) | Three-dimensional laser noise reduction method and device, medium and robot | |
| CN117372552B (en) | Three-dimensional point cloud data compression method of industrial product facing complex surface | |
| CN112395516B (en) | Spatial region analysis processing method, device, equipment and storage medium | |
| CN113378748A (en) | Target detection method based on improved algorithm | |
| CN112070792B (en) | Edge growth connection method and device for image segmentation | |
| CN113822768B (en) | Method, device, equipment and storage medium for processing community network | |
| CN116067359A (en) | Low-precision track data processing method and system based on delaunay triangle network | |
| CN113469907B (en) | Data simplification method and system based on blade profile characteristics | |
| CN115662267A (en) | Map simplifying method, map simplifying device, storage medium and equipment | |
| CN115661852A (en) | Map segmentation method, map segmentation device, computer-readable storage medium and processor | |
| CN102945571A (en) | Void filling method and system based on surface data | |
| CN112233153A (en) | Image matching method and device, electronic equipment and storage medium | |
| CN117455936B (en) | Point cloud data processing method and device and electronic equipment | |
| CN110704561A (en) | Map edge pasting method, terminal device and storage medium | |
| CN117710717B (en) | Super-body clustering point cloud segmentation method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |