METHOD AND TERMINAL FOR SEARCHING INTEREST POINTS

• US 20110153203A1
• Filed: 12/16/2010
• Published: 06/23/2011
• Est. Priority Date: 12/17/2009
• Status: Abandoned Application

• Current Assignee: Huawei Device Company Limited (Huawei Investment & Holding Co., Ltd.)
• Original Assignee: Huawei Device Company Limited (Huawei Investment & Holding Co., Ltd.)
• Inventors: Lu, Weihong
• Application Number:
  US12/970,589
• Publication Number:
  US 20110153203A1
• Time in Patent Office: Days
• US Class Current: 701/202
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/9537 Spatial or temporal dependent retrieval, e.g. spatiotemporal queries

Abstract

A method and a terminal for searching for interest points in the field of location services are provided to solve the problem in the prior art that the interest points cannot be determined according to multiple locations. The method includes: obtaining a set of candidate interest points; and finding a target interest point from the set of candidate interest points, in which location relationships between the target interest point and each of at least two known locations meet a preset rule 1. The method may also include the following blocks: finding a target location point, in which location relationships between the target location point and each of at least two known locations meet a preset rule; and searching for a target interest point within a preset distance to the target location point. The provided method and terminal are mainly applied to the field of location services.

Claims

1. A method for searching for interest points in a terminal, comprising:

obtaining a set of candidate interest points; and

finding a target interest point from the set of candidate interest points, wherein location relationships between the target interest point and each of at least two known locations meet a preset rule 1.

2. The method for searching for interest points according to claim 1, wherein the obtaining the set of candidate interest points comprises:

searching for candidate interest points within a preset distance to each of the known locations, and forming the set of candidate interest points with the found candidate interest points;

or

searching for candidate interest points in a designated area, in an area exclusive of a designated area, on a designated path, or in an area exclusive of a designated path, then forming the set of candidate interest points with the found candidate interest points;

or

finding a target location point; and

searching for candidate interest points within a preset distance to the target location point and forming the set of candidate interest points with the found candidate interest points, wherein location relationships between the target location point and each of the at least two known locations meet a preset rule 2, and the preset rule 2 is different from the preset rule 1.

3. The method for searching for interest points according to claim 2, wherein the preset rule 1 or the preset rule 2 is that:

a difference between any two linear distances is within a preset range, wherein the two linear distances are among linear distances between the target interest point and each of the at least two known locations;

or

a difference between any two actual distances is within a preset range, wherein the two actual distances are among actual distances between the target interest point and each of the at least two known locations;

or

a difference between any navigation time is within a preset range, wherein the navigation time is among navigation time between the target interest point and each of the at least two known locations;

or

a sum of linear distances between the target interest point and each of the at least two known locations is the smallest;

or

a sum of actual distances between the target interest point and each of the at least two known locations is the smallest;

or

a sum of navigation time between the target interest point and each of the at least two known locations is the smallest.

4. A terminal for searching for interest points, comprising:

an obtaining unit, configured to obtain a set of candidate interest points; and

a finding unit, configured to find a target interest point from the set of candidate interest points, wherein location relationships between the target interest point and each of at least two known locations meet a preset rule 1.

5. The terminal for searching for interest points according to claim 4, wherein the obtaining unit comprises:

a first search module, configured to search for candidate interest points within a preset distance to each of the known locations, and form the set of candidate interest points with the found candidate interest points.

6. The terminal for searching for interest points according to claim 4, wherein the obtaining unit comprises:

a second search module, configured to search for candidate interest points in a designated area, in an area exclusive of a designated area, on a designated path, or in an area exclusive of a designated path, then form the set of candidate interest points with the found candidate interest points.

7. The terminal for searching for interest points according to claim 4, wherein the obtaining unit comprises:

a finding module, configured to find a target location point, wherein location relationships between the target location point and each of the at least two known locations meet a preset rule 2, and the preset rule 2 is different from the preset rule 1; and

a third search module, configured to search for candidate interest points within a preset distance to the target location point found by the finding module, and form the set of candidate interest points with the found candidate interest points.

8. A method for searching for interest points in a terminal, comprising:

finding a target location point, wherein location relationships between the target location point and each of at least two known locations meet a preset rule; and

searching for a target interest point within a preset distance to the target location point.

9. The method for searching for interest points according to claim 8, wherein the finding the target location point comprises:

searching for candidate location points in a designated area, in an area exclusive of a designated area, on a designated path, or in an area exclusive of a designated path, then forming a set of candidate location points with the found candidate location points; and

finding a target location point from the set of candidate location points, wherein location relationships between the target location point and each of the at least two known locations meet a preset rule.

10. The method for searching for interest points according to claim 8, wherein the preset rule is that:

a difference between any two linear distances is within a preset range, wherein the two linear distances are among linear distances between the target location point and each of the at least two known locations;

or

a difference between any two actual distances is within a preset range, wherein the two actual distances are among actual distances between the target location point and each of the at least two known locations;

or

a difference between any navigation time is within a preset range, wherein the navigation time is among navigation time between the target location point and each of the at least two known locations;

or

a sum of linear distances between the target location point and each of the at least two known locations is the smallest;

or

a sum of actual distances between the target location point and each of the at least two known locations is the smallest;

or

a sum of navigation time between the target location point and each of the at least two known locations is the smallest.

11. The method for searching for interest points according to claim 9, wherein the preset rule is that:

a difference between any two linear distances is within a preset range, wherein the two linear distances are among linear distances between the target location point and each of the at least two known locations;

or

a difference between any two actual distances is within a preset range, wherein the two actual distances are among actual distances between the target location point and each of the at least two known locations;

or

a difference between any navigation time is within a preset range, wherein the navigation time is among navigation time between the target location point and each of the at least two known locations;

or

a sum of linear distances between the target location point and each of the at least two known locations is the smallest;

or

a sum of actual distances between the target location point and each of the at least two known locations is the smallest;

or

a sum of navigation time between the target location point and each of the at least two known locations is the smallest.

12. A terminal for searching for interest points, comprising:

a finding unit, configured to find a target location point, wherein location relationships between the target location point and each of at least two known locations meet a preset rule; and

a search unit, configured to search for a target interest point within a preset distance to the target location point.

13. The terminal for searching for interest points according to claim 12, wherein the finding unit comprises:

an obtaining module, configured to search for candidate location points in a designated area, in an area exclusive of a designated area, on a designated path, or in an area exclusive of a designated path, then form a set of candidate location points with the found candidate location points; and

a finding module, configured to find a target location point from the set of candidate location points, wherein location relationships between the target location point and each of the at least two known locations meet a preset rule.