CN108228904B - Method and apparatus for outputting information - Google Patents

Method and apparatus for outputting information Download PDF

Info

Publication number
CN108228904B
CN108228904B CN201810128080.7A CN201810128080A CN108228904B CN 108228904 B CN108228904 B CN 108228904B CN 201810128080 A CN201810128080 A CN 201810128080A CN 108228904 B CN108228904 B CN 108228904B
Authority
CN
China
Prior art keywords
determining
interest point
nodes
node
preset
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810128080.7A
Other languages
Chinese (zh)
Other versions
CN108228904A (en
Inventor
翟彦青
金鑫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Baidu Netcom Science and Technology Co Ltd
Original Assignee
Beijing Baidu Netcom Science and Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Baidu Netcom Science and Technology Co Ltd filed Critical Beijing Baidu Netcom Science and Technology Co Ltd
Priority to CN201810128080.7A priority Critical patent/CN108228904B/en
Publication of CN108228904A publication Critical patent/CN108228904A/en
Application granted granted Critical
Publication of CN108228904B publication Critical patent/CN108228904B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases

Abstract

The embodiment of the application discloses a method and a device for outputting information. One embodiment of the method comprises: determining a first rectangular area with a first preset size and comprising a preset first interest point set from a first map; constructing a quadtree based on the first rectangular area; determining a second rectangular area with a second preset size and containing a first preset polygon from the first map; determining leaf nodes meeting preset conditions from leaf nodes included in the quadtree as target leaf nodes; and determining a first interest point included by a first preset polygon from first interest points included by a sub-rectangular region corresponding to the target leaf node, and outputting information related to the determined first interest point. The embodiment improves the efficiency of extracting the interest points from the map.

Description

Method and apparatus for outputting information
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to a method and a device for outputting information.
Background
An electronic map, i.e., a digital map, is a map that is digitally stored and referred to using computer technology. The electronic map is stored on a medium such as a hard disk, a floppy disk, an optical disk, or a magnetic tape of a computer, and the map content needs to be displayed, read, retrieved, analyzed, and the like by dedicated computer software.
In an electronic map application, a spatial query (i.e., querying information in a certain geometric figure) is an information query method, which is to draw a geometric figure on a map and then query information interested in the figure, i.e., POI (Point of Interest) information. The POI may refer to various geographic information points in the map, such as bank outlets, supermarkets, parks, schools, post offices, hospitals, and the like, and these public facilities are usually marked in the map in the form of points. The existing spatial query method generally adopts a point-by-point query method to determine the interest points included by the geometric figure on the map.
Disclosure of Invention
The embodiment of the application provides a method and a device for outputting information.
In a first aspect, an embodiment of the present application provides a method for outputting information, where the method includes: determining a first rectangular area with a first preset size and comprising a preset first interest point set from a first map; constructing a quadtree based on the first rectangular region, wherein each node of other nodes of the quadtree except the root node corresponds to a sub-rectangular region in the first rectangular region; determining a second rectangular area with a second preset size and containing a first preset polygon from the first map; determining leaf nodes meeting preset conditions from leaf nodes included in the quadtree as target leaf nodes, wherein the preset conditions are that sub-rectangular areas corresponding to the leaf nodes are intersected with a second rectangular area, and the sub-rectangular areas corresponding to the leaf nodes comprise at least one first interest point; and determining a first interest point included by a first preset polygon from first interest points included by a sub-rectangular region corresponding to the target leaf node, and outputting information related to the determined first interest point.
In some embodiments, determining a leaf node satisfying a preset condition as a target leaf node from among leaf nodes included in the quadtree includes: determining child nodes of root nodes of the quadtree as nodes to be extracted to obtain a node set to be extracted; the following determination steps are performed: determining leaf nodes in the node set to be extracted, wherein the corresponding sub-rectangular regions are intersected with the second rectangular region, as target leaf nodes, and determining whether at least one non-leaf node exists in the node set to be extracted; and in response to determining that at least one non-leaf node exists in the node set to be extracted, determining the child nodes of the non-leaf nodes, which are intersected by the corresponding sub-rectangular region and the second rectangular region, in the at least one non-leaf node as the nodes to be extracted, and generating the node set to be extracted according to the determined nodes to be extracted so as to continue to execute the determining step by utilizing the generated node set to be extracted.
In some embodiments, after outputting the information related to the determined first point of interest, the method further comprises: acquiring a second interest point set included by a second preset polygon in a second map; determining a difference set of the determined first interest point set and the second interest point set as a target interest point set, and outputting information related to the target interest point.
In some embodiments, the first rectangular region is a region within a minimum bounding rectangle of the first set of points of interest.
In some embodiments, the second rectangular area is an area within a minimum bounding rectangle of the first predetermined polygon.
In some embodiments, determining a first interest point included in the first preset polygon from the first interest points included in the sub-rectangular region corresponding to the target leaf node includes: for each first interest point in the first interest points included in the sub-rectangular region corresponding to the target leaf node, determining whether the first interest point is located in a first preset polygon by using a ray method, and in response to determining that the first interest point is located in the first preset polygon, determining that the first interest point is the first interest point included in the first preset polygon.
In a second aspect, an embodiment of the present application provides an apparatus for outputting information, including: a first determining unit, configured to determine, from a first map, a first rectangular area of a first preset size that includes a preset first interest point set; the construction unit is configured to construct a quadtree based on the first rectangular region, wherein each node of other nodes of the quadtree except the root node corresponds to a sub-rectangular region in the first rectangular region; a second determining unit configured to determine a second rectangular area of a second preset size, which includes the first preset polygon, from the first map; a third determining unit, configured to determine, from leaf nodes included in the quadtree, a leaf node that meets a preset condition as a target leaf node, where the preset condition is that a sub-rectangular region corresponding to the leaf node intersects with the second rectangular region, and the sub-rectangular region corresponding to the leaf node includes at least one first interest point; and the first output unit is configured to determine a first interest point included in the first preset polygon from the first interest points included in the sub-rectangular region corresponding to the target leaf node, and output information related to the determined first interest point.
In some embodiments, the third determination unit comprises: the first determining module is configured to determine child nodes of a root node of the quadtree as nodes to be extracted to obtain a node set to be extracted; a second determining module configured to perform the determining step of: determining leaf nodes in the node set to be extracted, wherein the corresponding sub-rectangular regions are intersected with the second rectangular region, as target leaf nodes, and determining whether at least one non-leaf node exists in the node set to be extracted; and the third determining module is configured to determine, in response to determining that at least one non-leaf node exists in the set of nodes to be extracted, a child node of a non-leaf node, which is in the at least one non-leaf node and in which a corresponding child rectangular region intersects with the second rectangular region, as the node to be extracted, and generate a set of nodes to be extracted according to the determined node to be extracted, so as to continue to perform the determining step by using the generated set of nodes to be extracted.
In some embodiments, the apparatus further comprises: the obtaining unit is configured to obtain a second interest point set included in a second preset polygon in a second map; a second output unit configured to determine a difference set between the determined first interest point set and the second interest point set as a target interest point set, and output information related to the target interest point.
In some embodiments, the first rectangular region is a region within a minimum bounding rectangle of the first set of points of interest.
In some embodiments, the second rectangular area is an area within a minimum bounding rectangle of the first predetermined polygon.
In some embodiments, the first output unit is further configured to: for each first interest point in the first interest points included in the sub-rectangular region corresponding to the target leaf node, determining whether the first interest point is located in a first preset polygon by using a ray method, and in response to determining that the first interest point is located in the first preset polygon, determining that the first interest point is the first interest point included in the first preset polygon.
In a third aspect, an embodiment of the present application provides an electronic device, including: one or more processors; storage means for storing one or more programs; when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the method as described in any implementation of the first aspect.
In a fourth aspect, the present application provides a computer-readable medium, on which a computer program is stored, which, when executed by a processor, implements the method as described in any implementation manner of the first aspect.
According to the method and the device for outputting the information, the quad tree is constructed based on the first rectangular area in the map, the leaf nodes of the corresponding sub-rectangular area and the second rectangular area, which are intersected, are selected from the leaf nodes of the quad tree, and finally the related information of the interest points included in the sub-rectangular area corresponding to the selected leaf nodes is output, so that the interest points are selectively extracted from the map, and the efficiency of extracting the interest points from the map is improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is an exemplary system architecture diagram in which the present application may be applied;
FIG. 2 is a flow diagram for one embodiment of a method for outputting information, in accordance with the present application;
FIG. 3A is an exemplary diagram of a first rectangular region for a method of outputting information according to the present application;
FIG. 3B is an exemplary diagram of a constructed quadtree according to a method of outputting information of the present application;
FIG. 4 is a schematic diagram of an application scenario of a method for outputting information according to the present application;
FIG. 5 is a flow diagram of yet another embodiment of a method for outputting information according to the present application;
FIG. 6 is an exemplary diagram of a targeted leaf node determination according to a method of outputting information of the present application;
FIG. 7 is a schematic block diagram illustrating one embodiment of an apparatus for outputting information according to the present application;
FIG. 8 is a block diagram of a computer system suitable for use in implementing the electronic device of an embodiment of the present application.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 illustrates an exemplary system architecture 100 to which a method for outputting information or an apparatus for outputting information of an embodiment of the present application may be applied.
As shown in fig. 1, the system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have various client applications installed thereon, such as an electronic map application, a web browser application, a shopping-like application, a search-like application, an instant messaging tool, a mailbox client, social platform software, and the like.
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting electronic map display, including but not limited to smart phones, tablet computers, electronic book readers, MP3 players (Moving Picture Experts Group Audio Layer III, motion Picture Experts compression standard Audio Layer 3), MP4 players (Moving Picture Experts Group Audio Layer IV, motion Picture Experts compression standard Audio Layer 4), laptop portable computers, desktop computers, and the like.
The server 105 may be a server that provides various services, such as a background geographic information processing server that supports an electronic map displayed on the terminal devices 101, 102, 103. The background geographic information processing server may analyze and perform other processing on the received data such as the geographic location, and feed back a processing result (e.g., the interest point set) to the terminal device.
It should be noted that the method for outputting information provided in the embodiment of the present application may be executed by the server 105, or may be executed by the terminal devices 101, 102, and 103, and accordingly, the apparatus for outputting information may be provided in the server 105, or may be provided in the terminal devices 101, 102, and 103.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation. In the case that information such as maps and points of interest which need to be processed does not need to be acquired from a remote place, the system architecture may not include a network, but only a terminal device or a server.
With continued reference to FIG. 2, a flow 200 of one embodiment of a method for outputting information in accordance with the present application is shown. The method for outputting information comprises the following steps:
in step 201, a first rectangular area of a first preset size is determined from a first map, wherein the first rectangular area comprises a preset first interest point set.
In this embodiment, an electronic device (e.g., a server or a terminal device shown in fig. 1) on which the method for outputting information operates may determine a first rectangular area of a first preset size including a preset first set of points of interest from a first map. The first map may be an electronic map obtained by the electronic device from a remote location through a wired connection manner or a wireless connection manner, or may be an electronic map stored in the electronic device.
Generally, a Point of Interest (POI) is a certain Point on an electronic map to mark a place of a government department, a commercial establishment, a tourist attraction, etc. that the Point represents. The first interest point set may be a set of interest points preset in the first map, and a corresponding position of the first interest point on the first map may be a point, or may be an area (e.g., a rectangular area) with the point as a center point. The first rectangular area may be a rectangular area of a first preset size, which is preset in the first map. As an example, the first map may be a beijing urban map, the first rectangular area may be a rectangular area containing five loops, and the first point of interest may be a coordinate point of a building within the five loops of the beijing urban area.
In some optional implementations of the present embodiment, the first rectangular region may be a region within a minimum bounding rectangle of the first point of interest set. Here, the minimum bounding rectangle is a minimum range that surrounds a plurality of two-dimensional shapes (e.g., a point, a straight line, and a polygon) expressed in two-dimensional coordinates, that is, a rectangle whose lower boundary is defined by the maximum abscissa, the minimum abscissa, the maximum ordinate, and the minimum ordinate among the vertices of a given two-dimensional shape. For example, the electronic device may determine coordinates (e.g., latitude and longitude) of each first interest point in the first interest point set, determine a maximum abscissa x1, a minimum abscissa x2, a maximum ordinate y1, and a minimum ordinate y2 from the respective coordinates, and determine the point (x1, y1) and the point (x2, y2) as diagonal points of the first rectangular region.
Step 202, constructing a quadtree based on the first rectangular area.
In this embodiment, based on the first rectangular area obtained in step 201, the electronic device may construct a quadtree. Wherein each of the other nodes of the quadtree except the root node corresponds to a sub-rectangular region in the first rectangular region.
The quadtree is a tree-shaped data structure, is often applied to analysis and classification of two-dimensional spatial data, divides the data into four quadrants, and the two-dimensional shape containing the data can be a rectangle or any other shape. In general, a parent node in a quadtree has four child nodes, and the parent node corresponds to a rectangular region in two-dimensional space, and the rectangular region is divided into four child rectangular regions, and each child rectangular region corresponds to a child node of the parent node.
Illustratively, as shown in FIG. 3A, the first rectangular area 301 includes 9 points of interest, and the 9 points of interest correspond to the points numbered 1-9 in the first rectangular area, respectively. The first rectangular region 301 is divided into four sub-rectangular regions, a, b, c, d, wherein the sub-rectangular region d is further divided into four sub-rectangular regions, d1, d2, d3, d 4. Generally, when constructing a quadtree, an end condition needs to be set in advance, and when a sub-rectangular region meets the end condition, the sub-rectangular region is not divided. The ending condition may be a preset maximum depth of the quadtree, or a maximum number of interest points included in the sub-rectangular region corresponding to each node. In this example, the termination condition is: the number of interest points included in the sub-rectangular region is less than or equal to 2. Fig. 3B is a quadtree constructed based on the first rectangular region 301, where a node R is a root node and corresponds to the first rectangular region 301, a node A, B, C, D is a child node of the root node R and corresponds to the sub-rectangular regions a, B, c, and D, and nodes D1, D2, and D3 are child nodes of a node D and correspond to the sub-rectangular regions D1, D2, and D3, respectively. Since the sub-rectangular region D4 does not include the interest point, the constructed quadtree does not include the node D4.
Step 203, a second rectangular area with a second preset size and containing the first preset polygon is determined from the first map.
In this embodiment, the electronic device may determine, from the first map, a second rectangular area of a second preset size and including a first preset polygon. The first preset polygon may be a polygon that is set in the first map in advance by a technician and reflects an outline of a certain area (e.g., a building, a lake, a park, etc.). In general, the size of the second rectangular region may be set in advance, and the second rectangular region may be included in the first rectangular region or partially intersect the first rectangular region. Illustratively, as shown in fig. 3A, the first rectangular area 301 includes a first preset polygon 302 therein, and the second rectangular area 303 includes the first preset polygon 302 therein.
In some optional implementations of the present embodiment, the second rectangular region may be a region within a minimum bounding rectangle of the first preset polygon. For example, the electronic device may determine coordinates (e.g., latitude and longitude) of each corner point of the first preset polygon, determine a maximum abscissa x3, a minimum abscissa x4, a maximum ordinate y3, and a minimum ordinate y4 from the coordinates of each corner point, and determine the points (x3, y3) and (x4, y4) as diagonal points of the second rectangular region.
And 204, determining leaf nodes meeting preset conditions from the leaf nodes included in the quadtree as target leaf nodes.
In this embodiment, based on the second rectangular area determined in step 203, the electronic device may determine, from leaf nodes included in the quadtree, a leaf node that meets a preset condition as a target leaf node. The preset condition may be that a sub-rectangular region corresponding to the leaf node intersects with the second rectangular region, and the sub-rectangular region corresponding to the leaf node includes at least one first interest point. The number of the target leaf nodes may be at least one. Generally, in a tree-type data structure, a node having no child node is referred to as a leaf node. Illustratively, as shown in fig. 3B, the nodes A, B, C, D1, D2, D3 are leaf nodes, wherein the sub-rectangular regions D1 and D2 corresponding to the nodes D1 and D2, respectively, intersect with the second rectangular region and respectively include at least one first interest point. Thus, nodes D1, D2 are target leaf nodes. It should be understood that the sub-rectangular region corresponding to the leaf node in the preset condition intersects with the second rectangular region 303, and may be that the sub-rectangular region corresponding to the leaf node partially intersects with the second rectangular region, or the sub-rectangular region corresponding to the leaf node includes the second rectangular region, or the second rectangular region includes the sub-rectangular region corresponding to the leaf node.
Step 205, determining a first interest point included in a first preset polygon from first interest points included in a sub-rectangular region corresponding to the target leaf node, and outputting information related to the determined first interest point.
In this embodiment, based on the second rectangular area determined in step 204, the electronic device may first determine a first interest point included in a first preset polygon from first interest points included in a sub-rectangular area corresponding to the target leaf node. The electronic device may determine the first interest point included in the first preset polygon by using various existing methods for determining the position relationship between the point and the polygon (e.g., a method cross product determination method, a sum of included angles test method, etc.). It should be noted that, when the first interest point is located on the boundary line of two adjacent sub-rectangular regions, the two adjacent sub-rectangular regions may both include the first interest point located on the boundary line. When the determined first set of points of interest contains the same first point of interest, one of the same first points of interest may be retained in the first set of points of interest.
The electronic device may then output information related to the determined first point of interest. Wherein, the information related to the determined first point of interest may include, but is not limited to, at least one of the following: coordinates (e.g., latitude and longitude) of the first point of interest, a name of a location characterized by the first point of interest, an address of the location characterized by the first point of interest, and the like.
Optionally, the electronic device may further send the output information related to the determined first point of interest to a preset storage area for storage, or send the information to a display device for display, or send the information to another device (such as a terminal device or a server shown in fig. 1) in communication connection with the electronic device.
In some optional implementation manners of this embodiment, the electronic device may determine, from the first interest points included in the sub-rectangular region corresponding to the target leaf node, the first interest point included in the first preset polygon according to the following steps:
for each first interest point in the first interest points included in the sub-rectangular region corresponding to the target leaf node, determining whether the first interest point is located in a first preset polygon by using a ray method, and in response to determining that the first interest point is located in the first preset polygon, determining that the first interest point is the first interest point included in the first preset polygon. It should be noted that the method for determining the position relationship between the point and the polygon by using the ray method is a well-known technique widely studied and applied at present, and is not described herein again.
With continued reference to fig. 4, fig. 4 is a schematic diagram of an application scenario of the method for outputting information according to the present embodiment. In the application scenario of fig. 4, a first map 401 (e.g., a map of the beijing city district) includes a preset set of first interest points (e.g., coordinates of landmarks in the five-loop of the beijing city district) (e.g., the set of first interest points 1-9 in fig. 4), and the electronic device first determines a first rectangular area 402 from the first map 401, where the first rectangular area 402 is a rectangular area of a preset size and including the first set of interest points. Second, the electronic device builds a quadtree 403 based on the first rectangular area 402. Wherein the root node of the quadtree 403 is a node R, the nodes A, B, C, D, D1, D2, D3 respectively correspond to the sub-rectangular regions a, b, c, D1, D2, D3 in the first rectangular region 402, and each leaf node in the quadtree 403 includes at most two first interest points. The factor rectangular area D4 does not include the first point of interest, and therefore does not include node D4 in the quadtree 403. Then, the electronic device determines a second rectangular area 405 of a second predetermined size containing a first predetermined polygon 404 (e.g., the outline of the XX building) from the first map 401. Then, the electronic device determines leaf nodes satisfying a preset condition as target leaf nodes (nodes D1, D2) from the leaf nodes (nodes A, B, C, D1, D2, D3) included in the quadtree 403, wherein the preset condition is that sub-rectangular regions corresponding to the leaf nodes intersect with the second rectangular region 405, and the sub-rectangular regions corresponding to the leaf nodes include at least one first point of interest. Finally, the electronic device determines the first interest points 2 and 9 included in the first preset polygon 404 from the first interest points 1, 2 and 9 included in the sub-rectangular region corresponding to the target leaf node, and outputs information 406 related to the first interest points 2 and 9.
According to the method provided by the embodiment of the application, the quad tree is constructed based on the first rectangular area in the map, the leaf nodes of which the corresponding sub-rectangular areas are intersected with the second rectangular area are selected from the leaf nodes of the quad tree, and finally the related information of the interest points included in the sub-rectangular areas corresponding to the selected leaf nodes is output, so that the interest points are selectively extracted from the map, and the efficiency of extracting the interest points from the map is improved.
With further reference to fig. 5, a flow 500 of yet another embodiment of a method for outputting information is shown. The process 500 of the method for outputting information includes the following steps:
step 501, a first rectangular area with a first preset size and including a preset first interest point set is determined from a first map.
In this embodiment, step 501 is substantially the same as step 201 in the corresponding embodiment of fig. 2, and is not described here again.
Step 502, constructing a quadtree based on the first rectangular region, wherein each node of other nodes of the quadtree except the root node corresponds to a sub-rectangular region in the first rectangular region.
In this embodiment, step 502 is substantially the same as step 202 in the corresponding embodiment of fig. 2, and is not described herein again.
Step 503, determining a second rectangular area with a second preset size and containing the first preset polygon from the first map.
In this embodiment, step 503 is substantially the same as step 203 in the corresponding embodiment of fig. 2, and is not described herein again.
And step 504, determining child nodes of the root node of the quadtree as nodes to be extracted, and obtaining a node set to be extracted.
In this embodiment, the electronic device on which the method for outputting information is executed may determine child nodes of the root node of the quadtree constructed in step 502 as nodes to be extracted, so as to obtain a node set to be extracted. Illustratively, referring to fig. 6, the first map 601 includes a first rectangular area 602, and reference numeral 603 is a quadtree constructed by the electronic device based on the first rectangular area 602. The electronic device determines the child node A, B, C, D of the root node R of the quadtree 603 as the node to be extracted.
Step 505, the following determination steps are performed: and determining leaf nodes in the node set to be extracted, wherein the corresponding sub-rectangular regions are intersected with the second rectangular region, as target leaf nodes, and determining whether at least one non-leaf node exists in the node set to be extracted.
In this embodiment, the electronic device may first determine, as a target leaf node, a leaf node in the node set to be extracted, where the corresponding sub-rectangular region intersects with the second rectangular region. Then, the electronic device may determine whether at least one non-leaf node exists in the node set to be extracted. For example, referring to fig. 6, in the node A, B, C, D, A, B, C is a leaf node, D is a non-leaf node, and A, B, C respectively corresponds to sub-rectangular regions a, b, and c that are not intersected with the second rectangular region 605, it is determined that none of the nodes A, B, C is the target leaf node.
Step 506, in response to determining that at least one non-leaf node exists in the node set to be extracted, determining a child node of a non-leaf node, which is located in the at least one non-leaf node and where the corresponding child rectangular region intersects with the second rectangular region, as the node to be extracted, and generating the node set to be extracted according to the determined node to be extracted, so as to continue to perform the determining step by using the generated node set to be extracted.
In this embodiment, the electronic device may first determine, as the node to be extracted, a child node of a non-leaf node, which is located in the at least one non-leaf node and where a corresponding child rectangular region intersects with the second rectangular region, in response to determining that at least one non-leaf node exists in the node set to be extracted. For example, with continued reference to fig. 6, if the sub-rectangular region D corresponding to the non-leaf node D intersects the second rectangular region, the sub-nodes D1, D2, D3 of the node D are determined as the nodes to be extracted. Then, the electronic device may generate a node set to be extracted according to the determined node to be extracted, so as to continue to perform the determining step by using the generated node set to be extracted. With continued reference to fig. 6, the electronic device may continue to perform the determining step by using the nodes D1, D2, D3 to be extracted.
If the depth of the quadtree is large, the parent node and the child node of the corresponding child rectangular region, which are not intersected with the second rectangular region, can be prevented from being determined as the node to be extracted by repeatedly executing the determining steps. For example, if the node C in fig. 6 has child nodes C1 and C2, when the determining step is performed for the second time, since the child rectangular region C corresponding to the node C does not intersect with the second rectangular region, the child node of the node C is not the node to be extracted, which can reduce the number of nodes to be extracted when the determining step is performed, thereby improving the efficiency of determining the target leaf node.
Step 507, determining a first interest point included in a first preset polygon from the first interest points included in the sub-rectangular region corresponding to the target leaf node, and outputting information related to the determined first interest point.
In this embodiment, step 507 is substantially the same as step 205 in the corresponding embodiment of fig. 2, and is not described herein again.
Step 508, a second interest point set included in a second preset polygon in the second map is obtained.
In this embodiment, the electronic device may obtain a second interest point set included in a second preset polygon in a second map. The second map may be an electronic map obtained by the electronic device from a remote location in a wired or wireless manner, or an electronic map stored in the electronic device. The second map includes a second preset polygon, and the second preset polygon includes a second interest point set. The second preset polygon may be a polygon having the same area as that reflected by the first preset polygon. For example, the first preset polygon and the second preset polygon both reflect the outline of the XX building, and the second interest point is a preset interest point inside the XX building.
Step 509, determining the difference between the determined first interest point set and the second interest point set as a target interest point set, and outputting information related to the target interest point.
In this embodiment, based on the set of first interest points determined in step 507 and the second interest point set obtained in step 508, the electronic device may first determine a difference between the determined first interest point set and the second interest point set as a target interest point set. For example, assuming that the determined first set of interest points is { a, b, c, d, e }, the second set of interest points is { a, b, c, f, g }, and the target set of interest points is { d, e }. The electronic device may then output information related to the target point of interest. The information related to the target interest point may include, but is not limited to, at least one of the following: coordinates (e.g., latitude and longitude) of the target point of interest, a name of a location characterized by the target point of interest, an address of the location characterized by the target point of interest, and the like.
In practice, the second interest point set is a set of interest points, which are preset by a technician and of which the characterized locations are located in the actual area characterized by the second preset polygon, the determined first interest point set may include interest points of which the characterized locations are not actually in the actual area characterized by the second preset polygon, and through steps 508 to 509, the interest points (i.e., dirty data) of the actual area not actually characterized by the second preset polygon may be extracted, so as to improve the accuracy of the interest points in the map used in practice.
As can be seen from fig. 5, compared with the corresponding embodiment of fig. 2, the flow 500 of the method for outputting information in the present embodiment highlights the step of determining the target leaf node and the step of determining the target interest point set. Therefore, the scheme described in this embodiment can further improve the efficiency of extracting the first interest point, and the step of extracting the target interest point makes the extracted interest point more comprehensive.
With further reference to fig. 7, as an implementation of the methods shown in the above-mentioned figures, the present application provides an embodiment of an apparatus for outputting information, which corresponds to the method embodiment shown in fig. 2, and which is particularly applicable to various electronic devices.
As shown in fig. 7, the apparatus 700 for outputting information of the present embodiment includes: a first determining unit 701 configured to determine, from a first map, a first rectangular area of a first preset size that includes a preset first interest point set; a constructing unit 702 configured to construct a quadtree based on a first rectangular region, wherein each of other nodes of the quadtree except a root node corresponds to a sub-rectangular region in the first rectangular region; a second determining unit 703 configured to determine, from the first map, a second rectangular area of a second preset size that includes the first preset polygon; a third determining unit 704, configured to determine, from leaf nodes included in the quadtree, a leaf node that meets a preset condition as a target leaf node, where the preset condition is that a sub-rectangular region corresponding to the leaf node intersects with the second rectangular region, and the sub-rectangular region corresponding to the leaf node includes at least one first interest point; the first output unit 705 is configured to determine a first interest point included in the first preset polygon from the first interest points included in the sub-rectangular region corresponding to the target leaf node, and output information related to the determined first interest point.
In the present embodiment, the first determining unit 701 of the apparatus for outputting information 700 may determine a first rectangular area of a first preset size including a preset first interest point set from the first map. The first map may be an electronic map remotely acquired by the apparatus 700 for outputting information through a wired connection or a wireless connection, or may be an electronic map stored in the apparatus 700 for outputting information.
In this embodiment, the constructing unit 702 may construct a quadtree based on the first rectangular region obtained by the first determining unit 701. Wherein each of the other nodes of the quadtree except the root node corresponds to a sub-rectangular region in the first rectangular region. The quadtree is a tree-shaped data structure, is often applied to analysis and classification of two-dimensional spatial data, divides the data into four quadrants, and the two-dimensional shape containing the data can be a rectangle or any other shape. In general, a parent node in a quadtree has four child nodes, and the parent node corresponds to a rectangular region in two-dimensional space, and the rectangular region is divided into four child rectangular regions, and each child rectangular region corresponds to a child node of the parent node.
In this embodiment, the second determining unit 703 may determine a second rectangular area of a second preset size, which includes the first preset polygon, from the first map. The first preset polygon may be a polygon that is set in the first map in advance by a technician and reflects an outline of a certain area (e.g., a building, a lake, a park, etc.). In general, the size of the second rectangular region may be set in advance, and the second rectangular region may be included in the first rectangular region or partially intersect the first rectangular region.
In this embodiment, based on the second rectangular area determined by the second determining unit 703, the third determining unit 704 may determine, as the target leaf node, a leaf node satisfying a preset condition from among leaf nodes included in the quadtree. The preset condition may be that a sub-rectangular region corresponding to the leaf node intersects with the second rectangular region, and the sub-rectangular region corresponding to the leaf node includes at least one first interest point. The number of the target leaf nodes may be at least one.
In this embodiment, based on the second rectangular area determined by the third determining unit 704, the first output unit 705 may first determine the first interest point included in the first preset polygon from the first interest points included in the sub-rectangular area corresponding to the target leaf node. The first output unit 705 may determine the first interest point included in the first preset polygon by using various existing methods (e.g., a method cross product determination method, a sum of included angles test method, etc.) for determining the position relationship between the point and the polygon. Then, the first output unit 705 may output information related to the determined first interest point. Wherein, the information related to the determined first point of interest may include, but is not limited to, at least one of the following: coordinates (e.g., latitude and longitude) of the first point of interest, a name of a location characterized by the first point of interest, an address of the location characterized by the first point of interest, and the like.
In some optional implementations of this embodiment, the third determining unit 704 may include: a first determining module (not shown in the figure), configured to determine child nodes of a root node of the quadtree as nodes to be extracted, so as to obtain a node set to be extracted; a second determining module (not shown in the figures) configured to perform the determining step of: determining leaf nodes in the node set to be extracted, wherein the corresponding sub-rectangular regions are intersected with the second rectangular region, as target leaf nodes, and determining whether at least one non-leaf node exists in the node set to be extracted; and a third determining module (not shown in the figure) configured to, in response to determining that at least one non-leaf node exists in the set of nodes to be extracted, determine a child node of a non-leaf node, of the at least one non-leaf node, where the corresponding child rectangular region intersects with the second rectangular region, as the node to be extracted, and generate a set of nodes to be extracted according to the determined node to be extracted, so as to continue to perform the determining step by using the generated set of nodes to be extracted.
In some optional implementations of this embodiment, the apparatus 700 for outputting information may further include: an obtaining unit (not shown in the figure) configured to obtain a second interest point set included in a second preset polygon in a second map; a second output unit (not shown in the figure) configured to determine a difference set between the determined first interest point set and the second interest point set as a target interest point set, and output information related to the target interest point.
In some optional implementations of this embodiment, the first rectangular region is a region within a minimum bounding rectangle of the first set of points of interest.
In some optional implementations of this embodiment, the second rectangular area is an area within a minimum bounding rectangle of the first preset polygon.
In some optional implementations of this embodiment, the first output unit 705 may be further configured to: for each first interest point in the first interest points included in the sub-rectangular region corresponding to the target leaf node, determining whether the first interest point is located in a first preset polygon by using a ray method, and in response to determining that the first interest point is located in the first preset polygon, determining that the first interest point is the first interest point included in the first preset polygon.
According to the device provided by the embodiment of the application, the quad tree is constructed based on the first rectangular area in the map, the leaf nodes of which the corresponding sub-rectangular areas are intersected with the second rectangular area are selected from the leaf nodes of the quad tree, and finally the related information of the interest points included in the sub-rectangular areas corresponding to the selected leaf nodes is output, so that the interest points are selectively extracted from the map, and the efficiency of extracting the interest points from the map is improved.
Referring now to fig. 8, shown is a block diagram of a computer system 800 suitable for use in implementing a terminal device/server according to embodiments of the present application. The terminal device/server shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 8, the computer system 800 includes a Central Processing Unit (CPU)801 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data necessary for the operation of the system 800 are also stored. The CPU 801, ROM 802, and RAM 803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.
The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program performs the above-described functions defined in the method of the present application when executed by the Central Processing Unit (CPU) 801. It should be noted that the computer readable medium described herein can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present application may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a first determining unit, a constructing unit, a second determining unit, a third determining unit, and a first output unit. Where the names of the cells do not in some cases constitute a limitation of the cell itself, for example, the first determination unit may also be described as a "cell that determines a first rectangular area of a first preset size, including a preset first set of interest points, from the first map".
As another aspect, the present application also provides a computer-readable medium, which may be contained in the electronic device described in the above embodiments; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: determining a first rectangular area with a first preset size and comprising a preset first interest point set from a first map; constructing a quadtree based on the first rectangular region, wherein each node of other nodes of the quadtree except the root node corresponds to a sub-rectangular region in the first rectangular region; determining a second rectangular area with a second preset size and containing a first preset polygon from the first map; determining leaf nodes meeting preset conditions from leaf nodes included in the quadtree as target leaf nodes, wherein the preset conditions are that sub-rectangular areas corresponding to the leaf nodes are intersected with a second rectangular area, and the sub-rectangular areas corresponding to the leaf nodes comprise at least one first interest point; and determining a first interest point included by a first preset polygon from first interest points included by a sub-rectangular region corresponding to the target leaf node, and outputting information related to the determined first interest point.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the invention. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims (14)

1. A method for outputting information, comprising:
determining a first rectangular area with a first preset size and comprising a preset first interest point set from a first map;
constructing a quadtree based on the first rectangular region, wherein each of other nodes of the quadtree except a root node corresponds to a sub-rectangular region in the first rectangular region;
determining a second rectangular area with a second preset size and containing a first preset polygon from the first map;
determining leaf nodes meeting preset conditions from the leaf nodes included in the quadtree as target leaf nodes, wherein the preset conditions are that sub-rectangular areas corresponding to the leaf nodes are intersected with the second rectangular area, and the sub-rectangular areas corresponding to the leaf nodes include at least one first interest point;
and determining a first interest point included by the first preset polygon from first interest points included by a sub-rectangular region corresponding to the target leaf node, and outputting information related to the determined first interest point.
2. The method of claim 1, wherein the determining, as the target leaf node, a leaf node satisfying a preset condition from leaf nodes included in the quadtree comprises:
determining child nodes of the root node of the quadtree as nodes to be extracted to obtain a node set to be extracted;
the following determination steps are performed: determining leaf nodes in the node set to be extracted, wherein the corresponding sub-rectangular regions of the leaf nodes intersect with the second rectangular region, as target leaf nodes, and determining whether at least one non-leaf node exists in the node set to be extracted;
in response to determining that at least one non-leaf node exists in the set of nodes to be extracted, determining child nodes of non-leaf nodes, which are intersected by the corresponding sub-rectangular region and the second rectangular region, in the at least one non-leaf node as the nodes to be extracted, and generating the set of nodes to be extracted according to the determined nodes to be extracted so as to continue to execute the determining step by utilizing the generated set of nodes to be extracted.
3. The method of claim 1, wherein after outputting information related to the determined first point of interest, the method further comprises:
acquiring a second interest point set included by a second preset polygon in a second map;
determining a difference set of the determined first interest point set and the second interest point set as a target interest point set, and outputting information related to the target interest point.
4. The method of claim 1, wherein the first rectangular region is a region within a minimum bounding rectangle of the first set of points of interest.
5. The method of claim 1, wherein the second rectangular area is an area within a minimum bounding rectangle of the first preset polygon.
6. The method according to one of claims 1 to 5, wherein the determining the first interest point included in the first preset polygon from the first interest points included in the sub-rectangular region corresponding to the target leaf node comprises:
for each first interest point in first interest points included in the sub-rectangular region corresponding to the target leaf node, determining whether the first interest point is located in the first preset polygon by using a ray method, and in response to determining that the first interest point is located in the first preset polygon, determining that the first interest point is a first interest point included in the first preset polygon.
7. An apparatus for outputting information, comprising:
a first determining unit, configured to determine, from a first map, a first rectangular area of a first preset size that includes a preset first interest point set;
a constructing unit configured to construct a quadtree based on the first rectangular region, wherein each of other nodes of the quadtree except a root node corresponds to a sub-rectangular region in the first rectangular region;
a second determining unit configured to determine, from the first map, a second rectangular area of a second preset size that includes a first preset polygon;
a third determining unit, configured to determine, from leaf nodes included in the quadtree, a leaf node that meets a preset condition as a target leaf node, where the preset condition is that a sub-rectangular region corresponding to the leaf node intersects with the second rectangular region, and the sub-rectangular region corresponding to the leaf node includes at least one first interest point;
and the first output unit is configured to determine a first interest point included in the first preset polygon from first interest points included in the sub-rectangular region corresponding to the target leaf node, and output information related to the determined first interest point.
8. The apparatus of claim 7, wherein the third determining unit comprises:
the first determining module is configured to determine child nodes of a root node of the quadtree as nodes to be extracted to obtain a node set to be extracted;
a second determining module configured to perform the determining step of: determining leaf nodes in the node set to be extracted, wherein the corresponding sub-rectangular regions of the leaf nodes intersect with the second rectangular region, as target leaf nodes, and determining whether at least one non-leaf node exists in the node set to be extracted;
and a third determining module, configured to, in response to determining that at least one non-leaf node exists in the set of nodes to be extracted, determine a child node of a non-leaf node, of the at least one non-leaf node, where a corresponding child rectangular region intersects with the second rectangular region, as the node to be extracted, and generate the set of nodes to be extracted according to the determined node to be extracted, so as to continue to perform the determining step using the generated set of nodes to be extracted.
9. The apparatus of claim 7, wherein the apparatus further comprises:
the obtaining unit is configured to obtain a second interest point set included in a second preset polygon in a second map;
a second output unit configured to determine a difference set between the determined first interest point set and the second interest point set as a target interest point set, and output information related to the target interest point.
10. The apparatus of claim 7, wherein the first rectangular region is a region within a minimum bounding rectangle of the first set of points of interest.
11. The apparatus of claim 7, wherein the second rectangular area is an area within a minimum bounding rectangle of the first preset polygon.
12. The apparatus according to one of claims 7-11, wherein the first output unit is further configured to:
for each first interest point in first interest points included in the sub-rectangular region corresponding to the target leaf node, determining whether the first interest point is located in the first preset polygon by using a ray method, and in response to determining that the first interest point is located in the first preset polygon, determining that the first interest point is a first interest point included in the first preset polygon.
13. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.
14. A computer-readable medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-6.
CN201810128080.7A 2018-02-08 2018-02-08 Method and apparatus for outputting information Active CN108228904B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810128080.7A CN108228904B (en) 2018-02-08 2018-02-08 Method and apparatus for outputting information

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810128080.7A CN108228904B (en) 2018-02-08 2018-02-08 Method and apparatus for outputting information

Publications (2)

Publication Number Publication Date
CN108228904A CN108228904A (en) 2018-06-29
CN108228904B true CN108228904B (en) 2021-08-20

Family

ID=62670816

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810128080.7A Active CN108228904B (en) 2018-02-08 2018-02-08 Method and apparatus for outputting information

Country Status (1)

Country Link
CN (1) CN108228904B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109947889A (en) * 2019-03-21 2019-06-28 佳都新太科技股份有限公司 Spatial data management method, apparatus, equipment and storage medium
CN111061824B (en) * 2019-11-27 2023-07-25 北京中交兴路信息科技有限公司 Range judging method, device and equipment based on improved quadtree

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100822814B1 (en) * 2007-07-18 2008-04-18 (주)지에스엠솔루션 Method for overlapping real-time landscape image and gis data
CN102141406A (en) * 2010-02-02 2011-08-03 北京四维图新科技股份有限公司 Method for depicting electronic navigation map and server
JP2012133245A (en) * 2010-12-23 2012-07-12 Aisin Aw Co Ltd Map display device, map display method, and computer program
CN102663033A (en) * 2012-03-23 2012-09-12 汉海信息技术(上海)有限公司 Method for searching interest points in designated area of map by hand-drawing way
CN103279539A (en) * 2013-06-04 2013-09-04 百度在线网络技术(北京)有限公司 Interest point set displaying method, electronic map displaying method, interest point set displaying device and electronic map displaying device
TW201411097A (en) * 2012-06-05 2014-03-16 Apple Inc Integrated mapping and navigation application
CN104135716A (en) * 2014-06-17 2014-11-05 百度在线网络技术(北京)有限公司 Push method and system of interest point information
CN105404685A (en) * 2015-12-09 2016-03-16 中国农业银行股份有限公司 Electronic map spatial query method and system
CN105824943A (en) * 2016-03-21 2016-08-03 立得空间信息技术股份有限公司 Method for storing mass vector data of two-dimensional map engine
CN106156138A (en) * 2015-04-10 2016-11-23 高德软件有限公司 The foundation of the spatial index of point of interest, Perimeter method and apparatus
CN106289298A (en) * 2015-05-21 2017-01-04 比亚迪股份有限公司 The display packing of point of interest and device, onboard navigation system

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100822814B1 (en) * 2007-07-18 2008-04-18 (주)지에스엠솔루션 Method for overlapping real-time landscape image and gis data
CN102141406A (en) * 2010-02-02 2011-08-03 北京四维图新科技股份有限公司 Method for depicting electronic navigation map and server
JP2012133245A (en) * 2010-12-23 2012-07-12 Aisin Aw Co Ltd Map display device, map display method, and computer program
CN102663033A (en) * 2012-03-23 2012-09-12 汉海信息技术(上海)有限公司 Method for searching interest points in designated area of map by hand-drawing way
TW201411097A (en) * 2012-06-05 2014-03-16 Apple Inc Integrated mapping and navigation application
CN103279539A (en) * 2013-06-04 2013-09-04 百度在线网络技术(北京)有限公司 Interest point set displaying method, electronic map displaying method, interest point set displaying device and electronic map displaying device
CN104135716A (en) * 2014-06-17 2014-11-05 百度在线网络技术(北京)有限公司 Push method and system of interest point information
CN106156138A (en) * 2015-04-10 2016-11-23 高德软件有限公司 The foundation of the spatial index of point of interest, Perimeter method and apparatus
CN106289298A (en) * 2015-05-21 2017-01-04 比亚迪股份有限公司 The display packing of point of interest and device, onboard navigation system
CN105404685A (en) * 2015-12-09 2016-03-16 中国农业银行股份有限公司 Electronic map spatial query method and system
CN105824943A (en) * 2016-03-21 2016-08-03 立得空间信息技术股份有限公司 Method for storing mass vector data of two-dimensional map engine

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
【[地图开发][算法及数据结构]四叉树原理;南水之源;《https://www.cnblogs.com/lyggqm/p/5230733.html》;20160301;1-2 *
基于四叉树算法的POI分级优化显示方法研究;葛银杰 等;《测绘与空间地理信息》;20170325;第40卷(第03期);161-162 *
采用密度聚类算法的兴趣点数据可视化方法;张铁映 等;《测绘科学》;20160520;第41卷(第5期);157-161 *
面向移动地图表达的POI动态综合方法研究;于艳平;《中国优秀硕士学位论文全文数据库 基础科学辑》;20130315(第03期);A008-16 *

Also Published As

Publication number Publication date
CN108228904A (en) 2018-06-29

Similar Documents

Publication Publication Date Title
CN106845470B (en) Map data acquisition method and device
US11512970B2 (en) Method and apparatus for generating information
CN110647596B (en) Map data processing method and device
CN110618982B (en) Multi-source heterogeneous data processing method, device, medium and electronic equipment
CN114676368B (en) Geographic entity information display method, device, equipment and medium based on identification code
Ellul et al. Investigating approaches to improving rendering performance of 3D city models on mobile devices
CN111881930A (en) Thermodynamic diagram generation method and device, storage medium and equipment
CN108228904B (en) Method and apparatus for outputting information
US10891319B2 (en) Easy clustering of graphs of nodes preserving node relationships
CN109446384B (en) Method and system for generating personnel organization architecture information
CN110309244B (en) Target point positioning method and device
CN108573510B (en) Grid map vectorization method and device
CN110737820A (en) Method and apparatus for generating event information
CN111177812A (en) Web map construction method and device containing closed space
CN110309239B (en) Visual map editing method and device
CN111078812B (en) Fence generation method and device and electronic equipment
CN116737852A (en) Vector tile data-based vector drawing method and device and electronic equipment
CN110619089A (en) Information retrieval method and device
CN111177588B (en) Interest point retrieval method and device
CN113487696B (en) Electronic map generation method and device, electronic equipment and storage medium
US11835356B2 (en) Intelligent transportation road network acquisition method and apparatus, electronic device and storage medium
CN116303413A (en) Data storage method and device
CN115268917B (en) Node structure diagram construction method, device, equipment and medium
US20220237474A1 (en) Method and apparatus for semanticization, electronic device and readable storage medium
EP4102466A1 (en) Collision detection method and apparatus for objects, and device and storage medium

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