CN117609636A

CN117609636A - Point of interest display method and device and electronic equipment

Info

Publication number: CN117609636A
Application number: CN202311575682.4A
Authority: CN
Inventors: 姚鑫鹏; 常力元; 佟欣哲; 刘芳哲; 郭俊言; 郭惟
Original assignee: Tianyi Safety Technology Co Ltd
Current assignee: Tianyi Safety Technology Co Ltd
Priority date: 2023-11-23
Filing date: 2023-11-23
Publication date: 2024-02-27

Abstract

The application discloses a method, a device and electronic equipment for displaying interest points, which relate to the technical field of combination of communication and software development, and the method comprises the following steps: acquiring all the interest points in the current visual range, and adding all the interest points to a queue to be ordered; selecting a first interest point closest to the center point of the current visual range from all the interest points, and adding the first interest point to the ordered queue; when the number of the interest points in the ordered queue is smaller than the preset display number and the queue to be ordered is not an empty sequence, selecting a target interest point from the queue to be ordered based on the position distribution information of the interest points to be ordered in the queue to be ordered and a target initial weight value, and adding the target interest point to the ordered queue; and displaying the interest points in the ordered queue when the number of the interest points in the ordered queue is equal to the preset display number or the queue to be ordered is an empty sequence. By the method, the real-time performance and the accuracy of the point of interest display can be improved.

Description

Point of interest display method and device and electronic equipment

Technical Field

The application relates to the technical field of communication and software development, in particular to a method and a device for displaying points of interest and electronic equipment.

Background

With rapid development of modern technology, electronic map visual services are becoming an important ring in daily life. The method can complete a series of operations such as searching subway stations, searching business halls under telecommunication lines, knowing the distribution condition of nearby base stations of a fifth generation mobile communication technology (5th Generation Mobile Communication Technology,5G) and the like on a mobile terminal without going out of home.

The map visualization service converts abstract data information into visual image information and provides interactive operation, so that a user can conveniently view points of interest, wherein the points of interest refer to point class data in an electronic map, such as schools, banks, shops, parks, stadiums, hospitals and the like, as the points of interest. However, the current method for displaying the interest points still has various limitations when the scale of the visual result is changed, for example, when the display scale is kept unchanged and a user drags a map browsing area, the system cannot dynamically display new interest points, so that the real-time performance and the accuracy of obtaining the interest points by the user are limited.

Disclosure of Invention

The application provides a method and a device for displaying interest points and electronic equipment, and can solve the problem that the current interest point display method limits the real-time performance and accuracy of obtaining the interest points by users.

In a first aspect, the present application provides a method for displaying a point of interest, the method including:

acquiring all interest points in a current visual range, and adding the interest points to a queue to be ordered;

selecting a first interest point closest to the center point of the current visual range from all the interest points, and adding the first interest point to a ranked queue;

when the number of interest points in the ordered queue is smaller than the preset display number and the queue to be ordered is not an empty sequence, selecting a target interest point from the queue to be ordered based on the position distribution information of the interest points to be ordered in the queue to be ordered and a target initial weight value, and adding the target interest point to the ordered queue;

and displaying the interest points in the ordered queue when the number of the interest points in the ordered queue is equal to the preset display number or the queue to be ordered is the empty sequence.

According to the method, the interest points in the current visual range are displayed based on the position distribution information of the interest points and the initial weight value, so that the instantaneity and the accuracy of the interest point display can be improved.

In one possible design, before the acquiring all the points of interest in the current visual range, the method further includes:

Respectively counting the respective total passenger flow values of all the interest points between the departure place and the destination in a preset period;

respectively carrying out normalization processing on the total passenger flow values of the interest points to obtain passenger flow parameter values of the interest points;

constructing a directed graph based on the departure place, the destination and the link relation among all the interest points, and determining a transfer matrix corresponding to the directed graph;

and respectively calculating respective initial weight values of the interest points based on the transfer matrix, the respective passenger flow volume parameter values of the interest points and a random browsing model formula.

By the method, the initial weight value of each interest point between the departure place and the destination is calculated by combining the passenger flow value of the interest point and the webpage ranking PageRank algorithm, so that the importance of each interest point can be accurately reflected.

In one possible design, the selecting the target interest point in the to-be-sorted queue based on the position distribution information of the to-be-sorted interest point in the to-be-sorted queue and the target initial weight value includes:

calculating a weight value corresponding to the interest points to be sorted based on the position distribution information and the target initial weight value;

Selecting a first interest point to be ranked with the highest weight value from the queue to be ranked, and determining whether shielding exists between the first interest point to be ranked and the interest points in the ranked queue;

if yes, deleting the first interest point to be ordered from the queue to be ordered;

if not, selecting the first interest point to be sorted as the target interest point.

By the method, the shielded interest points are filtered, so that the interest points can be clearly displayed in a non-shielding mode.

In one possible design, the determining the weight value corresponding to the to-be-sorted interest point based on the location distribution information and the target initial weight value includes:

calculating a line diversity value corresponding to the interest points to be ranked based on the line information in the position distribution information, calculating a space diversity value corresponding to the interest points to be ranked based on the space distribution information in the position distribution information, and calculating a weight value corresponding to the interest points to be ranked based on the line diversity value, the space diversity value and the target initial weight value; or (b)

Calculating a line proportionality value corresponding to the interest points to be sorted based on the line information, calculating a space proportionality value corresponding to the interest points to be sorted based on the space distribution information, and calculating a weight value corresponding to the interest points to be sorted based on the line proportionality value, the space proportionality value and the target initial weight value.

By the method, the weight value corresponding to the interest points to be sorted is calculated based on the line information and the space distribution information as constraint conditions, so that the target interest point is selected based on the weight value, and the selection quality of the interest points can be improved.

In one possible design, the calculating, based on the line information in the location distribution information, a line diversity value corresponding to the interest point to be ranked includes:

acquiring a first line set to which the interest points to be sorted belong and a second line set to which the interest points in the sorted queue belong;

the line diversity value is calculated based on the first line set and the second line set.

In one possible design, the calculating the spatial diversity value corresponding to the interest point to be ranked based on the spatial distribution information in the location distribution information includes:

calculating a first Euclidean distance between the interest point to be ordered and any interest point in the ordered queue, a second Euclidean distance between the interest point to be ordered and a central point of a current visual range, and a third Euclidean distance between any interest point and the central point;

The spatial diversity value is calculated based on the first euclidean distance, the second euclidean distance, and the third euclidean distance.

In one possible design, the calculating, based on the line information, a line proportionality value corresponding to the interest point to be ranked includes:

acquiring a first line set to which the interest points to be sorted belong, a second line set to which the interest points in the sorted queue belong, and a third line set to which all the interest points in the current visual range belong;

the line proportionality value is calculated based on the first line set, the second line set, and the third line set.

In one possible design, the line proportionality value satisfies the following expression:

wherein the Pro _line (p _i ) Represents a line proportionality value, the |line (p _i ) The I represents the total number of lines to which the interest points to be ranked belong, line (pi L) represents any line to which the interest points to be ranked belong, sum [ line (p) _iL )]Representing the number of interest points, in which the line belonging to all the interest points in the current visual range is the arbitrary line, ext [ line (p) _iL )]And indicating that the line to which the interest points in the ordered queue belong is the interest point number of any line, and t1 is a preset adjustment ratio.

In one possible design, the calculating, based on the spatial distribution information, a spatial proportionality value corresponding to the interest points to be ranked includes:

determining a target space direction region to which the interest points to be sorted belong;

and calculating the space proportionality value based on the total number of the interest points in the target space direction area and the space direction area to which the interest points in the ordered queue belong as the interest point number of the target space direction area.

In one possible design, the spatial proportionality value satisfies the following expression:

wherein Pro (p) _i ) Represents the spatial proportionality value, dir (p _i ) Representing the target spatial direction region, sum dir (p _i )]Represents the total number of points of interest in the target spatial direction region, ext [ dir (p _i )]And t2 represents a preset adjustment ratio, wherein the number of the interest points in the space direction region which represents the interest points in the ordered queue is the target space direction region.

In one possible design, the determining whether there is an occlusion between the first point of interest to be sorted and a point of interest in the sorted queue includes:

obtaining a scaling level corresponding to the current visual range, and determining a scale relationship corresponding to the current visual range based on the scaling level;

Acquiring an actual distance value between the first interest point to be ordered and the interest points in the ordered queue, and acquiring a scaled distance value between the first interest point to be ordered and the interest points in the ordered queue based on the actual distance value and the scale relationship;

when the icon width of the first interest point to be sorted is smaller than or equal to the zoom distance value, determining that no shielding exists between the first interest point to be sorted and the interest points in the sorted queue;

and when the icon width is larger than the zoom distance value, determining that shielding exists between the first interest point to be ordered and the interest points in the ordered queue.

In a second aspect, the present application provides a point of interest display device, the device comprising:

the acquisition module is used for acquiring all the interest points in the current visual range and adding the interest points to a queue to be ordered;

the first selecting module is used for selecting a first interest point which is closest to the center point of the current visual range from all the interest points and adding the first interest point to the ordered queue;

the second selecting module is used for selecting a target interest point from the to-be-sorted queue based on the position distribution information of the to-be-sorted interest point in the to-be-sorted queue and a target initial weight value when the number of the interest points in the sorted queue is smaller than the preset display number and the to-be-sorted queue is not an empty sequence, and adding the target interest point to the sorted queue;

And the display module is used for displaying the interest points in the ordered queue when the number of the interest points in the ordered queue is equal to the preset display number or the queue to be ordered is the empty sequence.

In one possible design, the apparatus further comprises:

the statistics module is used for respectively counting the respective total passenger flow values of all the interest points between the departure place and the destination in a preset period;

the normalization module is used for respectively carrying out normalization processing on the total passenger flow values of the interest points to obtain the passenger flow parameter values of the interest points;

the construction module is used for constructing a directed graph based on the link relation among the departure place, the destination and the interest points and determining a transfer matrix corresponding to the directed graph;

the calculation module is used for calculating the initial weight value of each interest point based on the transfer matrix, the passenger flow parameter value of each interest point and a random browsing model formula.

In one possible design, the second selection module includes:

the calculating unit is used for calculating a weight value corresponding to the interest points to be sequenced based on the position distribution information and the target initial weight value;

The determining unit is used for selecting a first interest point to be ranked with the highest weight value from the queue to be ranked and determining whether shielding exists between the first interest point to be ranked and the interest points in the ranked queue;

the deleting unit is used for deleting the first interest point to be ordered from the queue to be ordered if shielding exists between the first interest point to be ordered and the interest points in the ordered queue;

the selecting unit is configured to select the first to-be-sorted interest point as the target interest point if there is no shielding between the first to-be-sorted interest point and the interest points in the sorted queue.

In one possible design, the computing unit is specifically configured to:

In one possible design, the determination unit is specifically configured to:

In a third aspect, the present application provides an electronic device, including:

a memory for storing a computer program;

and the processor is used for realizing the steps of the interest point display method of the first aspect when executing the computer program stored on the memory.

In a fourth aspect, the present application provides a computer-readable storage medium having stored therein a computer program which, when executed by a processor, implements the point of interest display method steps of the first aspect described above.

Based on the interest point display method, the interest points in the current visual range are displayed through the position distribution information and the initial weight values of the interest points, so that the real-time performance and the accuracy of the interest point display can be improved.

The technical effects of each of the second to fourth aspects and the technical effects that may be achieved by each aspect are described above with reference to the first aspect or the technical effects that may be achieved by each possible aspect in the first aspect, and the description is not repeated here.

Drawings

Fig. 1 is a flowchart of a method for displaying points of interest according to an embodiment of the present application;

fig. 2 is a logic schematic diagram of a point of interest display according to an embodiment of the present application;

FIG. 3 is a logic diagram of a target point of interest selection according to an embodiment of the present disclosure;

fig. 4 is a schematic structural diagram of a point of interest display device according to an embodiment of the present application;

fig. 5 is a schematic internal structure of a second selection module according to an embodiment of the present application;

fig. 6 is a schematic structural diagram of another point of interest display device according to an embodiment of the present disclosure;

fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the present application will be described in further detail with reference to the accompanying drawings. The specific method of operation in the method embodiment may also be applied to the device embodiment or the system embodiment. It should be noted that "a plurality of" is understood as "at least two" in the description of the present application. "and/or", describes an association relationship of an association object, and indicates that there may be three relationships, for example, a and/or B, and may indicate: a alone, a and B alone, and B alone. A is connected with B, and can be represented as follows: both cases of direct connection of A and B and connection of A and B through C. In addition, in the description of the present application, the words "first," "second," and the like are used merely for distinguishing between the descriptions and not be construed as indicating or implying a relative importance or order.

For the convenience of understanding by those skilled in the art, technical terms related to the embodiments of the present application will be explained first.

(1) The interest points (Point Of Interest, POI) generally refer to point class data in the Internet electronic map, and basically comprise four attributes of names, addresses, coordinates and categories; a point-like map element vector dataset derived from a basic mapping outcome digital line map (Digital Line Graphic, DLG) product; in a geographic information system (Geographic Information System, GIS) refers to objects that can be abstracted into points for management, analysis, and computation.

(2) The Page Rank (PR), also called page level, google left rank or petty rank, is a technique for calculating weights according to hyperlinks between web pages, and can embody relevance and importance of web pages, and is one of the effect factors frequently used for evaluating web page optimization in search engine optimization operation.

(3) Euclidean distance: refers to the true distance between two points in m-dimensional space, or the natural length of the vector (i.e., the distance of the point from the origin).

In order to further explain the technical solutions provided in the embodiments of the present application, the following details are described with reference to the accompanying drawings and the detailed description. Although the embodiments of the present application provide the method operational steps as shown in the following embodiments or figures, more or fewer operational steps may be included in the method, either on a routine or non-inventive basis. In steps where there is logically no necessary causal relationship, the execution order of the steps is not limited to the execution order provided by the embodiments of the present application. The method may be performed sequentially or and in accordance with the method shown in the embodiments or drawings when the actual process or apparatus is performed.

The existing interest point display algorithm mainly has the following problems:

interest point shielding: under different display scales, interest points on the map may be blocked from each other, forming visual confusion. This occurs because some existing map visualization algorithms fail to effectively resolve spatial conflicts between points of interest when dealing with scale changes. Such spatial conflicts can result in certain points of interest being obscured by other points of interest at different zoom levels, making it impossible for a user to accurately identify and locate desired information on a map. This visual disturbance not only affects the aesthetics of the map, but more importantly, it reduces the user's understanding and utilization efficiency of the map information.

The point of interest is not updated in time: the scale remains unchanged and the system is unable to dynamically display new points of interest as the user drags the map browsing area. The root cause of this problem is the data update and rendering mechanisms of existing map services. Typically, the map service needs to reload map data of a corresponding area when a user drags a map, and then render a new map. However, during this process, the system often cannot identify new points of interest in real time and blend them into the current visual range of the user. The method and the system lead to that when a user drags on a map, new interest points are not displayed in time, so that the user cannot acquire the latest geographic information, and the instantaneity and the accuracy of the map service are affected.

And (3) statically displaying the interest points: the existing research of space data retrieval based on the zoom level of the map is static in nature, namely, each space record is allocated with a number corresponding to the zoom level of the scalable map, and although the data reduction can be realized on different map levels, the schemes are static retrieval of the space data.

In order to solve the above problems, according to the method for displaying the interest points provided by the embodiment of the application, the interest points in the current visual range are displayed based on the position distribution information and the initial weight value of the interest points, so that the real-time performance and the accuracy of the interest point display can be improved. The method and the device according to the embodiments of the present application are based on the same technical concept, and because the principles of the problems solved by the method and the device are similar, the embodiments of the device and the method can be referred to each other, and the repetition is not repeated.

Fig. 1 is a flowchart of a method for displaying points of interest according to an embodiment of the present application, where the flowchart may be executed by a point of interest display device, and the device may be implemented in a software manner, or may be implemented in a hardware manner, or may be implemented in a combination of software and hardware manner, so as to improve instantaneity and accuracy of point of interest display. As shown in fig. 1, the process includes the steps of:

S101, acquiring all interest points in a current visual range, and adding all the interest points to a queue to be ordered;

s102, selecting a first interest point which is closest to the center point of the current visual range from all interest points, and adding the first interest point to the ordered queue;

s103, when the number of the interest points in the ordered queue is smaller than the preset display number and the queue to be ordered is not an empty sequence, selecting a target interest point from the queue to be ordered based on the position distribution information of the interest points to be ordered in the queue to be ordered and a target initial weight value, and adding the target interest point to the ordered queue;

and S104, when the number of the interest points in the ordered queue is equal to the preset display number, or the queue to be ordered is an empty sequence, displaying the interest points in the ordered queue.

In order to make the position information express more timely, more fresh and more accurate, provide better electronic map service for people and promote user experience, in the embodiment of the present application, taking the dynamic display of subway stations as an example, a method for dynamically displaying interest points based on PageRank is displayed, as shown in FIG. 2, a logic schematic diagram for interest point display provided in the embodiment of the present application includes the following steps:

201: and respectively calculating the respective initial weight values of the points of interest between the departure place and the destination.

In this embodiment of the present application, a departure point (O) and a Destination point (D) are equivalent to an boarding station and a alighting station, and each interest point may be equivalent to each station between the boarding station and the alighting station, where the method for calculating the initial weight value of each interest point may be:

the following operations are performed for each point of interest:

firstly, counting the interest points p in a preset period T _i The total passenger flow value of (2) is the total passenger flow valueAnd total passenger flow value->And T may be one week or 10 days, and is specificallyAs the case may be, this is not limiting.

Then, for p _i Normalized to obtain p _i Passenger flow volume parameter value of (a). Specifically, for p _i The total passenger flow value of (2) is scaled to obtain a passenger flow statistical value Pro_od _i Wherein Pro_od _i The specific calculation formula is as follows:

in equation (1), B represents a set of individual points of interest,representing the sum of the respective total passenger flow values of the interest points in the preset period T>And the sum of the total passenger flow values of all the interest points in the preset period T is represented.

Further, for the obtained Pro_od _i Normalization processing is carried out to obtain p _i Is a passenger flow volume parameter value Norm_od _i Wherein, norm_od _i The specific calculation formula is as follows:

after obtaining the passenger flow parameter values of the interest points, constructing an undirected graph based on the starting place, the destination and the link relation among the interest points. But because the PR algorithm is mostly applied to the directed graph, the undirected graph is converted into a directed graph g= (V, E), where one edge of the undirected graph can be considered as two opposite edges of the directed graph G, V is a finite set of vertices, and E is a finite set of edges of vertex pairs in the directed graph.

Meanwhile, a transfer matrix corresponding to the directed graph G is determined, in short, a matrix a is defined as an OD-based transfer matrix corresponding to the directed graph G, and the ith row and jth column elements Aij of the matrix a are as follows:

in equation (3), the (i, j) E E represents the slave interest point p in the directed graph G _i To the point of interest p _j O is a connecting wire of (2) _i P in the directed graph _i Degree of out, degree of out means that p _i The number of edges that are the starting point.

And finally, respectively calculating the initial weight value of each interest point based on the transfer matrix A, the passenger flow volume parameter value of each interest point and a random browsing model formula. In brief, the passenger flow parameter values of the respective interest points replace the numerical value 1 in the traditional PR algorithm to serve as numerical flow, the PR values of the respective vertices in the directed graph G are calculated in an iterative mode through a random browsing model formula, the probability of each vertex is converged to stable distribution under a certain condition, the stable probability PR values of the respective vertices based on OD are obtained, and accordingly the PR values serve as initial weight values of the respective interest points.

202: and acquiring all the interest points in the current visual range, and selecting a first interest point closest to the center point of the current visual range from all the interest points.

Adding all the obtained interest points in the current visual range to a queue wQue to be ordered, and adding the selected first interest point to the ordered queue eQue, wherein the selection method of the first interest point can be as follows:

selecting the interest point closest to the center point of the current visual range from all the interest points, and taking the interest point as a first interest point when the number of the interest points closest to the center point is 1; when a plurality of interest points are closest to each other, comparing the initial weight values of the interest points, and selecting the interest point with the highest initial weight value. When the interest points with the highest initial weight values are only 1, the interest points are used as first interest points; when there are multiple interest points with the highest initial weight value, the user can be reminded that there are multiple candidate first interest points currently, so that the final first interest point is added to eQue according to the selection of the user, and at the moment |eQue|=1.

203: judging whether the number of the interest points in the ordered queue is smaller than the preset display number and whether the queue to be ordered is an empty sequence, if the number of the interest points in the ordered queue is smaller than the preset display number and the queue to be ordered is not an empty sequence, switching to 204; if the number of interest points in the ordered queue is equal to the preset display number, or the queue to be ordered is an empty sequence, the process proceeds to 205.

Alternatively, the preset number of displays may be 1 or 10, where the specific value is optional, and is not specifically limited herein.

204: and selecting a target interest point from the to-be-sorted queue based on the position distribution information of the to-be-sorted interest points in the to-be-sorted queue and the target initial weight value, and transferring to 203 after adding the target interest point to the sorted queue.

As shown in fig. 3, a logic schematic diagram of target interest point selection provided in an embodiment of the present application specifically includes the following steps:

301: and determining the weight value corresponding to the interest points to be sorted based on the position distribution information of the interest points to be sorted and the target initial weight value.

On the basis of static calculation of initial weight values of all the interest points, in order to realize dynamic retrieval and improve the effect of the retrieved representative interest points on visual and practical information requirements, the weight values corresponding to the interest points to be sequenced can be calculated by the following two methods:

the method comprises the following steps: the areas served by the subway stations are different due to the arrangement and planning of different track lines in the city, so that the areas of the subway stations of different track lines are different in characteristics, traffic functions, land functions and the like, and therefore, the weight values corresponding to the points of interest to be sequenced are calculated in a diversified manner. Meanwhile, in order to make the interest points more uniform and reasonable in spatial distribution, a space-based diversity method can be adopted. Specific:

On the one hand, based on the positionAnd calculating the line diversity value corresponding to the interest points to be sequenced according to the line information in the distribution information. Since one criterion for measuring diversity is to maximize the sum of the differences between each interest point, the interest points p are to be ranked _i Corresponding line diversity value Div _line (p _i ) The calculation method of (a) can be as follows:

acquisition of p _i The first line set line (p) _i ) And a second line set line (eQue) to which the interest point in the ordered queue eQue belongs, and based on the line (p _i ) And line (eQue) computation of Div _line (p _i ) The specific calculation formula is as follows:

in formula (4), line (p) _i ) The n line (eQue) represents the number of points of interest corresponding to the intersection portion between the first line set and the second line set.

For example, line (p _i ) = { L1, L2}, eque= { a, B, C, D }, line (eQue) = { (L1, L3), (L2, L4), (L1, L6), (L6) }. Line (p) can be calculated _i ) If n line (eQue) =3, then Div is calculated _line (p _i )＝1-3/4＝0.25。

On the other hand, based on the spatial distribution information in the position distribution information, calculating a spatial diversity value corresponding to the interest points to be sorted. Spatial diversity is a method of weakening points of interest to be sorted in the same spatial direction in wQue by the spatial direction of the points of interest in eQue. In the space data set, the space layout should return the result as various as possible, when a certain space direction appears in eQue for many times, and when the next time a target interest point is selected from wQue to enter eQue, the weight value corresponding to the interest point in the same space direction needs to be dynamically weakened, so that the interest point to be ordered with opposite space directions is preferentially selected as the target interest point, thereby achieving the requirement based on space diversity. Diversity takes into account the spatial distribution of all points of interest in the current visual range, which includes two main factors, between two points of interest The direction and the distance between two points of interest, i.e. the spatial diversity, are the diversity and the multidirectional of the distribution. Therefore, according to the triangle characteristic, the interest points p are to be ordered _i The corresponding method for calculating the spatial diversity value can be as follows:

calculating the interest points p to be ordered _i With any interest point p in ordered queue eQue _j A first Euclidean distance dis (p _i ，p _j ) Interest point p to be ordered _i A second Euclidean distance dis (p) from the center point s of the current visual range _i S), any point of interest p in the ordered queue _j A third Euclidean distance dis (p _j S) and based on dis (p) _i ，p _j )、dis(p _i S), and dis (p) _j S), calculating a spatial diversity value Div _spa (p _i ) Wherein Div _spa (p _i ) The specific calculation formula is as follows:

div calculated based on equation (5) _spa (p _i ) The value range of (1) is (0, 1)]。

Thus, based on the line diversity value Div _line (p _i ) The spatial diversity value Div _spa (p _i ) And the interest point p to be ordered _i Target initial weight value g of (2) _pi Calculating p _i Corresponding weight value Score _div (p _i ) Wherein, score _div (p _i ) The specific calculation formula is as follows:

Score _div (p _i )＝g _pi *m1*[α1*Div _spa (p _i )+β1*Div _line (p _i )] (6)

in the formula (6), m1 represents an adjustment coefficient, and the specific value is not particularly limited herein as the case may be; α1 represents an adjustment ratio, and may take the value of 2, as the case may be, without limitation; β1 also represents an adjustment ratio, and the specific values are not specifically defined herein, as appropriate.

The second method is as follows: the weight value corresponding to the interest points to be ranked can be calculated based on the proportionality method of the line and the proportionality method of the space. Specific:

on the one hand, a line proportionality value corresponding to the interest points to be sequenced is calculated based on the line information. The proportionality focuses on the proportion of the number of each line to the total number, and the target interest points in the aspect of the proportionality characteristics of the lines are selected according to the following rules: for a plurality of lines where the interest points are located, for the lines with weaker local weights and higher occurrence frequencies, the line weight coefficient should be dynamically increased when the target interest point is selected from wQue next time; and for the line with stronger local weight but lower occurrence frequency, the weight coefficient of the line should be dynamically weakened when the target interest point is selected next time. Finally, the enhancement and attenuation of the weight values are performed according to the percentage of the occurrence frequency of different lines of the interest points to be sequenced. Thus, the points of interest p to be ranked _i Corresponding line proportionality value Pro _line (p _i ) The calculation method of (a) can be as follows:

acquisition of p _i The first line set line (p) _i ) A second line set line (eQue) to which interest points in the ordered queue eQue belong, and a third line set line (p) to which all interest points in the current visual range belong, and based on the lines (p) _i ) Line (eQue) and line (p), calculating line proportionality value Pro _line (p _i ) Wherein Pro _line (p _i ) The specific calculation formula is as follows:

in formula (7), lin (p) _i ) I represents p _i The total number of lines to which the line (pi L) represents p _i Any line belonging to, sum [ line (p) _iL )]Representing the number of points of interest, for which the line belonging to all the points of interest in the current visual range is any line, ext [ line (p _iL )]Indicating that the line to which the interest point in the ordered queue belongs isThe number of interest points of any line, t1, is a preset adjustment ratio, t1 may be an empirical value of 2, where a specific value is optional, and is not specifically limited herein.

For example, t1=2, and all points of interest p in the current visual range: (a, B, C, D, E), a third line set line (p) to which all points of interest p belong = { (L1, L2, L3), (L2, L4), (L5, L6), (L7), (L2, L8) }, equ = (a, B), line (equ) = { (L1, L2, L3), (L2, L4) }, line (p) _i ) = (L1, L2). Can calculate |line (p) _i )|＝2，sum[line(p _iL1 )]＝1，sum[line(p _iL2 )]＝3，ext[line(p _iL1 )]＝1，ext[line(p _iL2 )]=2, then Pro _line (p _i )＝0.375。

On the other hand, a spatial proportionality value corresponding to the interest points to be sorted is calculated based on the spatial distribution information. The proportionality is the number of the corresponding proportions of each class is selected according to the proportion of the data of different types. In terms of the equal proportion characteristic of the space, the space direction is divided into four directions by taking the interest points to be ordered as the center: northeast, northwest, southwest and southwest. Considering that the interest points in a certain spatial direction have higher frequency but lower weight, the weight coefficient of the interest points in the direction is dynamically increased when the target interest points are selected from wQue next time, so that the requirement of the spatial equal proportion characteristic is met. Finally, the increase and decay of the weight values is performed as a percentage of the frequency of occurrence of the spatial direction of the point of interest. Thus, the points of interest p to be ranked _i Corresponding spatial proportionality value Pro (p _i ) The calculation method of (a) can be as follows:

determining points of interest p to be ranked _i The target space direction region to which the target space direction region belongs, and calculating a space proportionality value Pro (p) based on the total number of the interest points in the target space direction region and the number of the interest points of which the space direction region to which the interest points in the ordered queue eQue belong is the target space direction region _i ) Wherein Pro (p) _i ) The specific calculation formula is as follows:

in formula (8), dir (p) _i ) Represents the target spatial direction region, sum [ dir (p) _i )]Represents dir (p) _i ) The total number of interest points in the list [ dir (p _i )]The spatial direction region to which the interest point in eQue belongs is expressed as dir (p _i ) T2 represents a preset adjustment ratio, t2 may be an empirical value of 2, and the specific value is optional and is not particularly limited herein.

Thus, based on the line proportionality value Pro _line (p _i ) The spatial proportionality value Pro (p _i ) And the interest point p to be ordered _i Target initial weight value g of (2) _pi Calculating p _i Corresponding weight value Score _pro (p _i ) Wherein, score _pro (p _i ) The specific calculation formula is as follows:

Score _pro (p _i )＝g _pi *m2*[α2*Pro _spa (p _i )+β2*Pro _line (p _i )] (6)

in the formula (6), m2 represents an adjustment coefficient, and the specific value is not particularly limited herein as the case may be; α2 represents the adjustment ratio, and the checked value 2 may be taken, as appropriate, without any particular limitation; β2 also represents an adjustment ratio, and the specific values are not specifically defined herein, as appropriate.

302: selecting a first interest point to be ranked with the highest weight value from the queue to be ranked, and determining whether shielding exists between the first interest point to be ranked and the interest points in the ranked queue; if yes, go to 303; if not, go to 304.

After the weight value corresponding to the interest points to be sorted is obtained through the method, selecting a first interest point to be sorted with the highest weight value from the queue to be sorted, and taking the first interest point to be sorted as the first interest point to be sorted when the number of the interest points to be sorted with the highest weight value is only 1; when a plurality of interest points with the highest weight value exist, the user can be reminded that a plurality of alternative first interest points to be ranked exist currently, and accordingly the first interest points to be ranked are determined according to the selection of the user.

Further, determining whether there is an occlusion between the first point of interest to be ranked and the points of interest in the ranked queue, where the specific determining method may be:

and obtaining a zoom level zoom corresponding to the current visual range, and determining a scale relationship corresponding to the current visual range based on the zoom level, for example, when zoom=13, the scale relationship is 1 cm=1 km. And obtaining an actual distance value between the first interest point to be ordered and the interest points in the ordered queue, and obtaining a scaled distance value between the first interest point to be ordered and the interest points in the ordered queue based on the actual distance value and the scale relationship.

When the icon width of the first interest point to be sorted is smaller than or equal to the zoom distance value, determining that no shielding exists between the first interest point to be sorted and the interest points in the sorted queue; and when the icon width is larger than the zoom distance value, determining that shielding exists between the first interest point to be ordered and the interest points in the ordered queue. For example, the icons of interest points are all x in width and the zoom distance value is s _b Then x is less than or equal to s _b When determining that no shielding exists between the first interest point to be ordered and the interest points in the ordered queue; at x>s _b And determining that shielding exists between the first interest point to be ordered and the interest points in the ordered queue.

303: the first point of interest to be ordered is removed from the queue to be ordered and transferred to 302.

304: and selecting the first interest point to be sorted as a target interest point.

205: points of interest in the ordered queue are shown.

206: in response to a user operation to drag or zoom the current visual range, the process proceeds to 202.

It should be noted that the method not only can be used for displaying interest points of electronic maps, such as subway stations and bus stations, but also can be used for displaying interest points of products at mobile terminals, such as 5G base station distribution and DNS server positions.

According to the interest point display method, the interest points in the current visual range are displayed based on the position distribution information and the initial weight values of the interest points, so that the real-time performance and the accuracy of the interest point display can be improved.

Based on the same inventive concept, the embodiment of the present application further provides a point of interest display device, as shown in fig. 4, which is a schematic structural diagram of the point of interest display device provided in the embodiment of the present application, where the device includes:

an obtaining module 401, configured to obtain all interest points in a current visual range, and add the all interest points to a queue to be ordered;

a first selecting module 402, configured to select a first interest point that is closest to a center point of the current visual range from all the interest points, and add the first interest point to an ordered queue;

a second selecting module 403, configured to select a target interest point from the to-be-sorted queue based on the position distribution information of the to-be-sorted interest point in the to-be-sorted queue and a target initial weight value when the number of interest points in the to-be-sorted queue is less than a preset display number and the to-be-sorted queue is not a null sequence, and add the target interest point to the to-be-sorted queue;

And a display module 404, configured to display the interest points in the ordered queue when the number of interest points in the ordered queue is equal to the preset display number, or the queue to be ordered is the empty sequence.

In one possible design, the second selection module 403 may further include: the device comprises a calculation unit, a determination unit, a deletion unit and a selection unit. As shown in fig. 5, an internal structure schematic diagram of a second selection module provided in an embodiment of the present application is exemplarily shown. The module comprises: a calculation unit 501, a determination unit 502, a deletion unit 503, and a selection unit 504.

The calculating unit 501 is configured to calculate a weight value corresponding to the to-be-sorted interest point based on the location distribution information and the target initial weight value;

the determining unit 502 is configured to select a first to-be-sorted interest point with a highest weight value from the to-be-sorted queue, and determine whether there is a shielding between the first to-be-sorted interest point and the interest point in the sorted queue;

the deleting unit 503 is configured to delete the first to-be-sorted interest point from the to-be-sorted queue if there is a barrier between the first to-be-sorted interest point and the interest point in the sorted queue;

The selecting unit 504 is configured to select the first to-be-sorted interest point as the target interest point if there is no occlusion between the first to-be-sorted interest point and the interest points in the sorted queue.

In one possible design, the computing unit 501 is specifically configured to:

/>

In one possible design, the computing unit 501 is specifically configured to:

In one possible design, the determining unit 502 is specifically configured to:

In other embodiments, in addition to the modules shown in fig. 4, a statistics module, a normalization module, a construction module, and a calculation module may be further included, as shown in fig. 6, which schematically illustrates a structural diagram of another point of interest display device provided in an embodiment of the present application. The device comprises: an acquisition module 401, a first selection module 402, a second selection module 403, a presentation module 404, a statistics module 601, a normalization module 602, a construction module 603, and a calculation module 604.

The statistics module 601 is configured to respectively count respective total passenger flow values of each interest point between a departure place and a destination in a preset period;

the normalization module 602 is configured to normalize the total passenger flow values of the respective interest points to obtain respective passenger flow parameter values of the respective interest points;

the building module 603 is configured to build a directed graph based on the departure place, the destination, and the link relationships among the points of interest, and determine a transfer matrix corresponding to the directed graph;

the calculating module 604 is configured to calculate respective initial weight values of the respective interest points based on the transfer matrix, respective passenger flow parameter values of the respective interest points, and a random browsing model formula.

It should be noted that, the above device provided in the embodiment of the present application can implement all the method steps in the embodiment of the method and achieve the same technical effects, and the details of the same parts and the advantages as those of the embodiment of the method in the embodiment are not described here.

Based on the same inventive concept, the embodiment of the present application further provides an electronic device, where the electronic device may implement the function of the point of interest display device, and referring to fig. 7, the electronic device includes:

at least one processor 701, and a memory 702 connected to the at least one processor 701, in this embodiment of the present application, a specific connection medium between the processor 701 and the memory 702 is not limited, and in fig. 7, the processor 701 and the memory 702 are connected by a bus 700 as an example. Bus 700 is shown in bold lines in fig. 7, and the manner in which the other components are connected is illustrated schematically and not by way of limitation. The bus 700 may be divided into an address bus, a data bus, a control bus, etc., and is represented by only one thick line in fig. 7 for convenience of representation, but does not represent only one bus or one type of bus. Alternatively, the processor 701 may be referred to as a controller, and the names are not limited.

In the embodiment of the present application, the memory 702 stores instructions executable by the at least one processor 701, and the at least one processor 701 may execute the point of interest display method described above by executing the instructions stored in the memory 702. The processor 701 may implement the functions of the respective modules in the apparatus shown in fig. 4 or 6.

The processor 701 is a control center of the apparatus, and may connect various parts of the entire control device using various interfaces and lines, and by executing or executing instructions stored in the memory 702 and invoking data stored in the memory 702, various functions of the apparatus and processing data, thereby performing overall monitoring of the apparatus.

In one possible design, processor 701 may include one or more processing units, and processor 701 may integrate an application processor and a modem processor, wherein the application processor primarily processes operating systems, user interfaces, application programs, and the like, and the modem processor primarily processes wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 701. In some embodiments, processor 701 and memory 702 may be implemented on the same chip, or they may be implemented separately on separate chips in some embodiments.

The processor 701 may be a general purpose processor such as a Central Processing Unit (CPU), digital signal processor, application specific integrated circuit, field programmable gate array or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, which may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method for displaying the interest points disclosed in connection with the embodiments of the present application may be directly embodied and executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.

The memory 702 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The Memory 702 may include at least one type of storage medium, and may include, for example, flash Memory, hard disk, multimedia card, card Memory, random access Memory (Random Access Memory, RAM), static random access Memory (Static Random Access Memory, SRAM), programmable Read-Only Memory (Programmable Read Only Memory, PROM), read-Only Memory (ROM), charged erasable programmable Read-Only Memory (Electrically Erasable Programmable Read-Only Memory), magnetic Memory, magnetic disk, optical disk, and the like. Memory 702 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 702 in the embodiments of the present application may also be circuitry or any other device capable of implementing a memory function for storing program instructions and/or data.

By programming the processor 701, the code corresponding to the point of interest display method described in the foregoing embodiment may be cured into the chip, so that the chip can execute the steps of the point of interest display method of the embodiment shown in fig. 1 at runtime. How to design and program the processor 701 is a technology well known to those skilled in the art, and will not be described in detail herein.

Based on the same inventive concept, embodiments of the present disclosure provide a computer storage medium, the computer storage medium including: computer program code which, when run on a computer, causes the computer to perform a point of interest display method as any of the preceding discussion. Since the principle of solving the problem by the computer storage medium is similar to that of a point of interest display method, the implementation of the computer storage medium can refer to the implementation of the method, and the repetition is omitted.

In a specific implementation, the computer storage medium may include: a universal serial bus flash disk (USB, universal Serial Bus Flash Drive), a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk or an optical disk, or the like, which can store program codes.

Based on the same inventive concept, the disclosed embodiments also provide a computer program product comprising: computer program code which, when run on a computer, causes the computer to perform a point of interest display method as any of the preceding discussion. Since the principle of the solution of the problem of the computer program product is similar to that of a point of interest display method, the implementation of the computer program product can be referred to as implementation of the method, and the repetition is omitted.

The computer program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The methods in this application may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described herein are performed in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, a network device, a user device, a core network device, an OAM, or other programmable apparatus.

The computer program or instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer program or instructions may be transmitted from one website site, computer, server, or data center to another website site, computer, server, or data center by wired or wireless means. The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that integrates one or more available media. The usable medium may be a magnetic medium, e.g., floppy disk, hard disk, tape; but also optical media such as digital video discs; but also semiconductor media such as solid state disks. The computer readable storage medium may be volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage medium.

It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, magnetic disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims

1. A method of point of interest display, the method comprising:

2. The method of claim 1, further comprising, prior to said acquiring all points of interest within the current visual range:

3. The method of claim 1, wherein the selecting the target point of interest in the to-be-sorted queue based on the location distribution information of the to-be-sorted points of interest in the to-be-sorted queue and the target initial weight value comprises:

4. The method of claim 3, wherein the determining the weight value for the point of interest to be ranked based on the location distribution information and the target initial weight value comprises:

5. The method of claim 4, wherein calculating the line diversity value corresponding to the interest point to be ranked based on the line information in the location distribution information comprises:

6. The method of claim 4, wherein the calculating the spatial diversity value corresponding to the interest point to be ranked based on the spatial distribution information in the location distribution information comprises:

7. The method of claim 4, wherein the calculating the line proportionality value corresponding to the point of interest to be ranked based on the line information comprises:

8. The method of claim 7, wherein the line proportionality value satisfies the following expression:

9. The method of claim 4, wherein the calculating the spatial proportionality value corresponding to the points of interest to be ranked based on the spatial distribution information comprises:

10. The method of claim 9, wherein the spatial proportionality value satisfies the following expression:

11. The method of claim 3, wherein the determining whether there is an occlusion between the first point of interest to be ordered and a point of interest in the ordered queue comprises:

12. A point of interest display device, the device comprising:

13. The apparatus of claim 12, wherein the apparatus further comprises:

14. The apparatus of claim 12, wherein the second selection module comprises:

15. The apparatus of claim 14, wherein the computing unit is specifically configured to:

16. The apparatus of claim 15, wherein the computing unit is specifically configured to:

17. The apparatus of claim 15, wherein the computing unit is specifically configured to:

18. The apparatus of claim 15, wherein the computing unit is specifically configured to:

19. The apparatus of claim 15, wherein the computing unit is specifically configured to:

20. The apparatus of claim 14, wherein the determining unit is specifically configured to:

21. An electronic device, comprising:

a memory for storing a computer program;

a processor for carrying out the method steps of any one of claims 1-11 when executing a computer program stored on said memory.

22. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored therein a computer program which, when executed by a processor, implements the method steps of any of claims 1-11.