CN112988939B - Area identification quick search method based on course index - Google Patents

Area identification quick search method based on course index Download PDF

Info

Publication number
CN112988939B
CN112988939B CN202110359718.XA CN202110359718A CN112988939B CN 112988939 B CN112988939 B CN 112988939B CN 202110359718 A CN202110359718 A CN 202110359718A CN 112988939 B CN112988939 B CN 112988939B
Authority
CN
China
Prior art keywords
point
area
data
index
limiting area
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
Application number
CN202110359718.XA
Other languages
Chinese (zh)
Other versions
CN112988939A (en
Inventor
程海彬
鲁浩
徐剑芸
王连增
位晓峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Airborne Missile Academy
Original Assignee
China Airborne Missile Academy
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Airborne Missile Academy filed Critical China Airborne Missile Academy
Priority to CN202110359718.XA priority Critical patent/CN112988939B/en
Publication of CN112988939A publication Critical patent/CN112988939A/en
Application granted granted Critical
Publication of CN112988939B publication Critical patent/CN112988939B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—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/90—Details of database functions independent of the retrieved data types
    • G06F16/907—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
    • G06F16/909—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually using geographical or spatial information, e.g. location
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Remote Sensing (AREA)
  • Software Systems (AREA)
  • Library & Information Science (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

A rapid search method for area identification based on course index relates to the technical field of geographic area identification, which comprises the following steps: step (1), establishing map data of a limiting area, selecting a central point O in the set limiting area, defining a counterclockwise included angle between a given boundary point on the boundary of the limiting area and the central point O in the limiting area and the northbound direction of the limiting area as a course angle, respectively calculating the course angle of each boundary point given on the boundary of the limiting area by 0 DEG and 0 DEG-360 DEG anticlockwise, and storing longitude and latitude data of the boundary points in a memory according to the ascending sequence of the corresponding course angle; the invention utilizes longitude and latitude information output by the navigation system of the aircraft to rapidly identify the area of the aircraft in the electronic map, and gives an instruction of prohibiting or allowing flight according to the attribute of the area.

Description

Area identification quick search method based on course index
Technical Field
The invention relates to the technical field of geographic area identification, in particular to a quick area identification searching method based on course index.
Background
As known, there are many methods for realizing area recognition at present, and typical methods include a ray method, a grid method, and the like; the ray method needs to traverse all data points on the edge, and under the condition of more points, the time consumption is long and the efficiency is low; the grid method needs a larger storage space to achieve higher discrimination accuracy, and the contradiction is particularly prominent when the limited area is larger, which is a problem to be solved by those skilled in the art.
Disclosure of Invention
In order to overcome the defects in the background art, the invention discloses a rapid search method for area identification based on course index.
In order to achieve the aim of the invention, the invention adopts the following technical scheme:
a region identification quick search method based on course index comprises the following steps:
step (1), establishing map data of a limiting area, selecting a central point O in the set limiting area, defining a counterclockwise included angle between a given boundary point on the boundary of the limiting area and the central point O in the limiting area and the northbound direction of the limiting area as a course angle, respectively calculating the course angle of each boundary point given on the boundary of the limiting area by 0 DEG and 0 DEG-360 DEG anticlockwise, and storing longitude and latitude data of the boundary points in a memory according to the ascending sequence of the corresponding course angle;
calculating a course angle of the query point, and calculating a counterclockwise included angle between a connecting line of the query point and a central point O in the limiting area and the northbound direction of the limiting area according to longitude and latitude data of the query point to obtain the course angle of the query point;
searching a data offset address, searching a heading angle closest to the heading angle of the query point in a memory by taking the heading angle value obtained in the step (2) as a search object, and extracting longitude and latitude data of an edge point corresponding to the corresponding heading angle;
and (4) comparing and judging, namely respectively calculating the distance between the query point and the central point O in the limiting area, and the distance between the edge point queried in the step (3) and the central point O in the limiting area, and comparing the distances, so as to judge whether the query point is inside or outside the limiting area.
Preferably, in step (1), an integer Index array Index [360] containing 360 data is set, and offset addresses corresponding to the integer course angle data are stored, where the array sequence number and the integer course angle value are consistent, that is: index [0] stores the offset address of the first data whose heading angle is 0 °; index [1] stores the offset address of the data point where the first heading angle is greater than or equal to 1, and so on.
Preferably, in the step (4), firstly setting an outer frame close to the limited area as a primary selection frame, and if the query point falls outside the primary selection frame, directly judging that the query point is outside the area; if the query point falls in the primary selection frame, further calculating and judging the data index number.
Preferably, the method for calculating the course angle of the query point in the step (2) is as follows:
converting query point longitude and latitude data to the earth system
Figure GDA0003066259450000021
The conversion formula is:
Figure GDA0003066259450000022
wherein:
Figure GDA0003066259450000023
R e ＝6378137,R p ＝6356752.3142，
phi is latitude and lambda is longitude;
then, coordinates of the query point in the north, the day and the east geographic systems with the central point O as the origin of coordinates are calculated:
Figure GDA0003066259450000024
wherein:
Figure GDA0003066259450000025
the query point and the origin of coordinates are located at the groundCoordinates under the ball system;
Figure GDA0003066259450000026
calculating the course angle (°) of the query point:
Figure GDA0003066259450000027
by means of
Figure GDA0003066259450000028
After the heading angle value is an integer, the data index number of the angle in the index array is obtained:
Figure GDA0003066259450000031
from Index array Index [ n ]]And extracting the offset address of the limit area boundary point.
Preferably, in step (3), a binary method can be used for further searching.
Due to the adoption of the technical scheme, the invention has the following beneficial effects:
the rapid search method for the region identification based on the course index disclosed by the invention skillfully simplifies two-dimensional search into one-dimensional search, and is simple in design and implementation; the searching process does not need to traverse all data, and has the advantages of high searching speed, small calculated amount and high discrimination precision; the method is suitable for the identification of the set polygonal limiting area and is also suitable for the identification of the limiting area by taking province, city and national border lines; and in the flight process, real-time judgment is carried out, and an indication that the aircraft is inside and outside the set limiting area is given, so that support is provided for realizing the control of the flight area, and the aircraft is prevented from flying into or out of the limiting area.
Drawings
FIG. 1 is a given restricted area map;
FIG. 2 is a table of given restricted area map data storage means;
FIG. 3 is a table of edge point data corresponding to the D point heading angle;
fig. 4 is a table of edge point data corresponding to the E point heading angle.
Detailed Description
The invention will be explained in more detail by the following examples, the purpose of which is to protect all technical improvements within the scope of the invention.
A region identification quick search method based on course index comprises the following steps:
step (1), establishing map data of a limiting area, selecting a central point O in the set limiting area, defining a counterclockwise included angle between a given boundary point on the boundary of the limiting area and the central point O in the limiting area and the northbound direction of the limiting area as a course angle, respectively calculating the course angle of each boundary point given on the boundary of the limiting area by 0 DEG and 0 DEG-360 DEG anticlockwise, and storing longitude and latitude data of the boundary points in a memory according to the ascending sequence of the corresponding course angle; setting an integer Index array Index [360] containing 360 data, and storing offset addresses of corresponding integer course angle data, wherein the array sequence number is consistent with the integer course angle in value, namely: index [0] stores the offset address of the first data whose heading angle is 0 °; index [1] stores the offset address of the data point with the first heading angle not less than 1 DEG, and so on;
calculating a course angle of the query point, and calculating a counterclockwise included angle between a connecting line of the query point and a central point O in the limiting area and the northbound direction of the limiting area according to longitude and latitude data of the query point to obtain the course angle of the query point; the method for calculating the course angle of the query point comprises the following steps:
converting query point longitude and latitude data to the earth system
Figure GDA0003066259450000041
The conversion formula is:
Figure GDA0003066259450000042
wherein:
Figure GDA0003066259450000043
R e ＝6378137,R p ＝6356752.3142，
phi is latitude and lambda is longitude;
then, coordinates of the query point in the north, the day and the east geographic systems with the central point O as the origin of coordinates are calculated:
Figure GDA0003066259450000044
wherein:
Figure GDA0003066259450000045
the query point and the origin of coordinates are in the earth system;
Figure GDA0003066259450000046
calculating the course angle (°) of the query point:
Figure GDA0003066259450000047
by means of
Figure GDA0003066259450000048
After the heading angle value is an integer, the data index number of the angle in the index array is obtained:
Figure GDA0003066259450000049
from Index array Index [ n ]]Extracting offset addresses of edge points of the limiting area;
searching a data offset address, searching a heading angle closest to the heading angle of the query point in a memory by taking the heading angle value obtained in the step (2) as a search object, and extracting longitude and latitude data of an edge point corresponding to the corresponding heading angle;
step (4), comparing and judging, namely respectively calculating the distance between the query point and the central point O in the limiting area, and the distance between the edge point queried in the step (3) and the central point O in the limiting area, and comparing the two distances, so as to judge whether the query point is inside or outside the limiting area; further, an outer frame close to the limited area can be firstly set as a primary selection frame, and if the query point falls outside the primary selection frame, the query point is directly judged to be outside the area; if the query point falls in the primary selection frame, further calculating and judging the data index number.
Embodiment one:
referring to fig. 1 and 2, fig. 1 is a set map of an identification area, the total number of data points is 6241, in fig. 1, O is a center point, points A, B, C are boundary points of heading angles of 0 °, 1 ° and 2 °, D is a point to be queried outside a limited area, and longitude and latitude coordinates of the D are (109.1, 20.0) °; FIG. 2 is a view of the restricted area map data storage of FIG. 1, with data represented in 4 bytes for data accuracy;
the method according to the step (2) comprises the following steps:
Figure GDA0003066259450000051
n=27, extracted to offset address m=537;
the boundary points corresponding to the 27-degree sectors extracted through the D point course angle index can be obtained in the figure 3; there are only two points in the 27 deg. sector, and the heading angle value of the point D falls between data 1 and data 2, i.e. the index offset address error is 1.
Embodiment two:
referring to fig. 1 and 2, fig. 1 is a set map of an identification area, the total number of data points is 6241, in fig. 1, O is a center point, points A, B, C are boundary points of heading angles of 0 °, 1 ° and 2 °, points E are points to be queried outside a limited area, and longitude and latitude coordinates of the points E are (110.9, 19.1) °; FIG. 2 is a view of the restricted area map data storage of FIG. 1, with data represented in 4 bytes for data accuracy;
the method according to the step (2) comprises the following steps:
Figure GDA0003066259450000052
n=108, extracted to offset address m=3319;
the method can obtain the figure 4, namely, the boundary point of the 281 degree sector extracted by the E point course angle index, 8 data points exist in the 281 degree sector, the E point course angle value falls between the data 4 and the data 5, the index offset address error is 4, when the index error reaches 256, a bisection method is adopted, and the boundary point closest to the inquiring point course angle can be found out for 8 times at most;
calculating the coordinates of the boundary point to the center point O in the limited area by using the formula (2)
Figure GDA0003066259450000053
By comparing the distance between the query point and the center point O in the limit area, the query point can be judged to be inside or outside the limit area, if the distance between the query point and the center point O in the limit area is larger than the distance between the corresponding edge point and the center point O in the limit area, the query point is judged to be inside or outside the limit area:
Figure GDA0003066259450000061
in order to ensure the reliability of judgment, a point can be added before and after the edge point to judge.
The invention is not described in detail in the prior art.

Claims (3)

1. A rapid search method based on area identification of course index is characterized in that: comprises the following steps:
step (1), establishing map data of a limiting area, selecting a central point O in the set limiting area, defining a counterclockwise included angle between a given boundary point on the boundary of the limiting area and the central point O in the limiting area and the northbound direction of the limiting area as a course angle, respectively calculating the course angle of each boundary point given on the boundary of the limiting area by 0 DEG and 0 DEG-360 DEG anticlockwise, and storing longitude and latitude data of the boundary points in a memory according to the ascending sequence of the corresponding course angle;
calculating a course angle of the query point, and calculating a counterclockwise included angle between a connecting line of the query point and a central point O in the limiting area and the northbound direction of the limiting area according to longitude and latitude data of the query point to obtain the course angle of the query point;
searching a data offset address, searching a heading angle closest to the heading angle of the query point in a memory by taking the heading angle value obtained in the step (2) as a search object, and extracting longitude and latitude data of an edge point corresponding to the corresponding heading angle;
step (4), comparing and judging, namely respectively calculating the distance between the query point and the central point O in the limiting area, and the distance between the edge point queried in the step (3) and the central point O in the limiting area, and comparing the two distances, so as to judge whether the query point is inside or outside the limiting area;
setting an integer Index array Index [360] containing 360 data in the step (1), and storing offset addresses of corresponding integer course angle data, wherein the array sequence number is consistent with the integer course angle in value, namely: index [0] stores the offset address of the first data whose heading angle is 0 °; index [1] stores the offset address of the data point with the first heading angle not less than 1 DEG, and so on;
the method for calculating the course angle of the query point in the step (2) comprises the following steps:
converting query point longitude and latitude data to the earth system
Figure FDA0004203573880000011
The conversion formula is:
Figure FDA0004203573880000012
wherein:
Figure FDA0004203573880000013
R e ＝6378137,R p ＝6356752.3142，
phi is latitude and lambda is longitude;
then, coordinates of the query point in the north, the day and the east geographic systems with the central point O as the origin of coordinates are calculated:
Figure FDA0004203573880000021
wherein:
Figure FDA0004203573880000022
the query point and the origin of coordinates are in the earth system;
Figure FDA0004203573880000023
calculating the course angle of the query point:
Figure FDA0004203573880000024
by means of
Figure FDA0004203573880000025
After the heading angle value is an integer, the data index number of the angle in the index array is obtained: />
Figure FDA0004203573880000026
From Index array Index [ n ]]And extracting the offset address of the limit area boundary point.
2. The heading index-based region identification quick search method as claimed in claim 1, wherein: in the step (4), firstly setting an outer frame close to the limiting area as a primary selection frame, and directly judging that the query point is outside the area if the query point is outside the primary selection frame; if the query point falls in the primary selection frame, further calculating and judging the data index number.
3. The heading index-based region identification quick search method as claimed in claim 1, wherein: in step (3), a binary method can be used for further searching.
CN202110359718.XA 2021-04-01 2021-04-01 Area identification quick search method based on course index Active CN112988939B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110359718.XA CN112988939B (en) 2021-04-01 2021-04-01 Area identification quick search method based on course index

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110359718.XA CN112988939B (en) 2021-04-01 2021-04-01 Area identification quick search method based on course index

Publications (2)

Publication Number Publication Date
CN112988939A CN112988939A (en) 2021-06-18
CN112988939B true CN112988939B (en) 2023-06-23

Family

ID=76338904

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110359718.XA Active CN112988939B (en) 2021-04-01 2021-04-01 Area identification quick search method based on course index

Country Status (1)

Country Link
CN (1) CN112988939B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101957191A (en) * 2009-10-29 2011-01-26 华侨大学 Method for evaluating roundness and sphericity errors based on self-adaption iteration neighbourhood search
CN105243364A (en) * 2015-09-24 2016-01-13 北京贯中精仪科技有限公司 Photoelectric pod search method, apparatus and system
CN105547300A (en) * 2015-12-30 2016-05-04 航天恒星科技有限公司 All-source navigation system and method used for AUV (Autonomous Underwater Vehicle)
CN107438754A (en) * 2015-02-10 2017-12-05 御眼视觉技术有限公司 Sparse map for autonomous vehicle navigation
CN110794963A (en) * 2019-10-18 2020-02-14 天津理工大学 Depth camera-based eye control auxiliary input method
CN110906927A (en) * 2019-12-06 2020-03-24 中国空空导弹研究院 Gravity acceleration simplified algorithm under solidification coordinate system
CN111308468A (en) * 2019-11-27 2020-06-19 北京东方至远科技股份有限公司 Method for automatically identifying deformation risk area based on In SAR technology

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6174908B2 (en) * 2013-05-27 2017-08-02 キヤノン株式会社 Information processing apparatus, information processing method, and computer program
US10852838B2 (en) * 2014-06-14 2020-12-01 Magic Leap, Inc. Methods and systems for creating virtual and augmented reality

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101957191A (en) * 2009-10-29 2011-01-26 华侨大学 Method for evaluating roundness and sphericity errors based on self-adaption iteration neighbourhood search
CN107438754A (en) * 2015-02-10 2017-12-05 御眼视觉技术有限公司 Sparse map for autonomous vehicle navigation
CN105243364A (en) * 2015-09-24 2016-01-13 北京贯中精仪科技有限公司 Photoelectric pod search method, apparatus and system
CN105547300A (en) * 2015-12-30 2016-05-04 航天恒星科技有限公司 All-source navigation system and method used for AUV (Autonomous Underwater Vehicle)
CN110794963A (en) * 2019-10-18 2020-02-14 天津理工大学 Depth camera-based eye control auxiliary input method
CN111308468A (en) * 2019-11-27 2020-06-19 北京东方至远科技股份有限公司 Method for automatically identifying deformation risk area based on In SAR technology
CN110906927A (en) * 2019-12-06 2020-03-24 中国空空导弹研究院 Gravity acceleration simplified algorithm under solidification coordinate system

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Synchrophasor Assisted Real Time Angular Stability Awareness Program for Emerging Smart Power Grids;Anson Antony 等;《2019 2nd International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)》;129-135 *
一种基于凝固地理系的捷联惯导极区导航算法;程海彬 等;《中国空间科学技术》;第第40卷卷(第第2期期);35-41 *
适用于空空导弹的SINS/GPS组合导航系统;程海彬 等;《弹箭与制导学报》;第第32卷卷(第第5期期);14-16 *

Also Published As

Publication number Publication date
CN112988939A (en) 2021-06-18

Similar Documents

Publication Publication Date Title
CN108446349B (en) GIS abnormal data detection method
CN108896040B (en) Inertia/gravity combined navigation method and system for sky-sea integrated underwater vehicle
CN104376053A (en) Storage and retrieval method based on massive meteorological data
CN113094527B (en) Generalized cloud control space-time spectrum big database and remote sensing image processing method
US20210254995A1 (en) Methods, apparatuses, systems, and storage media for storing and loading visual localization maps
CN103678657B (en) Method for storing and reading altitude data of terrain
CN113325389A (en) Unmanned vehicle laser radar positioning method, system and storage medium
CN112988939B (en) Area identification quick search method based on course index
CN109085656B (en) Feature-oriented high-precision gravity graph construction and interpolation method
CN111964665B (en) Intelligent vehicle positioning method and system based on vehicle-mounted all-around image and storage medium
CN111435549B (en) Forward-looking predictive warning topographic data extraction method
CN111781641A (en) Passive seismic source positioning method, system and terminal based on active seismic source correction and readable storage medium
CN113074735B (en) Processing method of map data structure
CN112882058B (en) Shipborne laser radar obstacle detection method based on variable-size grid map
CN103678658A (en) Device for storing altitude data of terrain and device for reading altitude data of terrain
CN115371663A (en) Laser mapping method and device, electronic equipment and computer readable storage medium
CN111982062B (en) Method for determining position of track crossing point of altimetry satellite based on minimum distance method
CN111896002B (en) Terrain-assisted navigation matching area online planning and suitability analysis method and system
CN110941669B (en) Space vector data storage method based on attribute information and coordinate system conversion system
CN114413882A (en) Global initial positioning method and device based on multi-hypothesis tracking
CN109947884B (en) Efficient organization query method for global ICESat/GLAS point cloud
CN108763817B (en) Electric underground pipe network matching method based on least square modeling
CN108960738B (en) Laser radar data clustering method under warehouse channel environment
CN117874690B (en) Intelligent management method for geographic information mapping data
CN112184904B (en) Digital integration method and device

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