Geographic position searching method and device, electronic equipment and storage medium
A technology of geographical location and search method, which is applied in the field of automatic program design, can solve the problems of slow response, difficulty in meeting real-time query requirements, low efficiency, etc., and achieve the effect of improving user experience, increasing query speed, and reducing query volume
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0027] figure 1 It is a schematic flow chart of a geographical location search method provided by Embodiment 1 of the present invention. This embodiment is applicable to the situation of searching a geographic location. The method can be executed by a geographic location search device. The device can pass implemented by software and / or hardware.
[0028] Such as figure 1 As shown, the method in this embodiment may specifically include the following steps:
[0029] S110. Receive the data query request of the target page sent by the target client, and acquire the query latitude and longitude of the query data point corresponding to the data query request.
[0030] Among them, the query data point needs to calculate its nearest neighbor position point. In the embodiment of the present invention, the query data point can be understood as the geographic location of the query request. The geographic location of the query data point can be represented by the query latitude and lo...
Embodiment 2
[0070] figure 2 It is a schematic flowchart of a geographical location search method provided in Embodiment 2 of the present invention. This embodiment is based on any optional technical solution in the embodiment of the present invention. Optionally, the query based on the latitude and longitude Carry out K-nearest neighbor search in the pre-built K-dimensional tree, including: taking the root node as the root node of the current branch to determine the current branch; judging whether all the sample data points contained in the current branch have been visited; if the samples contained in the current branch If all the data points have not been visited, it is judged whether the split axis coordinate value of the root node is less than the split axis coordinate value corresponding to the query latitude and longitude of the query data point; if so, enter the left side of the pre-built K-dimensional tree branch to search, and update the root node of the current branch to the roo...
Embodiment 3
[0107] This embodiment provides an optional example of performing geographic location search based on the geographic location search method in the embodiment of the present invention. Its specific implementation process is as follows:
[0108] 1. Create a data index
[0109] Before K-dimensional tree (K-Dimensional tree, KDTree) is used for K-neighborhood search, it is necessary to establish a data index based on KDTree. Specifically can include:
[0110] 1) Convert latitude and longitude to Cartesian coordinate system
[0111] Obtain the data latitude and longitude (lon, lat) of each sample data point collected, convert the data latitude and longitude (lon, lat) into the data point coordinates (x, y, z) of the spatial Cartesian coordinate system, and based on the following formula Convert the latitude and longitude of the data into the data point coordinates of the spatial Cartesian coordinate system:
[0112] lon=lon / 180*π
[0113] lat=lat / 180*π
[0114] x=R*cos(lat)*c...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com