CN111506695B - Coordinate direction identification method and system during GPX data processing into surface data - Google Patents
Coordinate direction identification method and system during GPX data processing into surface data Download PDFInfo
- Publication number
- CN111506695B CN111506695B CN202010328503.7A CN202010328503A CN111506695B CN 111506695 B CN111506695 B CN 111506695B CN 202010328503 A CN202010328503 A CN 202010328503A CN 111506695 B CN111506695 B CN 111506695B
- Authority
- CN
- China
- Prior art keywords
- vertex
- database
- data
- module
- coordinate
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Abstract
The invention provides a method and a system for identifying coordinate directions when GPX data is processed into surface data, wherein the method comprises the following steps: the device comprises a surface data conversion module, a storage module, a first searching module, a judging module, a second searching module, a marking module, a positioning module, an included angle calculating module, a polygon coordinate direction identifying module and a surface data coordinate direction identifying module. The method can simply, quickly and accurately identify the coordinate direction of the GPX data processed into the surface data, thereby simplifying the complexity and the cost of system configuration and improving the efficiency of data processing. The coordinate direction identification method and system for GPX data processing into surface data can be used for processing information of air route data and the like in a geographic information system.
Description
Technical Field
The invention belongs to the technical field of GPX data processing, and particularly relates to a coordinate direction identification method and system when GPX data are processed into surface data.
Background
GPX is a short hand for GPS data exchange format, and is a relatively small XML (EXtensible Markup Language) data format, including GPS information such as waypoint coordinates, which can be transmitted over a network and supports network services.
After obtaining the GPX route data, the GPX route data is generally required to be generated into surface data in order to be applied to applications such as Google Earth (three-dimensional Earth), mapSource (garmin navigator tool software), and the like. The GPX plane data is composed of two-dimensional coordinates of a plurality of waypoints. In geographic information processing such as image detection, it is often necessary to identify the coordinate direction of surface data, however, the conventional method for identifying the coordinate direction of surface data generally has a problem of complicated identification process.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a coordinate direction identification method and system when GPX data is processed into surface data, which can effectively solve the problems.
The technical scheme adopted by the invention is as follows:
the invention provides a coordinate direction identification method when GPX data is processed into surface data, which comprises the following steps:
step 1, converting GPX data into surface data; wherein the face data comprises a plurality of vertices, each vertex having two-dimensional x y coordinates; storing the two-dimensional coordinates of each vertex into a database according to the track direction;
assuming that there are n vertexes, sequentially P according to the track direction 1 (x 1 ,y 1 ),P 2 (x 2 ,y 2 ),…,P n (x n ,y n )；
Step 2, traversing n vertexes in the database, and finding all vertexes with the maximum y value of the ordinate;
step 3, judging whether only one vertex with the maximum y value exists, if so, marking the vertex with the maximum y value as P A (x A ,y A ) Then, step 5 is executed; wherein, A belongs to (1,2, …, n); if not, executing step 4;
step 4, finding the vertex with the minimum x value of the abscissa in each vertex with the maximum y value, and recording the found vertex as P A (x A ,y A ) Then, step 5 is executed;
step 5, marking a vertex P in an xy coordinate system A Then, at the vertex P A Marking an auxiliary point P directly above D (x A ,y A + m); wherein m is any number greater than 0;
step 6, positioning to a vertex P in the database A Then, find the vertex P A The previous adjacent vertex P B (x B ,y B ) And the next adjacent vertex P C (x C ,y C )；
Wherein:
if A =1, the vertex P B For a vertex P in the database n (x n ,y n ) Vertex P C For a vertex P in a database 2 (x 2 ,y 2 )；
If A = n, the vertex P B For a vertex P in a database n-1 (x n-1 ,y n-1 ) Vertex P C For a vertex P in a database 1 (x 1 ,y 1 )；
If A =2,3, …, n-1, the vertex P B For a vertex P in a database A-1 (x A-1 ,y A-1 ) Vertex P C For a vertex P in a database A+1 (x A+1 ,y A+1 )；
Step 7, calculating the vector P A P D To vector P A P B An included angle E1 in the clockwise direction; calculating a vector P A P D To P A P C An angle E2 in the clockwise direction;
step 8, judging whether the included angle E1 is larger than the included angle E2, if so, determining that the included angle is larger than the included angle E2 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is clockwise; otherwise, determine by vertex P 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is anticlockwise;
step 9, when the polygon coordinate direction identified in the step 8 is clockwise, indicating that the coordinate direction when the GPX data is processed into the surface data is clockwise; when the coordinate direction of the polygon identified in step 8 is counterclockwise, it indicates that the coordinate direction when the GPX data is processed into the surface data is counterclockwise.
Preferably, the values of angle E1 and angle E2 are calculated using the atan2 function.
The invention also provides a system based on the coordinate direction identification method when GPX data is processed into surface data, which comprises the following steps:
the surface data conversion module is used for converting the GPX data into surface data; wherein the face data comprises a plurality of vertices, each vertex having two-dimensional x y coordinates;
the storage module is used for storing the two-dimensional coordinates of the vertexes into a database according to the track direction; assuming that there are n vertexes, in turn P in the track direction 1 (x 1 ,y 1 ),P 2 (x 2 ,y 2 ),…,P n (x n ,y n )；
The first searching module is used for traversing the n vertexes in the database and searching all vertexes with the maximum ordinate y value;
a judging module for judging whether there is only one vertex with the maximum y value searched by the first searching module, if so, recording the vertex with the maximum y value as P A (x A ,y A ) (ii) a Wherein, A belongs to (1,2, …, n); then executing the marking module; if not, executing a second searching module;
a second searching module for searching the vertex with the smallest x value of the abscissa in each vertex with the largest y value and recording the searched vertex as P A (x A ,y A ) Then executing the marking module;
a marking module for marking the vertex P in the xy coordinate system A Then, at the vertex P A Marking an auxiliary point P directly above D (x A ,y A + m); wherein m is any number greater than 0;
a positioning module for positioning to a vertex P in the database A Then, find the vertex P A The previous adjacent vertex P B (x B ,y B ) And the next adjacent vertex P C (x C ,y C )；
Wherein:
if A =1, the vertex P B For a vertex P in the database n (x n ,y n ) Vertex P C For a vertex P in the database 2 (x 2 ,y 2 )；
If A = n, the vertex P B For a vertex P in the database n-1 (x n-1 ,y n-1 ) Vertex P C For a vertex P in a database 1 (x 1 ,y 1 )；
If A =2,3, …, n-1, the vertex P B For a vertex P in a database A-1 (x A-1 ,y A-1 ) Vertex P C For a vertex P in a database A+1 (x A+1 ,y A+1 )；
An angle calculation module for calculating a vector P A P D To vector P A P B An included angle E1 in the clockwise direction; calculating a vector P A P D To P A P C An angle E2 in the clockwise direction;
a polygon coordinate direction identification module for judging whether the included angle E1 is larger than the included angle E2, if so, determining that the included angle is larger than the included angle, and determining that the included angle is larger than the included angle by the vertex P 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is clockwise; otherwise, determine by vertex P 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is anticlockwise;
the plane data coordinate direction identification module indicates that the coordinate direction of the GPX data processed into plane data is clockwise when the identified polygon coordinate direction is clockwise; when the identified polygon coordinate direction is counterclockwise, it indicates that the coordinate direction when the GPX data is processed into the surface data is counterclockwise.
The method and the system for identifying the coordinate direction when the GPX data is processed into the surface data have the following advantages:
the method can simply, quickly and accurately identify the coordinate direction of the GPX data processed into the surface data, thereby simplifying the complexity and the cost of system configuration and improving the efficiency of data processing. The coordinate direction identification method and system for GPX data processing into surface data can be used for processing information of air route data and the like in a geographic information system.
Drawings
Fig. 1 is a schematic flow chart of a coordinate direction identification method when GPX data provided by the present invention is processed into plane data.
Fig. 2 is a schematic diagram of a coordinate direction identification method when GPX data is processed into plane data according to the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantageous effects solved by the present invention more clearly apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and do not limit the invention.
The invention provides a coordinate direction identification method when GPX data is processed into surface data, which comprises the following steps with reference to figure 1:
step 1, converting GPX data into surface data; wherein the face data comprises a plurality of vertices, each vertex having two-dimensional x y coordinates; storing the two-dimensional coordinates of each vertex into a database according to the track direction;
assuming that there are n vertexes, sequentially P according to the track direction 1 (x 1 ,y 1 ),P 2 (x 2 ,y 2 ),…,P n (x n ,y n )；
Step 2, traversing n vertexes in the database, and finding all vertexes with the maximum y value of the ordinate;
step 3, judging whether only one vertex with the maximum y value exists, if so, marking the vertex with the maximum y value as P A (x A ,y A ) Then, step 5 is executed; wherein, A belongs to (1,2, …, n); if not, executing step 4;
step 4, finding the vertex with the minimum x value of the abscissa in each vertex with the maximum y value, and recording the found vertex as P A (x A ,y A ) Then, step 5 is executed;
the main principle of the steps 2 to 4 is as follows: if there is only one vertex with the largest ordinate y value, it can be determined that this vertex is necessarily a salient point of the polygon, and therefore the coordinate direction of the polygon can be identified by the method of the subsequent steps 7 to 9. And if the vertex is not a bump, it is not applicable to the subsequent steps 7 to 9. In addition, if there are a plurality of vertexes with the maximum y value of the ordinate, for example, there are three vertexes, K1, K2 and K3, respectively, the y values of the ordinate of K1, K2 and K3 are equal, and the vertex with the maximum y value in the database is the vertex; in this case, it is possible to determine without any doubt that the vertex with the smallest x-value abscissa is inevitably one convex point of the polygon. While for other vertices, e.g., the K2 vertex, it may not be a convex point of the polygon, e.g., if K1, K2, and K3 are adjacent vertices, then K2 is a point in the middle of the line segments K1-K3, which is not a convex point and is not suitable for the subsequent steps 7-9. Therefore, the invention can simply, quickly and accurately position one convex point of the polygon by the method.
Step 5, marking a vertex P in an xy coordinate system A Then, at the vertex P A Marking an auxiliary point P directly above D (x A ,y A + m); wherein m is any number greater than 0;
step 6, positioning to the vertex P in the database A Then, find the vertex P A The previous adjacent vertex P B (x B ,y B ) And the next adjacent vertex P C (x C ,y C )；
Wherein:
if A =1, the vertex P B For a vertex P in a database n (x n ,y n ) Vertex P C For a vertex P in a database 2 (x 2 ,y 2 )；
If A = n, the vertex P B For a vertex P in the database n-1 (x n-1 ,y n-1 ) Vertex P C For a vertex P in a database 1 (x 1 ,y 1 )；
If A =2,3, …, n-1, the vertex P B For a vertex P in the database A-1 (x A-1 ,y A-1 ) Vertex P C For a vertex P in a database A+1 (x A+1 ,y A+1 )；
Step 7, referring to FIG. 2, calculate vector P A P D To vector P A P B An included angle E1 in the clockwise direction; calculating a vector P A P D To P A P C An angle E2 in the clockwise direction; in practical applications, the values of the included angle E1 and the included angle E2 can be calculated by using atan2 function. Wherein atan2 is a function, the return in C language refers to azimuth, the function prototype of atan2 in C language is double atan2 (double y, double x), and the return is the inverse of y/x expressed in radianTangent. The sign of the values of y and x determines the correct quadrant. It is also understood to calculate the argument of the complex number x + yi. For example, P A P D To vector P A P B The angle E1 in the clockwise direction is: atan2 (yP) B ,xP B )-atan2(yP D ,xP D )。
Step 8, judging whether the included angle E1 is larger than the included angle E2, if so, determining that the included angle is larger than the included angle E2 1 ,P 2 ,…,P n The direction of the polygonal coordinate enclosed by the head and the tail is clockwise; otherwise, determine by vertex P 1 ,P 2 ,…,P n The direction of the polygonal coordinate enclosed by the head and the tail is anticlockwise;
step 9, when the polygon coordinate direction identified in the step 8 is clockwise, indicating that the coordinate direction when the GPX data is processed into the surface data is clockwise; when the coordinate direction of the polygon identified in step 8 is counterclockwise, it indicates that the coordinate direction when the GPX data is processed into the surface data is counterclockwise.
The invention also provides a system based on the coordinate direction identification method when GPX data is processed into surface data, which comprises the following steps:
the surface data conversion module is used for converting the GPX data into surface data; wherein the face data comprises a plurality of vertices, each vertex having two-dimensional x y coordinates;
the storage module is used for storing the two-dimensional coordinates of the vertexes into a database according to the track direction; assuming that there are n vertexes, sequentially P according to the track direction 1 (x 1 ,y 1 ),P 2 (x 2 ,y 2 ),…,P n (x n ,y n )；
The first searching module is used for traversing the n vertexes in the database and searching all vertexes with the maximum y value of the ordinate;
a judging module for judging whether there is only one vertex with the maximum y value searched by the first searching module, if so, recording the vertex with the maximum y value as P A (x A ,y A ) (ii) a Wherein, A is from (1,2, …, n); then executing the marking module; if not, executing a second searching module;
a second searching module for searching the vertex with the smallest x value of the abscissa in each vertex with the largest y value and recording the searched vertex as P A (x A ,y A ) Then executing the marking module;
a marking module for marking the vertex P in the xy coordinate system A Then, at the vertex P A Marking an auxiliary point P directly above D (x A ,y A + m); wherein m is any number greater than 0;
a positioning module for positioning to the vertex P in the database A Then, find the vertex P A The previous adjacent vertex P B (x B ,y B ) And the next adjacent vertex P C (x C ,y C )；
Wherein:
if A =1, the vertex P B For a vertex P in a database n (x n ,y n ) Vertex P C For a vertex P in a database 2 (x 2 ,y 2 )；
If A = n, the vertex P B For a vertex P in a database n-1 (x n-1 ,y n-1 ) Vertex P C For a vertex P in a database 1 (x 1 ,y 1 )；
If A =2,3, …, n-1, the vertex P B For a vertex P in a database A-1 (x A-1 ,y A-1 ) Vertex P C For a vertex P in a database A+1 (x A+1 ,y A+1 )；
An angle calculation module for calculating a vector P A P D To vector P A P B An included angle E1 in the clockwise direction; calculating a vector P A P D To P A P C An angle E2 in the clockwise direction;
a polygon coordinate direction identification module for judging whether the included angle E1 is larger than the included angle E2, if so, determining the included angle from the vertex P 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is clockwise; otherwise, determining the result ofVertex P 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is anticlockwise;
the surface data coordinate direction identification module indicates that the coordinate direction when the GPX data is processed into surface data is clockwise when the identified polygon coordinate direction is clockwise; when the identified polygon coordinate direction is counterclockwise, it indicates that the coordinate direction when the GPX data is processed into the surface data is counterclockwise.
The method and the system for identifying the coordinate direction when the GPX data is processed into the surface data have the following advantages:
the method can simply, quickly and accurately identify the coordinate direction of the GPX data processed into the surface data, thereby simplifying the complexity and the cost of system configuration and improving the efficiency of data processing. The coordinate direction identification method and system provided by the invention when GPX data is processed into surface data can be used for processing information of air route data and the like in a geographic information system.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above may be implemented by hardware associated with computer program instructions, and the above programs may be stored in a computer readable storage medium, and when executed, may include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-only Memory (ROM), a Random Access Memory (RAM), or the like.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and improvements can be made without departing from the principle of the present invention, and such modifications and improvements should also be considered within the scope of the present invention.
Claims (3)
1. A coordinate direction identification method when GPX data is processed into surface data is characterized by comprising the following steps:
step 1, converting GPX data into surface data; wherein the face data comprises a plurality of vertices, each vertex having two-dimensional x y coordinates; storing the two-dimensional coordinates of each vertex into a database according to the track direction;
assuming that there are n vertexes, sequentially P according to the track direction 1 （x 1 ,y 1 ）,P 2 （x 2 ,y 2 ）,…,P n （x n ,y n ）；
Step 2, traversing n vertexes in the database, and finding all vertexes with the maximum y value of the ordinate;
step 3, judging whether only one vertex with the maximum y value exists, if so, marking the vertex with the maximum y value as P A （x A ,y A ) Then, step 5 is executed; wherein, A belongs to (1,2, …, n); if not, executing step 4;
step 4, finding the vertex with the minimum x value of the abscissa in each vertex with the maximum y value, and recording the found vertex as P A （x A ,y A ) Then, step 5 is executed;
step 5, marking a vertex P in an xy coordinate system A Then, at the vertex P A Marking an auxiliary point P directly above D （x A ,y A + m); wherein m is any number greater than 0;
step 6, positioning to a vertex P in the database A Then, find the vertex P A The previous adjacent vertex P B （x B ,y B ) And the next adjacent vertex P C （x C ,y C ）；
Wherein:
if A =1, the vertex P B For a vertex P in the database n （x n ,y n ) Vertex P C For a vertex P in a database 2 （x 2 ,y 2 ）；
If A = n, the vertex P B For a vertex P in a database n-1 （x n-1 ,y n-1 ) Vertex P C For a vertex P in the database 1 （x 1 ,y 1 ）；
If A =2,3, …, n-1, thenVertex P B For a vertex P in a database A-1 （x A-1 ,y A-1 ) Vertex P C For a vertex P in a database A+1 （x A+1 ,y A+1 ）;
Step 7, calculating the vector P A P D To vector P A P B An included angle E1 in the clockwise direction; calculating a vector P A P D To vector P A P C An angle E2 in the clockwise direction;
step 8, judging whether the included angle E1 is larger than the included angle E2, if so, determining that the included angle is larger than the included angle E2 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is clockwise; otherwise, determine by vertex P 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is anticlockwise;
step 9, when the polygon coordinate direction identified in the step 8 is clockwise, indicating that the coordinate direction when the GPX data is processed into the surface data is clockwise; when the coordinate direction of the polygon identified in step 8 is counterclockwise, it indicates that the coordinate direction when the GPX data is processed into the surface data is counterclockwise.
2. The method for recognizing coordinate directions when GPX data is processed into surface data according to claim 1, wherein the values of the included angle E1 and the included angle E2 are calculated by using atan2 function.
3. A system based on the GPX data processing method into surface data according to any one of claims 1 to 2, comprising:
the surface data conversion module is used for converting the GPX data into surface data; wherein the face data comprises a plurality of vertices, each vertex having two-dimensional x y coordinates;
the storage module is used for storing the two-dimensional coordinates of the vertexes into a database according to the track direction; assuming that there are n vertexes, sequentially P according to the track direction 1 （x 1 ,y 1 ）,P 2 （x 2 ,y 2 ）,…,P n （x n ,y n ）；
The first searching module is used for traversing the n vertexes in the database and searching all vertexes with the maximum ordinate y value;
a judging module for judging whether there is only one vertex with the maximum y value searched by the first searching module, if so, recording the vertex with the maximum y value as P A （x A ,y A ) (ii) a Wherein, A belongs to (1,2, …, n); then executing the marking module; if not, executing a second searching module;
a second searching module for searching the vertex with the smallest x value of the abscissa in each vertex with the largest y value and recording the searched vertex as P A （x A ,y A ) Then executing the marking module;
a marking module for marking the vertex P in the xy coordinate system A Then, at the vertex P A Marking an auxiliary point P directly above D （x A ,y A + m); wherein m is any number greater than 0;
a positioning module for positioning to the vertex P in the database A Then, find the vertex P A The previous adjacent vertex P B （x B ,y B ) And the next adjacent vertex P C （x C ,y C ）；
Wherein:
if A =1, the vertex P B For a vertex P in a database n （x n ,y n ) Vertex P C For a vertex P in a database 2 （x 2 ,y 2 ）；
If A = n, the vertex P B For a vertex P in a database n-1 （x n-1 ,y n-1 ) Vertex P C For a vertex P in a database 1 （x 1 ,y 1 ）；
If A =2,3, …, n-1, the vertex P B For a vertex P in a database A-1 （x A-1 ,y A-1 ) Vertex P C For a vertex P in a database A+1 （x A+1 ,y A+1 ）;
An angle calculation module for calculating a vector P A P D To vector P A P B An included angle E1 in the clockwise direction; calculating a vector P A P D To vector P A P C An angle E2 in the clockwise direction;
a polygon coordinate direction identification module for judging whether the included angle E1 is larger than the included angle E2, if so, determining the included angle from the vertex P 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is clockwise; otherwise, determine by vertex P 1 ,P 2 ,…,P n The direction of a polygon coordinate enclosed by the head and the tail is anticlockwise;
the surface data coordinate direction identification module indicates that the coordinate direction when the GPX data is processed into surface data is clockwise when the identified polygon coordinate direction is clockwise; when the identified polygon coordinate direction is counterclockwise, it indicates that the coordinate direction when the GPX data is processed into the plane data is counterclockwise.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010328503.7A CN111506695B (en) | 2020-04-23 | 2020-04-23 | Coordinate direction identification method and system during GPX data processing into surface data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010328503.7A CN111506695B (en) | 2020-04-23 | 2020-04-23 | Coordinate direction identification method and system during GPX data processing into surface data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111506695A CN111506695A (en) | 2020-08-07 |
| CN111506695B true CN111506695B (en) | 2023-02-28 |
Family
ID=71874579
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010328503.7A Active CN111506695B (en) | 2020-04-23 | 2020-04-23 | Coordinate direction identification method and system during GPX data processing into surface data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111506695B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006268012A (en) * | 2006-01-19 | 2006-10-05 | Hasegawa Shoji:Kk | Method for acquiring world coordinate of cadastral survey map, device for acquiring world coordinate of cadastral survey map, program for acquiring world coordinate of cadastral survey map, and storage medium for program for acquiring world coordinate of cadastral survey map |
| EP2672224A1 (en) * | 2012-06-05 | 2013-12-11 | MITAC International Corp. | Server, navigation system and electronic device for offering navigation guidance |
| WO2015181995A1 (en) * | 2014-05-28 | 2015-12-03 | シャープ株式会社 | Autonomous travel device, method for controlling autonomous travel device, and control program for autonomous travel device |
| CN105279787A (en) * | 2015-04-03 | 2016-01-27 | 北京明兰网络科技有限公司 | Method for generating three-dimensional (3D) building model based on photographed house type image identification |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA3021847A1 (en) * | 2016-04-21 | 2017-10-26 | Winning Algorithms Inc. | System and method for predicting hyper-local conditions and optimizing navigation performance |
-
2020
- 2020-04-23 CN CN202010328503.7A patent/CN111506695B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006268012A (en) * | 2006-01-19 | 2006-10-05 | Hasegawa Shoji:Kk | Method for acquiring world coordinate of cadastral survey map, device for acquiring world coordinate of cadastral survey map, program for acquiring world coordinate of cadastral survey map, and storage medium for program for acquiring world coordinate of cadastral survey map |
| EP2672224A1 (en) * | 2012-06-05 | 2013-12-11 | MITAC International Corp. | Server, navigation system and electronic device for offering navigation guidance |
| WO2015181995A1 (en) * | 2014-05-28 | 2015-12-03 | シャープ株式会社 | Autonomous travel device, method for controlling autonomous travel device, and control program for autonomous travel device |
| CN105279787A (en) * | 2015-04-03 | 2016-01-27 | 北京明兰网络科技有限公司 | Method for generating three-dimensional (3D) building model based on photographed house type image identification |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111506695A (en) | 2020-08-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110260870B (en) | Map matching method, device, equipment and medium based on hidden Markov model | |
| US20190086524A1 (en) | Parameter calibration method and apparatus of multi-line laser radar, device and readable medium | |
| WO2019062651A1 (en) | Localization and mapping method and system | |
| CN109712071B (en) | Unmanned aerial vehicle image splicing and positioning method based on track constraint | |
| CN108806059A (en) | The text filed localization method of the bill alignment and eight neighborhood connected component offset correction of feature based point | |
| CN111968177A (en) | Mobile robot positioning method based on fixed camera vision | |
| CN111707275B (en) | Positioning method, positioning device, electronic equipment and computer readable storage medium | |
| CN110986956A (en) | Autonomous learning global positioning method based on improved Monte Carlo algorithm | |
| CN114137560A (en) | Vehicle repositioning method and device based on improved laser descriptor and electronic equipment | |
| CN112148033A (en) | Method, device and equipment for determining unmanned aerial vehicle air route and storage medium | |
| CN111506695B (en) | Coordinate direction identification method and system during GPX data processing into surface data | |
| CN111522896A (en) | Method and system for determining concave-convex points of plane polygon | |
| CN111964665B (en) | Intelligent vehicle positioning method and system based on vehicle-mounted all-around image and storage medium | |
| CN116312054A (en) | Method, device, equipment and medium for calculating traffic flow complexity of water ship | |
| CN113074735B (en) | Processing method of map data structure | |
| CN115388878A (en) | Map construction method and device and terminal equipment | |
| CN114283397A (en) | Global relocation method, device, equipment and storage medium | |
| KR102492230B1 (en) | License plate detection apparatus and method using image warping | |
| CN111524203B (en) | GPX data-based planar vector diagram generation method and system | |
| CN110941669B (en) | Space vector data storage method based on attribute information and coordinate system conversion system | |
| CN112988939B (en) | Area identification quick search method based on course index | |
| CN113819918B (en) | Positioning method, positioning device, electronic equipment and storage medium | |
| CN113990066B (en) | Road information matching and intersection identification method and device | |
| Liu et al. | Line simplification algorithm implementation and error analysis | |
| CN112233131B (en) | Method, device and equipment for dividing land block 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |