CN107092630B - Searching method and device for business objects - Google Patents
Searching method and device for business objects Download PDFInfo
- Publication number
- CN107092630B CN107092630B CN201710051440.3A CN201710051440A CN107092630B CN 107092630 B CN107092630 B CN 107092630B CN 201710051440 A CN201710051440 A CN 201710051440A CN 107092630 B CN107092630 B CN 107092630B
- Authority
- CN
- China
- Prior art keywords
- blocking area
- distance
- business object
- user
- link point
- 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/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
Abstract
The application provides a method and a device for searching a business object, wherein the method comprises the following steps: receiving a business object search request, wherein the business object search request carries a current position and a search range of a user; searching a business object in the searching range; judging whether a blocking area exists between the business object and the current position of the user, wherein the blocking area is an area which cannot be directly passed through; if a blocking area exists between the business object and the current position of the user, determining a first distance between a link point of the blocking area and the business object and a second distance between the link point of the blocking area and the current position of the user, wherein the link point is used for communicating the blocking area to which the link point belongs; judging whether the sum of the first distance and the second distance exceeds the search range; and if the sum of the first distance and the second distance does not exceed the search range, determining the business object as a searched target business object.
Description
Technical Field
The present application relates to the field of internet technologies, and in particular, to a method and an apparatus for searching a service object.
Background
Currently, many Applications (APPs) are provided with location-based search functions, such as: how to improve the accuracy of the search result is a problem to be solved urgently.
Disclosure of Invention
In view of this, the present application provides a method and an apparatus for searching a business object.
Specifically, the method is realized through the following technical scheme:
a method of searching for a business object, the method comprising:
receiving a business object search request, wherein the business object search request carries a current position and a search range of a user;
searching a business object in the searching range;
judging whether a blocking area exists between the business object and the current position of the user, wherein the blocking area is an area which cannot be directly passed through;
if a blocking area exists between the business object and the current position of the user, determining a first distance between a link point of the blocking area and the business object and a second distance between the link point of the blocking area and the current position of the user, wherein the link point is used for communicating the blocking area to which the link point belongs;
judging whether the sum of the first distance and the second distance exceeds the search range;
and if the sum of the first distance and the second distance does not exceed the search range, determining the business object as a searched target business object.
An apparatus for searching for a business object, the apparatus comprising:
the request receiving unit is used for receiving a business object searching request, wherein the business object searching request carries the current position and the searching range of a user;
the object searching unit searches the business object in the searching range;
the blocking judgment unit is used for judging whether a blocking area exists between the service object and the current position of the user, wherein the blocking area is an area which cannot be directly passed through;
the distance determining unit is used for determining a first distance between a link point of a blocking area and the business object and a second distance between the link point of the blocking area and the current position of the user if the blocking area exists between the business object and the current position of the user, wherein the link point is used for communicating the blocking area to which the link point belongs;
a range determination unit that determines whether a sum of the first distance and the second distance exceeds the search range;
and the object determining unit is used for determining the business object as the searched target business object if the sum of the first distance and the second distance does not exceed the searching range.
From the above description, it can be seen that, if a service object is searched in a search range, it can be determined whether a blocking area exists between the service object and the current position of the user, and when the blocking area exists, the distance actually required by the user to reach the service object from the current position is calculated according to the link point of the blocking area, and when the actually required distance does not exceed the search range, the service object is determined as a searched target service object, so that the search accuracy is improved, and the search experience of the user is improved.
Drawings
Fig. 1 is a flowchart illustrating a business object searching method according to an exemplary embodiment of the present application.
Fig. 2 is a schematic diagram of a blocking area shown in an exemplary embodiment of the present application.
Fig. 3 is a schematic view of another blocking area shown in an exemplary embodiment of the present application.
Fig. 4 is a flowchart illustrating another business object searching method according to an exemplary embodiment of the present application.
Fig. 5 is a schematic view of another blocking area shown in an exemplary embodiment of the present application.
Fig. 6 is a schematic structural diagram of a searching apparatus for business objects according to an exemplary embodiment of the present application.
Fig. 7 is a block diagram of a business object search apparatus according to an exemplary embodiment of the present application.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
In the related art, taking the example that a user searches for restaurants 500 meters nearby, restaurants within 500 meters of the user are usually searched for. However, the actual reach of the user from the searched restaurant may be well over 500 meters, such as: the user is separated from the searched restaurant by a river, the distance from the user to the bridge is 700 meters, the distance from the bridge to the restaurant is 500 meters, and the actual distance from the user to the restaurant is 1200 meters which is far larger than the search range, so that the search experience of the user is influenced.
In view of the above problems, the present application provides a business object search scheme.
Fig. 1 is a flowchart illustrating a business object searching method according to an exemplary embodiment of the present application.
Referring to fig. 1, the method for searching a business object may be applied to a server or a server cluster deployed by a service provider, and includes the following steps:
step 101, receiving a service object search request, wherein the service object search request carries a current position and a search range of a user.
In this embodiment, the business object may be a shopping mall, a movie theater, a hotel, a bank, a hospital, a school, or the like, and may be specifically designated by a user. The search range may be a default search range or may be specified by a user, and the processing and implementation of this portion may refer to related technologies, which are not described in detail herein.
And 102, searching the business object in the searching range.
In this embodiment, a business object search method provided in the related art may be adopted for searching, for example: searching for the business objects of which the straight-line distance from the current position of the user does not exceed the searching range. In practical implementation, the linear distance may be calculated according to the coordinates of the current position of the user and the coordinates of the business object, and then it is determined whether the linear distance exceeds the search range. The processing and implementation of this part may also refer to the related art, and the detailed description of this application is omitted here.
Step 103, judging whether a blocking area exists between the service object and the current position of the user, wherein the blocking area is an area which cannot be directly passed through.
In this embodiment, the blocking area is generally an area that cannot be passed directly, and the blocking area may be divided into two types, one type is a control type area, such as: military control areas, enclosed schools, enclosed residential areas, etc., which are typically not accessible to outside personnel. Another class is isolated regions such as: rivers, highways, and other areas that cannot be traversed directly.
In this embodiment, if there is a blocking area between the service object and the current location of the user, step 104 may be executed. If no blocking area exists between the business object and the current position of the user, the business object can be determined as the searched target business object and returned to the user.
And 104, if a blocking area exists between the business object and the current position of the user, determining a first distance between a link point of the blocking area and the business object and a second distance between the link point of the blocking area and the current position of the user, wherein the link point is used for communicating the blocking area to which the link point belongs.
In this embodiment, whether a blocking area exists between the business object and the current location of the user may be determined by determining whether a connection line between the business object and the current location of the user intersects any blocking area. In general, when a line connecting the business object and the current location of the user intersects any of the blocking areas, it may be determined that a blocking area exists between the business object and the current location of the user. When the connecting line of the business object and the current position of the user is not intersected with any blocking area, it can be determined that no blocking area exists between the business object and the current position of the user.
In this embodiment, if a blocking area exists between the service object and the current location of the user, a first distance between a link point of the blocking area and the service object and a second distance between the link point of the blocking area and the current location of the user are determined. Wherein, the link point is used for communicating the blocking area to which the link point belongs. For example, assuming the blocking area is a river, its link point may be a bridge on the river.
And 105, judging whether the sum of the first distance and the second distance exceeds the search range.
In this embodiment, after determining the first distance and the second distance, a sum of the first distance and the second distance may be calculated, which is usually the distance actually required for the user to reach the business object from its current location.
In this step, it may be determined whether the sum of the first distance and the second distance exceeds the search range, and if the sum of the first distance and the second distance does not exceed the search range, step 106 may be executed. If the sum of the first distance and the second distance exceeds the search range, the business object can be ignored, namely, the business object is not returned to the user as a search result.
And 106, if the sum of the first distance and the second distance does not exceed the search range, determining the service object as a searched target service object.
Based on the determination result in the foregoing step 105, if the sum of the first distance and the second distance does not exceed the search range, it indicates that the distance actually required for the user to reach the service object from the current position does not exceed the search range, and the service object may be determined as the searched target service object and returned to the user.
From the above description, it can be seen that, if a service object is searched in a search range, it can be determined whether a blocking area exists between the service object and the current position of the user, and when the blocking area exists, the distance actually required by the user to reach the service object from the current position is calculated according to the link point of the blocking area, and when the actually required distance does not exceed the search range, the service object is determined as a searched target service object, so that the search accuracy is improved, and the search experience of the user is improved.
The technical solution of the present application is described in detail below through two aspects of blocking areas, link points, and searching for service objects.
One, blocking area and linking point
In the present embodiment, the blocking area may be set to be a polygon for convenience of calculation. Specifically, the corresponding area may be divided into one or more polygonal blocking areas based on the shape of an area that cannot be directly traveled in real life.
Fig. 2 shows an isolated blocking area, and assuming that fig. 2 shows a section of river, in practical application, the section of river can be divided into three rectangular blocking areas, namely, blocking area 1, blocking area 2 and blocking area 3, for convenience of calculation. For each blocking area, the position coordinates of the 4 vertices of the corresponding rectangle may be saved as the position information of the blocking area.
With continued reference to fig. 2, if there is a bridge in the blocking area 2, the midpoint of the bridge may be determined as the link point of the blocking area 2. Of course, in practical applications, any one or more points on the bridge may also be determined as the link point of the blocking area 2, which is not particularly limited in the present application. Similarly, neither blocking area 1 nor blocking area 3 has a linking point for communicating the corresponding blocking areas.
Fig. 3 shows a tube-type blocking area, and assuming that fig. 3 shows a closed school, which is hexagonal, the school can be regarded as a blocking area: the blocking area 4. For the blocking area 4, the position coordinates of 6 vertices of the corresponding hexagon may be stored as the position information of the blocking area 4.
With continued reference to fig. 3, the blackout area 4 cannot pass through, but may pass through the blackout area 4 around six sides of the blackout area 4, i.e., along the school's peripheral roads. Thus, the 6 vertices ABCDEF of the blocking area 4 may be determined as the linking points of the blocking area 6. Of course, in practical application, according to the actual road condition near the blocking area 4, some of the 6 vertices may also be set as link points, or other link points may be set, which is not limited in this application.
In this embodiment, after the blocking areas and the link points of each blocking area are determined based on actual conditions, the position information of the blocking areas and the position information of the link points thereof may be saved. The position information of the link point is usually the position coordinate of the link point.
In this embodiment, the blocking area and the linking point are usually predetermined, such as: before executing the search logic of the business object provided by the application, the blocking area and the link point thereof are determined, and the position information of the blocking area and the link point thereof is stored for subsequent use.
Optionally, in another example, to improve the search efficiency and reduce the calculation amount during the search, after the blocking area and the link point are determined, for each service object, it may be determined whether there is a link point near the service object, for example: whether a link point exists within 3 kilometers of the square circle (within a preset range) can be judged by taking the service object as a center. If there is a link point, the corresponding relation between the business object and the link point can be saved. In addition, the first distance between the link point and the business object can be calculated and stored in advance. Referring to the example of table 1, the following correspondence may be saved in advance.
TABLE 1
Searching of business objects
In this embodiment, based on the embodiment shown in fig. 1, in step 103, it may be determined whether a connection line between the searched service object and the current location of the user intersects with the blocking area according to the stored location information of each blocking area, and if the connection line intersects with the blocking area, it may be determined that a blocking area exists between the service object and the current location of the user. If the connection line of the business object and the current position of the user is not intersected with any blocking area, it can be determined that no blocking area exists between the business object and the current position of the user.
For example, taking the blocking area 4 shown in fig. 3 as an example, it may be determined whether the relation between the business object and the current location of the user intersects with the hexagon shown in fig. 3, and if the relation intersects with the hexagon, it may be determined that the blocking area 4 exists between the business object and the current location of the user.
In practical applications, since the number of blocking areas may be large, sequentially performing the above determination may result in a large processing amount, which may affect the search speed. Optionally, in another example, referring to fig. 4, the searching of the business object may include the following steps:
step 401, receiving a service object search request, where the service object search request carries a current location and a search range of a user.
Step 402, searching the business object in the searching range.
In this embodiment, the processing procedures of step 401 and step 402 may refer to step 101 and step 102, which are not described in detail herein.
Step 403, when the service object corresponds to a link point, determining whether a connection line between the service object and the current position of the user intersects with a blocking area to which any link point corresponding to the service object belongs.
Based on the foregoing step 402, when a business object is searched, it may be determined whether the business object corresponds to a link point according to a correspondence relationship between the business object and the link point (for example, the example in table 1), and if the business object does not correspond to any link point, the business object may be determined as a searched target business object and returned to the user.
If the business object corresponds to a link point, a blocking area to which the link point belongs can be determined first, and then whether a connection line between the business object and the current position of the user is intersected with the blocking area is judged. If the business objects are not intersected, the business objects can be determined as the searched target business objects and returned to the user. If so, execution may continue with step 404.
Taking blocking area 2 shown in fig. 2 as an example, please refer to the example of fig. 5, assuming that the user is currently located at point H, and the user searches for restaurants within 500 meters nearby, restaurant 1 can be searched, and the straight-line distance from the current location of the user is 430 meters (the distance between point H and point L). In this example, based on the correspondence shown in table 1, it can be determined that restaurant 1 corresponds to a link point K, and the link point K belongs to blocking area 2, and it can be determined whether a connection line HL between the current location of the user and restaurant 1 intersects with blocking area 2 according to the location information of blocking area 2. In this example, HL intersects blocking region 2, then step 404 can be performed.
Step 404, if the connection line between the service object and the current position of the user intersects with the blocking area to which a certain link point corresponding to the service object belongs, determining a first distance between the certain link point and the service object and a second distance between the link point of the blocking area and the current position of the user.
With continued reference to fig. 5, in this step, a first distance 500 meters (distance between KLs) between the saved link point K and the restaurant 1 may be obtained from table 1, and a second distance between the link point K and the current location H of the user may also be calculated, for example: the second distance may be calculated from the position coordinates of the link point K and the position coordinates of the user's current position H.
Step 405, determining whether the sum of the first distance and the second distance exceeds the search range.
In this embodiment, if the sum of the first distance and the second distance does not exceed the search range, step 406 may be executed. And if the sum of the first distance and the second distance exceeds the search range, the business object can be ignored, namely, the business object is not returned to the user as the searched business object.
Based on the foregoing step 404, in this step, the sum of the first distance and the second distance may be calculated. Assuming that the second distance is 700 meters, the sum of the first distance and the second distance is 1200 meters, and the search range is 500 meters, restaurant 1 may not be used as the search result. Because the actual distance required for the user to reach restaurant 1 from the current location H is 1200 meters, which is much greater than the search distance.
It should be noted that, in practical applications, to improve accuracy, the first distance and the second distance may be reachable distances in a practical scene, such as: the distance determined after considering the current road distribution condition. Optionally, to increase the search rate, the first distance and the second distance may also be linear distances calculated according to the position coordinates, which is not particularly limited in this application.
Step 406, if the sum of the first distance and the second distance does not exceed the search range, determining the service object as a searched target service object.
Based on the determination result in step 405, if the sum of the first distance and the second distance does not exceed the search range, it may be indicated that the actual distance required by the user to reach the service object from the current location does not exceed the search range, and then the service object may be determined as the searched target service object, and the sum of the first distance and the second distance is returned to the user as the search distance between the user and the service object. For the user, the search distance displayed in the search result is the distance actually reaching the business object, and the search experience of the user is improved.
Optionally, in another example, for a blocking area of a tube type, since each blocking area usually has a plurality of link points, when calculating a distance actually required by a user to reach a business object from a current position, calculation may be performed for each link point. That is, when a blocking area existing between the service object and the current location of the user includes a plurality of link points, the first distance and the second distance are respectively determined based on each link point, and a sum of the first distance and the corresponding second distance is calculated, and then it is determined whether the sum of the first distance and the second distance exceeds the search range, and if the sum of the first distance and the second distance of one or more link points does not exceed the search range, the service object may be determined as a searched target service object. If the sum of the first distance and the second distance of any link point exceeds the search range, the business object can be ignored.
Referring to table 1, assuming that a service object searched according to a search range is restaurant 2, there are 6 link points corresponding to restaurant 2, and a connecting line between a current location of a user and restaurant 2 intersects with blocking area 4, a first distance and a second distance may be respectively determined for each link point, and a sum of the first distance and the second distance may be calculated. For convenience of description, the sum of the first distance and the second distance may be denoted as S, and S may be calculatedA、SB、SC、SD、SEAnd SF. Then, S can be sequentially judgedA、SB、SC、SD、SEAnd SFIf the search range is exceeded, assume SAIf the search range is not exceeded, restaurant 2 may be determined as the searched target restaurant. If SA、SB、SC、SD、SEAnd SFRestaurant 2 may be ignored if the search range is exceeded.
Optionally, in another example, for a blocking area of a control type, before determining the first distance, it may be determined whether a connection line between a corresponding link point and a service object intersects with the blocking area to which the connection line belongs, and if the connection line intersects with the blocking area, it indicates that a path from the link point to the service object needs to pass through the blocking area, which cannot be realized in an actual scene, and thus, determination of the first distance and the second distance is not required. Further, for the implementation manner of storing the first distance in advance, the above determination may be performed before the storage, and if the connection line between the link point and the service object intersects with the blocking area, the first distance may be stored as infinite or null. And if the connecting line of the corresponding link point and the service object does not intersect with the blocking area, determining the first distance. On the other hand, similarly, before the determination of the second distance is performed, it may also be determined whether the connection line of the corresponding link point and the current position of the user intersects with the blocking area to which the corresponding link point belongs, and if the connection line of the corresponding link point and the current position of the user intersects with the blocking area, the determination of the second distance is also not required. If the connecting line of the corresponding link point and the current position of the user is not intersected with the blocking area, the second distance can be determined.
Corresponding to the embodiment of the method for searching the business object, the application also provides an embodiment of a device for searching the business object.
The embodiment of the searching device of the business object can be applied to a server. The device embodiments may be implemented by software, or by hardware, or by a combination of hardware and software. Taking a software implementation as an example, as a logical device, the device is formed by reading corresponding computer program instructions in the nonvolatile memory into the memory for operation through the processor of the server where the device is located. In terms of hardware, as shown in fig. 6, the hardware structure diagram of the server where the service object search apparatus of the present application is located is shown, except for the processor, the memory, the network interface, and the nonvolatile memory shown in fig. 6, the server where the apparatus is located in the embodiment may also include other hardware according to the actual function of the server, which is not described again.
Fig. 7 is a block diagram of a business object search apparatus according to an exemplary embodiment of the present application.
Referring to fig. 7, the apparatus 600 for searching a business object can be applied to the server shown in fig. 6, and includes: a request receiving unit 601, an object searching unit 602, a blocking judgment unit 603, a distance determination unit 604, a range judgment unit 605, an object determination unit 606, and a calculation unit 607, a position holding unit 608, and a distance returning unit 609.
The request receiving unit 601 receives a service object search request, where the service object search request carries a current user position and a search range;
an object searching unit 602, which searches the business object in the searching range;
a blocking judgment unit 603, configured to judge whether a blocking area exists between the service object and the current location of the user, where the blocking area is an area that cannot be directly passed through;
a distance determining unit 604, configured to determine, if a blocking area exists between the service object and the current location of the user, a first distance between a link point of the blocking area and the service object and a second distance between the link point of the blocking area and the current location of the user, where the link point is used to communicate with the blocking area to which the link point belongs;
a range determination unit 605 that determines whether the sum of the first distance and the second distance exceeds the search range;
an object determining unit 606, configured to determine the service object as a searched target service object if the sum of the first distance and the second distance does not exceed the search range.
And a calculation unit 607, when a blocking area existing between the business object and the current location of the user includes a plurality of link points, determining the first distance and the second distance respectively based on each link point, and calculating a sum of the first distance and the second distance;
the object determination unit 606 determines whether one or more link points among the plurality of link points in the blocking area satisfy the following condition:
the sum of the first distance and the second distance corresponding to the link points does not exceed the search range;
and if one or more link points meet the condition, determining the business object as the searched target business object.
A position holding unit 608 that holds position information of each blocking area;
the blocking judgment unit 603 judges whether the connection line between the service object and the current position of the user intersects any blocking area according to the position information of the blocking area; and if the connecting line of the business object and the current position of the user is intersected with any blocking area, determining that the blocking area exists between the business object and the current position of the user.
Optionally, the blocking determining unit 603 is configured to, when the service object corresponds to a link point, determine whether a connection line between the service object and the current location of the user intersects with a blocking area to which any link point corresponding to the service object belongs; and the distance between the link point corresponding to the business object and the business object is within a preset range.
Optionally, the blocking area is a polygon, and the position information of the blocking area is position coordinates of each vertex of the polygon.
Optionally, when the blocking area is a controlled area, the link points of the blocking area are the vertices of the polygon.
Optionally, the distance determining unit 604 determines a first distance between the link point of the blocking area and the service object when the connection line between the link point of the blocking area and the service object does not intersect with the blocking area; and when the connecting line of the link point of the blocking area and the current position of the user is not intersected with the blocking area, determining a second distance between the link point of the blocking area and the current position of the user.
Optionally, the regulated area includes: military control areas, closed schools and closed residential districts.
Optionally, when the blocking area is an isolated area, the link point of the blocking area is a midpoint of a path passing through the isolated area.
Optionally, the isolated region includes: freeways, rivers.
Optionally, the object determining unit 606 further determines the service object as a searched target service object when there is no blocking area between the service object and the current location of the user.
The distance returning unit 609, after determining the service object as the searched target service object, returns the sum of the first distance and the second distance as the search distance between the user and the service object to the user.
The implementation process of the functions and actions of each unit in the above device is specifically described in the implementation process of the corresponding step in the above method, and is not described herein again.
For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the application. One of ordinary skill in the art can understand and implement it without inventive effort.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.
Claims (24)
1. A method for searching a business object, the method comprising:
receiving a business object search request, wherein the business object search request carries a current position and a search range of a user;
searching a business object in the searching range;
judging whether a blocking area exists between the business object and the current position of the user, wherein the blocking area is an area which cannot be directly passed through;
if a blocking area exists between the business object and the current position of the user, determining a first distance between a link point of the blocking area and the business object and a second distance between the link point of the blocking area and the current position of the user, wherein the link point is used for communicating the blocking area to which the link point belongs;
judging whether the sum of the first distance and the second distance exceeds the search range;
and if the sum of the first distance and the second distance does not exceed the search range, determining the business object as a searched target business object.
2. The method of claim 1, further comprising:
when a blocking area existing between the business object and the current position of the user comprises a plurality of link points, respectively determining the first distance and the second distance based on each link point, and calculating the sum of the first distance and the second distance;
if the sum of the first distance and the second distance does not exceed the search range, determining the service object as a searched target service object, including:
judging whether one or more link points exist in the plurality of link points of the blocking area and meet the following conditions:
the sum of the first distance and the second distance corresponding to the link points does not exceed the search range;
and if one or more link points meet the condition, determining the business object as the searched target business object.
3. The method of claim 1, further comprising:
storing the position information of each blocking area;
the judging whether a blocking area exists between the business object and the current position of the user comprises the following steps:
judging whether the connection line of the business object and the current position of the user is intersected with any blocking area or not according to the position information of the blocking area;
and if the connecting line of the business object and the current position of the user is intersected with any blocking area, determining that the blocking area exists between the business object and the current position of the user.
4. The method according to claim 3, wherein the determining whether the connection line between the business object and the current location of the user intersects any blocking area according to the location information of the blocking area comprises:
when the business object corresponds to a link point, judging whether a connecting line of the business object and the current position of the user is intersected with a blocking area where any link point corresponding to the business object belongs;
and the distance between the link point corresponding to the business object and the business object is within a preset range.
5. The method of claim 3,
the blocking area is a polygon, and the position information of the blocking area is the position coordinates of each vertex of the polygon.
6. The method of claim 5,
when the blocking area is a controlled area, the link points of the blocking area are all the vertexes of the polygon.
7. The method of claim 6, wherein the determining a first distance between the link point of the blocking area and the business object and a second distance between the link point of the blocking area and a current location of a user comprises:
when the connecting line of the link point of the blocking area and the business object is not intersected with the blocking area, determining a first distance between the link point of the blocking area and the business object;
and when the connecting line of the link point of the blocking area and the current position of the user is not intersected with the blocking area, determining a second distance between the link point of the blocking area and the current position of the user.
8. The method of claim 7,
the regulated area includes: military control areas, closed schools and closed residential districts.
9. The method of claim 5,
when the blocking area is an isolated area, the link point of the blocking area is the midpoint of a path through the isolated area.
10. The method of claim 9,
the isolated region includes: freeways, rivers.
11. The method of claim 1, further comprising:
and when no blocking area exists between the business object and the current position of the user, determining the business object as the searched target business object.
12. The method of claim 1, further comprising:
and after the business object is determined as the searched target business object, returning the sum of the first distance and the second distance to the user as the searching distance between the user and the business object.
13. An apparatus for searching for a business object, the apparatus comprising:
the request receiving unit is used for receiving a business object searching request, wherein the business object searching request carries the current position and the searching range of a user;
the object searching unit searches the business object in the searching range;
the blocking judgment unit is used for judging whether a blocking area exists between the service object and the current position of the user, wherein the blocking area is an area which cannot be directly passed through;
the distance determining unit is used for determining a first distance between a link point of a blocking area and the business object and a second distance between the link point of the blocking area and the current position of the user if the blocking area exists between the business object and the current position of the user, wherein the link point is used for communicating the blocking area to which the link point belongs;
a range determination unit that determines whether a sum of the first distance and the second distance exceeds the search range;
and the object determining unit is used for determining the business object as the searched target business object if the sum of the first distance and the second distance does not exceed the searching range.
14. The apparatus of claim 13, further comprising:
and a calculation unit, when a blocking area existing between the business object and the current position of the user comprises a plurality of link points, respectively determining the first distance and the second distance based on each link point, and calculating the sum of the first distance and the second distance;
the object determination unit is used for judging whether one or more link points in the plurality of link points of the blocking area meet the following conditions:
the sum of the first distance and the second distance corresponding to the link points does not exceed the search range;
and if one or more link points meet the condition, determining the business object as the searched target business object.
15. The apparatus of claim 13, further comprising:
a position holding unit that holds position information of each blocking area;
the blocking judgment unit judges whether the connection line of the business object and the current position of the user is intersected with any blocking area according to the position information of the blocking area; and if the connecting line of the business object and the current position of the user is intersected with any blocking area, determining that the blocking area exists between the business object and the current position of the user.
16. The apparatus of claim 15,
the blocking judgment unit is used for judging whether a connecting line of the business object and the current position of the user is intersected with a blocking area where any one link point corresponding to the business object belongs when the business object corresponds to the link point; and the distance between the link point corresponding to the business object and the business object is within a preset range.
17. The apparatus of claim 15,
the blocking area is a polygon, and the position information of the blocking area is the position coordinates of each vertex of the polygon.
18. The apparatus of claim 17,
when the blocking area is a controlled area, the link points of the blocking area are all the vertexes of the polygon.
19. The apparatus of claim 18,
the distance determining unit is used for determining a first distance between the link point of the blocking area and the service object when the link point of the blocking area and the connecting line of the service object are not intersected with the blocking area; and when the connecting line of the link point of the blocking area and the current position of the user is not intersected with the blocking area, determining a second distance between the link point of the blocking area and the current position of the user.
20. The apparatus of claim 18,
the regulated area includes: military control areas, closed schools and closed residential districts.
21. The apparatus of claim 17,
when the blocking area is an isolated area, the link point of the blocking area is the midpoint of a path through the isolated area.
22. The apparatus of claim 21,
the isolated region includes: freeways, rivers.
23. The apparatus of claim 13,
the object determining unit is further configured to determine the service object as a searched target service object when no blocking area exists between the service object and the current location of the user.
24. The apparatus of claim 13, further comprising:
and the distance returning unit is used for returning the sum of the first distance and the second distance to the user as the searching distance between the user and the business object after determining the business object as the searched target business object.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710051440.3A CN107092630B (en) | 2017-01-23 | 2017-01-23 | Searching method and device for business objects |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710051440.3A CN107092630B (en) | 2017-01-23 | 2017-01-23 | Searching method and device for business objects |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107092630A CN107092630A (en) | 2017-08-25 |
| CN107092630B true CN107092630B (en) | 2020-11-24 |
Family
ID=59646575
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710051440.3A Active CN107092630B (en) | 2017-01-23 | 2017-01-23 | Searching method and device for business objects |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107092630B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020138196A1 (en) * | 2001-03-07 | 2002-09-26 | Visteon Global Technologies, Inc. | Methods and apparatus for dynamic point of interest display |
| CN102016500A (en) * | 2008-04-28 | 2011-04-13 | 株式会社纳维泰 | Route guidance system, route search server, route guidance method, and terminal |
| CN102472625A (en) * | 2009-08-05 | 2012-05-23 | 株式会社纳维泰 | Route guiding system, route guiding server, route guiding mediation server, and route guiding method |
| CN103900591A (en) * | 2012-12-25 | 2014-07-02 | 上海博泰悦臻电子设备制造有限公司 | Navigation method and device capable of accurately searching points of interest around navigation path |
-
2017
- 2017-01-23 CN CN201710051440.3A patent/CN107092630B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020138196A1 (en) * | 2001-03-07 | 2002-09-26 | Visteon Global Technologies, Inc. | Methods and apparatus for dynamic point of interest display |
| CN102016500A (en) * | 2008-04-28 | 2011-04-13 | 株式会社纳维泰 | Route guidance system, route search server, route guidance method, and terminal |
| CN102472625A (en) * | 2009-08-05 | 2012-05-23 | 株式会社纳维泰 | Route guiding system, route guiding server, route guiding mediation server, and route guiding method |
| CN103900591A (en) * | 2012-12-25 | 2014-07-02 | 上海博泰悦臻电子设备制造有限公司 | Navigation method and device capable of accurately searching points of interest around navigation path |
Non-Patent Citations (1)
| Title |
|---|
| 基于空间认知的智能导航方法研究;赵卫锋;《中国博士学位论文全文数据库 工程科技Ⅱ辑》;20140615(第6期);第C034-24页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107092630A (en) | 2017-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10715949B2 (en) | Determining timing for determination of applicable geo-fences | |
| CN109478184B (en) | Identifying, processing, and displaying clusters of data points | |
| US8610717B2 (en) | Efficient pre-computing of simplified vector data for rendering at multiple zoom levels | |
| JP5925338B2 (en) | Discovery of wireless network access points | |
| US9179253B2 (en) | Map service method and system of providing target contents based on location | |
| CN112712690B (en) | Vehicle electronic fence method and device and electronic equipment | |
| Xuan et al. | Voronoi-based multi-level range search in mobile navigation | |
| JP2016537718A (en) | Interest point clustering method and related apparatus | |
| KR101965878B1 (en) | Automatic connection of images using visual features | |
| KR20140137352A (en) | Automatic input signal recognition using location based language modeling | |
| US9910878B2 (en) | Methods for processing within-distance queries | |
| US9811539B2 (en) | Hierarchical spatial clustering of photographs | |
| KR20190029411A (en) | Image Searching Method, and Media Recorded with Program Executing Image Searching Method | |
| CN107092630B (en) | Searching method and device for business objects | |
| US8914357B1 (en) | Mapping keywords to geographic features | |
| WO2015192716A1 (en) | Scribe line search method and device based on electronic map | |
| CN105677843A (en) | Method for automatically obtaining attribute of four boundaries of parcel | |
| US11537622B2 (en) | K-nearest neighbour spatial queries on a spatial database | |
| CN103186528A (en) | Method, device and mobile terminal for screening geographical information | |
| CN114676344A (en) | Method and device for determining coordinates of interest points, storage medium and electronic equipment | |
| CN108573653B (en) | Electronic map generation method and device | |
| KR20120007131A (en) | Triangle filtering in tree index for ar applications | |
| Garg et al. | Optimizing spatial database performance for handling moving objects | |
| Patil et al. | A survey on location based services on smart phone: City lense | |
| CN113743736A (en) | Thermodynamic grade determining method, thermodynamic diagram generating device and electronic equipment |
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 |