Map region division method and map card punching method and device

Abstract

The invention discloses a map region division method, a map clock-in method, a map clock-in device and a computer program product. The map region division method comprises the following steps: acquiring segmentation geographic elements in a map region to be divided; dividing the to-be-divided map area into a plurality of preliminary divided areas according to the divided geographic elements; selecting areas meeting merging and screening conditions from the plurality of preliminarily divided areas to obtain a plurality of areas to be merged; and according to a preset merging mode, merging the mutually associated to-be-merged regions in the plurality of to-be-merged regions to obtain a region division result corresponding to the to-be-divided map region. Through the scheme provided by the invention, different areas can be provided for users more accurately and finely, and when the method is applied to area card punching, footprint differences among different users can be well displayed.

Description

Technical Field

[0001] This application relates to the field of computer technology, specifically to a map region division method, a map check-in method, an apparatus, and a computer program product. Background Technology

[0002] With the widespread adoption of smart mobile devices and the internet, location-based services have developed rapidly. Map applications, as a crucial component of location-based services, have evolved from simple navigation tools into comprehensive platforms integrating social, entertainment, and commercial functions. For example, "regional check-ins" on maps allow users to leave their footprints when they arrive at a location and share them with friends or the public. Regional check-ins display the area covered by the user's footprints and can even mark locations without obvious landmarks, making them widely used by the public.

[0003] Maps in related technologies are usually divided into regions according to administrative areas. This allows for the determination of the village, town, and administrative street where the user is located when performing regional check-ins or other spatiotemporal data analysis and processing, so as to record that the user has completed the check-in in that administrative area.

[0004] However, due to the differences in terrain features and scenery between different locations within the same administrative region, when using this method of dividing maps into administrative regions for regional check-ins or other spatiotemporal data analysis, it is not possible to accurately and precisely provide users with differentiated information about each region. For example, it cannot effectively display the differences in footprints between different users, thus failing to meet users' personalized regional check-in needs and resulting in a poor user experience. Summary of the Invention

[0005] This application provides a map region division method, a map check-in method, a device, and a computer program product, which can more accurately and precisely provide users with differentiated information about each region. When applied to region check-in, it can effectively display the differences in footprints between different users, thereby meeting users' personalized region check-in needs and providing a better user experience. The specific solution is as follows:

[0006] Firstly, this application provides a method for dividing a map region, the method comprising:

[0007] Obtain the segmented geographic features within the map area to be divided;

[0008] The map area to be divided is divided into multiple preliminary division areas based on the segmented geographic features;

[0009] From the multiple initially divided regions, regions that meet the merging screening criteria are selected to obtain multiple regions to be merged;

[0010] According to the preset merging method, the interconnected regions to be merged among the multiple regions to be merged are merged to obtain the region division result corresponding to the map region to be divided.

[0011] Secondly, this application provides a map-based check-in method, characterized in that the method includes:

[0012] In response to a check-in command triggered by a user when the user is at a target location, the check-in area to which the target location belongs is determined on the map, and the check-in area on the map is obtained by the map area division method described in the first aspect;

[0013] The check-in area to which the user belongs is determined as the user's checked-in area.

[0014] Thirdly, this application also provides a map region division device, the device comprising:

[0015] The acquisition unit is used to acquire segmented geographic features within the map area to be divided;

[0016] A segmentation unit is used to divide the map area to be segmented into multiple preliminary segmentation areas based on the segmented geographic features;

[0017] The merging unit is used to select regions that meet the merging filtering conditions from the multiple preliminary division regions to obtain multiple regions to be merged; according to the preset merging method, the interrelated regions to be merged among the multiple regions to be merged are merged to obtain the region division result corresponding to the map region to be divided.

[0018] Fourthly, embodiments of this application provide a computer program product, including a computer program that, when executed by a processor, implements the method as described in any one of the first to second aspects.

[0019] Compared with the prior art, this application has the following advantages:

[0020] The map region division method provided in this application embodiment obtains segmented geographic features within the map region to be divided. Based on these segmented geographic features, the map region to be divided is divided into multiple preliminary regions. In other words, the map region to be divided is conveniently and quickly divided into multiple preliminary regions using segmented geographic features as the basis. Then, regions meeting the merging filter criteria are selected from these preliminary regions to obtain multiple regions to be merged. When the preliminary regions meet the merging filter criteria, it indicates that there are fragmented areas or difficult-to-reach areas that need to be merged. The division of these areas would hinder the convenience of user check-in. This increases the complexity of user check-ins, and the regional differences between adjacent fragmented areas may be relatively small. For example, two fragmented areas may both be near a certain scenic spot, making it impossible to show the differences between the areas. This also increases the computational complexity of map regional analysis. Therefore, this application merges the interconnected areas to be merged among the multiple areas to be merged according to a preset merging method. In other words, this application merges the excessively small areas that meet the preset merging conditions, thereby significantly reducing the number of excessively small areas and reducing the number of overly fragmented areas in the map, making the final regional division results more uniform.

[0021] As can be seen, this application can conveniently and quickly divide the map area into regions based on segmented geographic features. Compared with dividing regions by administrative regions, the solution provided by this application, which divides regions by segmented geographic features, is more in line with urban planning and terrain characteristics, resulting in more reasonable regions. This facilitates spatiotemporal data analysis scenarios such as region check-in and region management based on the divided regions. This application also merges regions that meet the merging and filtering criteria, making the final divided regions more even, reasonable, and aesthetically pleasing, thus improving the user experience of region division.

[0022] When the map area division method provided in this application is applied to a map check-in scenario, since the area division in this application is more granular and conforms to urban planning and terrain characteristics, it can provide users with differentiated areas more accurately and precisely, better display the differences in footprints between different users, meet users' personalized area check-in needs, and users can also easily check in to each area, resulting in a better user experience. Attached Figure Description

[0023] Figure 1 This is a schematic diagram illustrating the application scenario of the map region division scheme provided in this application;

[0024] Figure 2 This is a flowchart illustrating an example of the map region division method provided in this application embodiment;

[0025] Figure 3 This is an example diagram in the embodiments of this application where linear geographic features are buffered outward into polygonal regions;

[0026] Figure 4 This is an example diagram illustrating the division of the map region to be divided using polygonal regions in this application embodiment;

[0027] Figure 5 This is an example diagram illustrating the merging of two regions to be merged in this application embodiment;

[0028] Figure 6 This is an example diagram of multiple first preliminary division areas divided by high-level geographic features in the embodiments of this application;

[0029] Figure 7 These are the preliminary division regions obtained by further dividing the first preliminary division region using low-level geographic features in the embodiments of this application;

[0030] Figure 8 This is a rendering of the map's divided regions after regional merging in this embodiment of the application;

[0031] Figure 9 This is an example diagram showing that there are no pathways in the areas divided in the embodiments of this application;

[0032] Figure 10 In the embodiments of this application, Figure 9 The effect after removing the blocked pathways;

[0033] Figure 11 This is an example diagram of a ramp polygon obtained by buffering linear ramp geographic features outwards in an embodiment of this application.

[0034] Figure 12 This is an example diagram of the cavity region in an embodiment of this application;

[0035] Figure 13 This is an example diagram of a narrow region in an embodiment of this application;

[0036] Figure 14 This is an example diagram illustrating the determination of the width of a narrow region using the minimum bounding box in an embodiment of this application;

[0037] Figure 15 This is an example diagram illustrating how the elongated region is determined by the ratio of the radii of the largest inscribed circle to the circumscribed circle in an embodiment of this application.

[0038] Figure 16 This is a diagram illustrating the effect of establishing a correlation between a difficult-to-enter area and a target easy-to-enter area in the embodiments of this application;

[0039] Figure 17This is a schematic diagram of the map region division device provided in the embodiments of this application;

[0040] Figure 18 This is a structural block diagram of the electronic device provided in this application. Detailed Implementation

[0041] To enable those skilled in the art to better understand the technical solutions of this application, the application will be clearly and completely described below with reference to the accompanying drawings of the embodiments. However, this application can be implemented in many other ways different from those described below. Therefore, based on the embodiments provided in this application, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of this application.

[0042] It should be noted that the terms "first," "second," "third," etc., in the claims, specification, and drawings of this application are used to distinguish similar objects and are not used to describe a specific order or sequence. Such data are interchangeable where appropriate so that the embodiments of this application described herein can be implemented in a sequence other than that shown or described herein. Furthermore, the terms "comprising," "having," and their variations are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to these processes, methods, products, or apparatuses.

[0043] To facilitate understanding of the various embodiments of this application, the application background of the embodiments will be explained.

[0044] With the widespread adoption of smart mobile devices and the internet, location-based services have developed rapidly. Map applications, as a crucial component of these services, have evolved from simple navigation tools into comprehensive platforms integrating social, entertainment, and commercial functions. Among these, "checking in" is a popular interactive method that allows users to leave their footprints at a location through an application and share them with friends or the public. Area check-ins, in particular, are widely used because they display the area covered by the user's footprints and can mark locations without obvious landmarks.

[0045] When map applications in related technologies perform area check-ins or footprint marking, they typically determine the smallest or smaller administrative region to which the user's location belongs based on the user's location. For example, they determine the village or town to which the user's location belongs, the administrative street to which the user is located, and record that the user has completed the check-in in that administrative region.

[0046] However, due to the differences in terrain features and scenery between different locations within the same administrative region, the technology that uses administrative regions for check-in cannot effectively display the differences in footprints between different users, thus failing to meet users' personalized regional check-in needs and resulting in a poor user experience.

[0047] To address the above issues, embodiments of this application provide a map region division method, a map check-in method, a device, an electronic device, a computer-readable storage medium, and a computer program product. The aim is to better display the differences in footprints among different users, thereby meeting users' personalized region check-in needs and improving user experience.

[0048] The map region division method provided in this application can be applied to map check-in scenarios as well as other spatiotemporal data analysis scenarios. For example, it can be applied to scenarios such as merchant service range estimation, food delivery range planning, and express delivery planning, etc., without specific limitations. When applied to map check-in scenarios, it can enable users to check in within their assigned region based on their current location. When applied to merchant service range estimation or food delivery range planning scenarios, it can estimate the merchant's service range or determine the merchant's food delivery range based on the merchant's assigned region and its neighboring regions, providing intelligent prediction of the service range for the merchant's business or determining a more suitable delivery range for food delivery. When applied to express delivery scenarios, it can determine the express delivery area of ​​the express delivery station based on its assigned region and its neighboring regions. Those skilled in the art can determine the specific implementation of the map region division method provided in this application in other scenarios based on actual needs, which will not be detailed here.

[0049] To facilitate understanding of the method embodiments of this application, their application scenarios are described. Please refer to... Figure 1 , Figure 1 This is a schematic diagram illustrating an application scenario of the solution provided in the embodiments of this application. This application scenario is merely an illustrative example and is not intended to limit the specific application scenario. Figure 1 As shown, in this application scenario, a server 102 and a client 101 are provided. In this embodiment, the client 101 and the server 102 establish a connection through network communication to transmit data.

[0050] Client 101 can be an electronic device with display and data processing capabilities, such as a mobile phone, tablet, smartwatch, desktop computer, smart TV, VR device, in-vehicle device, wearable device, or laptop. Client 101 has a map application installed, or a browser installed that can display a map. Client 101 receives a check-in command input by the user at their location and sends the command to server 102. Server 102 determines the corresponding area based on the user's check-in command and location, marks the corresponding area as the user's checked-in area, and sends the check-in result to the client. The check-in result can indicate whether the user has completed the check-in in the designated area. Client 101 can display a list of the user's checked-in areas and highlight the checked-in areas on the map. Client 101 can also send access requests and interactive information to server 102, so that server 102 sends the corresponding request data to client 101 for display.

[0051] Server 102 possesses high computing power. Server 102 can be a server, featuring high-speed central processing unit (CPU) computing power, long-term reliable operation, powerful input / output (I / O) external data throughput, and better scalability. Server 102 can be a single server or a server cluster. Upon receiving a user's check-in instruction, server 102 determines the corresponding area based on the user's location, marks the corresponding area as the user's checked-in area, and sends the check-in result to the client. Server 102 can also provide other specific services to client 101, such as user information access, website access, and application access, which are not specifically limited in this application.

[0052] Client 101 and server 102 can communicate using various communication systems, such as wired or wireless communication systems. Wireless communication systems can include, for example, Global System for Mobile Communications (GSM), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), General Packet Radio Service (GPRS), Long Term Evolution (LTE), LTE Frequency Division Duplex (FDD), LTE Time Division Duplex (TDD), Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX), future 5th generation (5G) systems or new radio (NR), and satellite communication systems.

[0053] Example 1

[0054] The first embodiment of this application provides a map region division method, which can be applied to a server.

[0055] like Figure 2 As shown, the map region division method provided in the first embodiment of this application includes the following steps S110 to S140.

[0056] Step S110: Obtain the segmented geographic features within the map area to be divided.

[0057] The area to be divided in the map can be a pre-defined area on the map or an area determined by an electronic device. For example, the electronic device can acquire a manually input area or select an area from a list of areas. The area to be divided can be an administrative region, such as a city or a province, or an area divided by roads. For example, the area to be divided can be the region formed by the first road to the east, the second road to the west, the third road to the south, and the third road to the north. The area to be divided can also be the entire area on the map; this application does not limit the specific geographical scope or method of determining the area to be divided.

[0058] The aforementioned geographic segmentation features are used to geographically divide areas on a map. These geographic segmentation features may include at least one of roads, waterways, railways, and bridges, but are not limited to these. Roads may include highways, main roads, secondary roads, branch roads, pedestrian streets, etc. Waterways may include rivers, canals, lakes, waterways, etc. Railways may include surface tracks (such as high-speed rail tracks, low-speed train tracks), underground tracks, etc.

[0059] In this embodiment of the application, various segmented geographic features can be pre-set in the map, and electronic devices can conveniently obtain these segmented geographic features from the map.

[0060] Step S120: Divide the map area to be divided into multiple preliminary division areas according to the segmented geographic features.

[0061] Optionally, the map area to be divided can be divided into multiple preliminary regions using the segmented geographic features as the dividing boundaries. Specifically, when the segmented geographic features are linear features such as roads or railways, the regions can be divided using roads as the dividing boundaries. Each road can divide an area into two regions: the area to the left of the road and the area to the right of the road. Here, linear features refer to geographic features represented by lines on the map.

[0062] Since roads, railways, and other geographical features sometimes have designated widths, and waterways also typically have a certain width, the map area can be divided using any boundary of these wide geographical features as the dividing line, or using the center line of the dividing feature as the dividing line, resulting in two regions on either side of the dividing line. For example, when the dividing feature is a waterway, the area can be divided using any boundary of the waterway or its center line, resulting in two regions on either side of the dividing line. Alternatively, the map area can be divided using the two outer boundaries of the wide geographical feature as dividing lines, ensuring that the divided area does not include the area corresponding to the aforementioned geographical feature. This method filters out areas that are difficult for users to reach, such as roads, railways, and waterways, or areas where staying might be dangerous, thus increasing the safety of subsequent check-in operations based on the divided areas.

[0063] In one specific embodiment, step S120 can be implemented according to the following steps S121 to S123.

[0064] Step S121: When the segmented geographic feature is a linear feature, the linear feature is buffered outward to obtain the polygonal region corresponding to the linear feature.

[0065] The aforementioned linear features can be understood as geographic features whose display width on the map is less than a preset threshold. In a map, some geographic features actually have a certain width, but they may not be displayed proportionally on the map according to the actual width of the geographic features. Instead, they are represented by lines or relatively thin strips. The display width of such geographic features on the map is usually relatively small, that is, less than the preset threshold. This application refers to these geographic features as linear features.

[0066] The aforementioned outward buffering refers to expanding linear features outwards. Specifically, for example... Figure 3As shown, the linear element can be expanded outwards by a first preset length to obtain a polygonal region corresponding to the linear element. This polygonal region is typically a long strip region, specifically a rectangle, a wave shape, or other shapes. The specific shape of the long strip region varies depending on the shape of the linear element. The first preset length can be any length between 5 meters and 50 meters, or other larger or smaller distances. This method of expanding outwards by the same distance more accurately reflects the actual area occupied by the linear element, making the area division more reasonable and accurate. Alternatively, the polygonal region corresponding to the linear element can be obtained by expanding outwards by a second preset length using the linear element as one side, or by expanding the linear element outwards by different lengths. This application does not limit the specific outward expansion method.

[0067] Step S122: Based on the polygonal region, divide the map region to be divided into multiple preliminary division regions.

[0068] Specifically, step S122 can be implemented by the following steps: performing a difference between the map region to be divided and the polygon region, so as to subtract the polygon region from the map region to be divided, so as to divide the map region to be divided into multiple preliminary division regions.

[0069] Step S123: When the segmented geographic feature is a planar feature, the map area to be segmented is divided into multiple preliminary segmentation areas based on the area corresponding to the planar feature.

[0070] Specifically, the map region to be divided can be subtracted from the region corresponding to the isometric feature by differentiating the map region to be divided, thereby dividing the map region to be divided into multiple preliminary regions.

[0071] Polygonal features can be, for example, water system geographic features, road features with proportionally displayed width, etc., and this application does not specifically limit them. Since the polygons are already displayed on the map at the same scale as their actual width, they can be directly subtracted by the difference between the map regions to be divided without the need for outward buffering.

[0072] In this embodiment of the application, the regions obtained by differentiating the map region to be divided can be determined as multiple preliminary division regions. Specifically, the regions obtained by differentiating the map region to be divided are discrete regions; this application defines these discrete regions as multiple preliminary division regions.

[0073] like Figure 4 As shown, Figure 4The diagram illustrates the process of obtaining two discrete regions by subtracting the map region to be divided from the polygon region. The method of subtracting multiple geographic features from the map region to be divided is the same as that of subtracting a single geographic feature, and is not shown in the diagram.

[0074] The process of dividing the map area to be divided into multiple preliminary regions using the above-described differential method is the process of dividing the map area to be divided using the two boundaries of the dividing geographic features with width as the dividing limits, so that the divided regions do not contain the aforementioned dividing geographic features. In this embodiment, linear features are buffered into polygons, and then the map area to be divided is differentially divided with each polygon to obtain the various discrete regions. Each of the divided discrete regions does not contain the location corresponding to the dividing geographic features. In this way, the divided regions can filter out areas that are not easily accessible to users, such as roads, railways, and waterways, or areas where staying is dangerous, making the subsequent check-in operation based on the divided regions safer.

[0075] In one specific embodiment, step S120 can be implemented according to the following steps S125 to S126.

[0076] Step S125: Based on the preset high-level geographic features in the segmented geographic features, the map area to be segmented is divided into multiple first preliminary segmentation areas.

[0077] Step S126: Divide each of the first preliminary division regions according to the preset low-level geographic features in the segmented geographic features to obtain multiple preliminary division regions corresponding to the map region to be divided.

[0078] This embodiment pre-classifies the segmented geographic features in the map into high and low levels. High-level geographic features may include administrative boundaries, main roads, highways, large rivers, lakes, etc., while low-level geographic features may include secondary roads, local water systems, etc. Secondary roads may include rural roads, branch roads, private driveways, etc., and local water systems may include small streams, ditches, etc. In this embodiment, the segmented geographic features can be classified into high and low levels based on factors such as road capacity, importance, and usage frequency. For example, roads with a road capacity exceeding a preset capacity can be identified as high-level geographic features, rivers with a width greater than a preset width can be identified as high-level features, and railways can be identified as high-level features, etc. The determination of high and low-level geographic features can be flexibly set according to actual conditions, and this application does not specifically limit it.

[0079] This embodiment divides the map area to be divided into two stages. The first stage divides the area using high-level geographic features, resulting in a large divided area, such as... Figure 6The image shows the result of dividing the map area into regions using high-level geographic features. Further subdivision using low-level geographic features yields the preliminary subdivided regions, as shown below. Figure 7 The diagram shows the preliminary subdivisions obtained by further subdividing the first preliminary subdivision area using low-level geographic elements. This phased subdivision method makes regional division more flexible, allowing for the use of different standards and methods at each stage. Furthermore, it enables further processing such as merging and filtering of subdivided areas from different stages, thus improving the flexibility and rationality of regional division.

[0080] Step S130: Select regions that meet the merging screening conditions from the multiple initially divided regions to obtain multiple regions to be merged.

[0081] The above-mentioned merging and screening conditions may include: the area of ​​the initially divided region is less than the first area threshold, the initially divided region is a difficult-to-enter region, and may also include other situations that require merging, which are not specifically limited in this application.

[0082] Because there are many different types of roads on the map, when dividing the map area into sections using side streets, pedestrian streets, and other smaller roads, such as... Figure 7 As shown, it's easy to encounter small, fragmented areas or areas that are difficult to access (such as green belts between two roads, or empty areas on ramps). These fragmented or inaccessible areas hinder user convenience for checking in, increasing the complexity of the process. Furthermore, the differences between adjacent fragmented areas may be small; for example, two fragmented areas might both be near a certain attraction. Such area division fails to showcase the differences between areas and increases the computational complexity of map area analysis. Therefore, some small, fragmented areas can be merged, i.e., area merging is achieved through steps S130 to S140. The map's corresponding area division effect after area merging according to this scheme is shown in the image below. Figure 8 As shown.

[0083] The aforementioned first area threshold can be 100m 2 ~500m 2 Any of the thresholds can be used, or other larger or smaller area thresholds, which can be flexibly set by those skilled in the art according to actual needs.

[0084] In one specific embodiment, the following step S130a may be included before step S130.

[0085] Step S130a: Select a region to be discarded from the plurality of preliminary division regions whose area is smaller than a second area threshold, and delete the region to be discarded from the plurality of preliminary division regions, wherein the second area threshold is smaller than the first area threshold.

[0086] Once the areas to be discarded are deleted, the initially divided areas will no longer contain the areas that have been deleted.

[0087] Step S130 can be implemented by following step S131.

[0088] Step S131: Select regions that meet the merging filtering conditions from the preliminary division regions after deleting the regions to be discarded, and obtain multiple regions to be merged.

[0089] Accordingly, the unmerged areas in the subsequent step S150 are the areas other than the areas to be merged in each of the preliminary division areas after deleting the areas to be discarded.

[0090] This embodiment removes areas that are too small from the initial division of regions. This allows for the early removal of some very small and fragmented areas, as these small areas have little reference value for regional data analysis. Early removal reduces the complexity of region division and makes the divided regions more uniform.

[0091] When step S120 involves preliminary region division through two stages, before step S126, the following step may be included: deleting discarded regions from multiple first preliminary division regions whose areas are smaller than the second area threshold. Step S126 can be implemented as follows: based on preset low-level geographic features in the segmented geographic features, each first preliminary division region after deleting discarded regions is divided to obtain multiple preliminary division regions from the map region to be divided. In this embodiment, excessively small faces are filtered before division in the second stage, improving the efficiency of region division and the uniformity of the final divided regions.

[0092] Step S140: According to the preset merging method, merge the interrelated regions to be merged in the multiple regions to be merged to obtain the region division result corresponding to the map region to be divided.

[0093] The interconnected regions to be merged may include adjacent regions to be merged, regions to be merged with a distance less than a first preset distance, or other different regions to be merged that can be merged.

[0094] Specifically, step S140 can merge the regions to be merged that have an adjacent relationship and meet the merging conditions corresponding to the preset merging method.

[0095] The preset merging methods may include at least one of the following: merging regions whose inter-regional distance is less than a first preset distance; merging regions whose inter-regional distance intersects after being expanded outward by a second preset distance. The merging condition corresponding to the merging method of merging regions whose inter-regional distance is less than the first preset distance is: regions whose inter-regional distance is less than the first preset distance. The merging condition corresponding to the merging method of merging regions whose inter-regional distance intersects after being expanded outward by a second preset distance is: regions whose inter-regional distance intersects after being expanded outward by a second preset distance.

[0096] The first preset distance can be any distance between 10m and 50m. The second preset distance can be the same as or different from the first preset distance.

[0097] For example, when the distance between the first region to be merged and the second region to be merged is less than the first preset distance, and the distance between the second region to be merged and the third region to be merged is less than the first preset distance, the first region to be merged and the second region to be merged meet the preset merging conditions, and the second region to be merged and the third region to be merged meet the preset merging conditions. In this case, the first region to be merged and the second region to be merged can be merged and then merged with the third region to be merged, or all three regions can be merged.

[0098] Each region to be merged is expanded outward by a second preset distance. If there is an intersection between two regions after the expansion, it means that the two regions are close enough to meet the preset merging conditions.

[0099] Merging related regions can be achieved by extending one of the two related regions into the other, thus connecting the two regions into one. This method can easily and conveniently achieve region merging.

[0100] In order to make the divided regions more accurately reflect the original area size, step S140 can merge the interrelated regions to be merged in the manner of steps S141 to S142.

[0101] Step S141: Expand the regions to be merged outward by a third preset distance to obtain expanded regions to be merged.

[0102] Step S142: Find the union of the regions that intersect in each of the expanded regions to be merged to obtain the merged region, and shrink the merged region and the expanded regions to be merged without finding the union inward by the third preset distance to obtain each merged region.

[0103] Figure 5An example diagram is shown, illustrating the process of finding the union to obtain the merged region. Figure 5 As shown, two regions to be merged are expanded outward (i.e., buffered outward) by a third preset distance to obtain two expanded regions to be merged. These two expanded regions to be merged have an intersection. Therefore, the union of these two expanded regions to be merged is taken, and then the regions are shrunk inward (i.e., buffered in reverse) by the third preset distance to obtain the merged region. The third preset distance can be the same as or different from the second preset distance mentioned above; this application does not specifically limit it.

[0104] Since step S141 expands each region to be merged outwards, in order to make the divided regions accurately reflect the actual area of ​​the region, step S142 shrinks the merged regions and the expanded regions to be merged without union calculation inwards, so that the resulting merged regions accurately reflect the original actual size of the region.

[0105] It is understandable that the merged region obtained in step S142 includes both the regions to be merged after the union operation and the regions to be merged without the union operation. In other words, the merged region obtained in step S142 can be understood as the region corresponding to each region to be merged after the merge operation has been performed.

[0106] In one implementation, in order to make the divided regions more uniform, step S140 can be implemented according to the following step S143.

[0107] Step S143: Based on a preset merging area threshold, and according to a preset merging method, merge the interconnected merging areas of the multiple merging areas into an area no larger than the merging area threshold, so as to obtain the area division result corresponding to the map area to be divided.

[0108] The merged area threshold is greater than the first area threshold.

[0109] In this embodiment, when merging regions, the interconnected regions to be merged are merged into a region that is no larger than the merged area threshold according to a preset merging method, based on the principle that the area of ​​the merged region is no larger than the merged area threshold, thus obtaining each merged region.

[0110] The area merging threshold can be set quite high; for example, it can be 3000m². 2～ 5000m 2 Any area threshold in the range can be a larger or smaller area threshold, which can be flexibly set by those skilled in the art according to actual needs.

[0111] This embodiment ensures that the merged region is not larger than the merged area threshold during region merging, thus preventing the merged region from becoming too large and resulting in a more uniform final division region.

[0112] In one specific embodiment, the above step S142 can be implemented according to the following steps S142a to S142c.

[0113] Step S142a: Find the union of the i-th union region and the intersecting region to obtain the (i+1)-th union region.

[0114] The initial value of i is 1. The first union region is the expanded region to be merged that has not been merged with other regions. The intersecting region is the expanded region to be merged that intersects with the i-th union region and has not been merged with other regions.

[0115] The first region to be merged can be any expanded region that has not been merged with other regions. The first region to be merged is the first expanded region to be merged when performing the union operation.

[0116] Step S142b: If the shrinkage area corresponding to the (i+1)th merged region is less than the merged area threshold, let i = i+1, and return to the step of finding the union of the i-th merged region and the intersecting region to obtain the (i+1)th merged region. The shrinkage area is the area of ​​the region obtained after shrinking the (i+1)th merged region inward by the first distance.

[0117] Step S142c: If the contracted area corresponding to the (i+1)th merged region is greater than or equal to the merged area threshold, the region obtained by contracting the i-th merged region inward by the second preset distance is determined as the merged region.

[0118] The above embodiment involves merging the expanded regions that have intersections in a cyclical manner until the merged region reaches the merged area threshold, at which point merging is stopped, resulting in a merged region that is no larger than the merged area threshold.

[0119] The following example illustrates steps S142a to S142c. In this example, determining the merged region includes the following steps:

[0120] Step 1: Find the union of the first union region and the intersecting region to obtain the second union region.

[0121] The first region to be merged can be any expanded region that has not been merged with other regions. The intersecting region in step 1 is an expanded region that intersects with the first region to be merged and has not been merged with other regions.

[0122] Step 2: If the shrinkage area corresponding to the second merged region is less than the merged area threshold, then proceed to step 3. If the shrinkage area corresponding to the second merged region is greater than or equal to the merged area threshold, then the region obtained by shrinking the first merged region inward by the second preset distance is determined as the merged region.

[0123] Step 3: Find the union of the second union region and the intersecting region to obtain the third union region.

[0124] The intersecting region in step 3 is the expanded region to be merged that intersects with the second region to be merged and has not been merged with other regions.

[0125] Step 4: If the shrinkage area corresponding to the third merged region is less than the merged area threshold, then proceed to step 5. If the shrinkage area corresponding to the third merged region is greater than or equal to the merged area threshold, then the region obtained by shrinking the second merged region inward by the second preset distance is determined as the merged region.

[0126] Step 5: Find the union of the third union region and the intersecting region to obtain the fourth union region.

[0127] ...The steps after step 5 are similar to steps 1 to 4 above, and are executed cyclically until the shrinkage area corresponding to the merged region is greater than or equal to the merged area threshold. The region obtained by shrinking the merged region obtained in the previous merged set inward by the second preset distance is determined as the merged region.

[0128] This embodiment merges an expanded region to be merged with its intersecting regions sequentially, and determines whether the merged area exceeds the merged area threshold each time, thus ensuring that the merged region obtained after merging does not exceed the merged area threshold.

[0129] It is understandable that after the merged region is obtained for a certain expanded region to be merged that has not been merged with other regions (i.e., a certain first merged region), it is necessary to continue to execute steps S142a to S142c for other expanded regions to be merged that have not been merged with other regions (i.e., other first merged regions) until all expanded regions to be merged have been merged.

[0130] In one specific embodiment, the following step S142A may be included before step S142a.

[0131] Step S142A: Determine at least one first merge region, wherein the distance between each first merge region is greater than a fourth preset distance, and the fourth preset distance is greater than the first preset distance and the second preset distance.

[0132] The fourth preset distance can be any distance between 3000m and 5000m, or other smaller or larger distances; this application does not specifically limit it. That is, step S142A identifies multiple first merge regions that are relatively far apart. In this case, steps S142a to S142c can be performed separately for each of the first merge regions, i.e., merging multiple expanded regions to be merged that are relatively far apart is performed simultaneously. Because the distances are relatively far, each of the first merge regions is usually located in different plots of land, and they will not be merged into one region during subsequent merging. Therefore, region merging can be performed simultaneously, improving merging efficiency.

[0133] In step S140, after merging the interconnected regions to be merged among the multiple regions to be merged, the region division result corresponding to the map region to be divided can be determined based on the unmerged region and the merged region. The division result includes each divided region corresponding to the map region to be divided. The merged region is the region obtained by merging the interconnected regions to be merged. The unmerged region is the region other than the region to be merged among the multiple preliminary divided regions.

[0134] Specifically, the unmerged regions and merged regions can be identified as the region division results corresponding to the map region to be divided. In other words, the region division result is that the region to be divided includes both the unmerged regions and the merged regions, and each unmerged region and each merged region is a corresponding region to the map region to be divided. Alternatively, the unmerged regions and merged regions can be further processed to obtain the region division result.

[0135] Optionally, after merging the interconnected regions to be merged among the multiple regions to be merged, the region division result corresponding to the map region to be divided can be obtained by following the steps S151 to S152.

[0136] Step S151: When there are no pathways in the merged region, merge the two non-path regions that were separated by the non-paths to remove the non-paths.

[0137] The merged region includes all regions corresponding to the map region to be divided after merging the interrelated regions to be merged. That is, the merged region includes either the unmerged region or the merged region. Here, "no passageway" means that there are no other roads at the end of the road, and it is impossible to access other roads via this road. Specifically, two "no-passage" regions separated by the "no-passage" designation can be directly connected to merge the two "no-passage" regions, thereby removing the "no-passage" designation. For example... Figure 9As shown, after the above steps of region division and merging, there are non-pathways between the unmerged and merged regions. The effect of removing the non-pathways is as follows. Figure 10 As shown.

[0138] Alternatively, the two blocked regions separated by the blocked pathway can be merged through the following steps S151a to S151c.

[0139] Step S151a: Expand the two blocked regions that are divided by the blocked pathways outward by a fifth preset distance so that the two blocked regions intersect.

[0140] The fifth preset distance can be the same as or different from the second preset distance. The specific range can be referred to the second preset distance. The fifth preset distance can be greater than the width of the non-path or greater than 0.5 times the width of the non-path, to ensure that the two non-path regions divided by the non-path can intersect.

[0141] Step S151b: Find the union of the two intersecting expanded discontinuous regions to obtain the union region.

[0142] Step S151c: Shrink the union region inward by the fifth preset distance to merge the two dissimilar regions.

[0143] This embodiment uses an outward expansion and inward contraction method to easily and conveniently merge different regions, while maintaining the same size as the initial region, ensuring that the size of the divided regions matches the actual size. For example... Figure 9 The image shows an example of a region division where there are no pathways. Figure 10 The image shows an example of region division after removing non-accessible areas.

[0144] Step S152: Determine the region division result corresponding to the map region to be divided based on the merged region after removing the non-pathways.

[0145] This embodiment removes the non-pathways in the divided areas, so that users can avoid the non-pathways when checking in or performing other spatiotemporal data analysis. Combining the areas on both sides of the non-pathways into one area makes it easier for users to check in or perform other spatiotemporal data analysis.

[0146] In one specific embodiment, after merging the interconnected regions to be merged among the multiple regions to be merged, the region division result corresponding to the map region to be divided can be obtained by following the steps S153 to S156.

[0147] Step S153: Identify hard-to-access areas from the merged areas.

[0148] The merged area includes all areas corresponding to the map area to be divided after merging the interrelated areas to be merged, that is, the merged area includes the aforementioned unmerged area or the aforementioned merged area. Difficult-to-access areas are used to represent areas that users cannot reach or find difficult to reach. Difficult-to-access areas are typically areas that are not allowed to be accessed by people. For example, difficult-to-access areas may include: areas between ramps and / or narrow areas between two roads, and may also include other areas that are difficult for users to access; this application does not specifically limit this. Inter-ramp areas refer to the void areas formed between adjacent ramps, such as... Figure 12 The dark-colored areas in the map are inaccessible to users. The narrow strip of land between two roads can be a green belt or other road divider area, such as... Figure 13 The area shown is a long and narrow region.

[0149] The areas between the aforementioned ramps can be identified as follows: For void areas in the merged area that are smaller than a target area threshold, the areas within each void area that meet preset adjacent ramp conditions are determined as the areas between ramps. Void areas are as follows: Figure 12 The dark areas shown are examples of adjacent ramps. The condition for an adjacent ramp can be that the distance between the cavity area and the ramp's geographical features is less than a seventh preset distance, or that the cavity area intersects with the ramp polygon. For example... Figure 11 As shown, the ramp polygon is a ramp polygon obtained by buffering the linear ramp geographic features outwards. The target area threshold can be the same as or different from the first area threshold. The specific threshold value can be referenced from the first area threshold. The seventh preset distance can be the same as or different from the second preset distance. This application does not specifically limit it.

[0150] Optionally, the aforementioned elongated region can be identified by defining the region whose width is less than a preset target width within the merged region as the elongated region. The width of the region refers to its maximum width; specifically, the width at each position along the length direction can be determined, and the maximum width is defined as the width corresponding to that region. The preset target width can be any width between 5m and 10m, or it can be smaller or larger; this application does not specifically limit it.

[0151] Alternatively, the narrow region can be identified through the following steps S153a to S153d.

[0152] Step S153a: Determine the minimum bounding boxes corresponding to the merged region and the unmerged region, respectively.

[0153] Step S153b: The region where the width of the minimum bounding box is less than the preset target width is defined as the elongated region.

[0154] The preset target width can be any width between 50m and 120m, or it can be other smaller or larger widths; this application does not specifically limit it.

[0155] Some areas may be angled. If the bounding box is determined based on the vertical and horizontal span of the angled area, the resulting bounding box may be larger than the minimum bounding box. Figure 14 As shown, Figure 14 The image on the left shows the bounding box determined by the vertical and horizontal span of the sloping region. It is not the smallest bounding box for that region. In this case, such as... Figure 14 As shown in the diagram on the right, the tilted region can be rotated to a vertical or horizontal position before determining the bounding box, thus obtaining the minimum bounding box corresponding to that region. Figure 14 If the width of the minimum bounding box of the rectangular area shown on the right is less than the preset target width (e.g., 100 meters), then the tilted rectangular area is a narrow and elongated area.

[0156] In some cases, such as Figure 15 As shown, a narrow region may have bends or corners, and the minimum bounding box of the narrow region will be relatively wide. In this case, the narrow region can be identified by following the steps S153c and S153d.

[0157] Step S153c: Determine a suspected elongated region whose minimum bounding box width is greater than or equal to the preset target width and less than the first preset width, wherein the first preset width is greater than the preset target width.

[0158] The first preset width can be any width between 140m and 200m, or it can be other smaller or larger widths; this application does not specifically limit it. For example... Figure 15 The left side shows a suspected elongated region where the width of the minimum bounding box is greater than or equal to the preset target width (100m) and less than the first preset width (150m).

[0159] If the width of the minimum bounding box is greater than or equal to the preset target width and less than the first preset width, it indicates that the region is relatively long, but does not meet the conditions for a narrow region. Therefore, it can be identified as a suspected narrow region for further precise screening.

[0160] Step S153d: Calculate the ratio of the radius of the largest inscribed circle to the radius of the circumscribed circle of the suspected elongated region. If the radius ratio is less than a preset ratio, the suspected elongated region is determined to be the elongated region.

[0161] The preset ratio is less than 1. Specifically, the preset ratio can be set to a relatively small value, such as a ratio less than 1 / 3. Figure 15As shown in the right-hand figure, the smaller the radii of the largest inscribed circle and the circumscribed circle of the suspected narrow region, the smaller the width and the longer the length of the suspected narrow region, indicating that it is more likely to be a narrow region.

[0162] This embodiment can conveniently and accurately determine whether a region is a long and narrow region by using the minimum bounding box of the region, and can accurately identify whether a region with corners or other features is a long and narrow region by using the ratio of the radius of the region's largest inscribed circle to its circumscribed circle, thus improving the accuracy of determining long and narrow regions.

[0163] Step S154: Determine the target non-difficult-to-enter region from each non-difficult-to-enter region that meets the preset association conditions with the difficult-to-enter region. The non-difficult-to-enter region is the region other than the difficult-to-enter region in the merged region.

[0164] The preset association conditions may include at least one of the following:

[0165] The non-difficult-to-enter area that intersects with the expanded difficult-to-enter area, wherein the expanded difficult-to-enter area is the area obtained by expanding the difficult-to-enter area outward by a sixth preset distance;

[0166] The nearest non-difficult-to-enter area to the aforementioned difficult-to-enter area.

[0167] Step S155: Create an association between the difficult-to-enter area and the target easy-to-enter area.

[0168] The association can be used to indicate that related regions belong to the same region, or it can be used to indicate that related regions have other associations, such as a representative relationship, meaning that one region can represent the related region. Regions establishing associations are as follows: Figure 16 As shown, Figure 16 Among the related regions, the largest area is the target easy-to-enter region, while the smaller areas are difficult-to-identify regions.

[0169] Step S156: Determine the region division result corresponding to the map region to be divided based on the merged region and the association relationship.

[0170] The region division results also include the association relationships.

[0171] Specifically, the merged region and the associated relationship can be determined as the region division result corresponding to the map region to be divided. Alternatively, the unmerged region, the merged region, and the associated relationship in the merged region can be further processed to obtain the region division result corresponding to the map region to be divided.

[0172] This embodiment establishes a correlation between difficult-to-enter areas and easy-to-enter areas, enabling users to complete check-ins in associated easy-to-enter areas without entering difficult-to-enter areas, or to perform unified regional data analysis such as population flow analysis between difficult-to-enter areas and associated easy-to-enter areas, thereby improving the convenience of data analysis.

[0173] In one embodiment, the above-mentioned map region division method may further include the following steps: setting region identifiers for the region corresponding to the map based on the landmarks contained in the region within the division result.

[0174] For example, the most popular landmark within the defined area can be used as the area identifier, or the landmark with the largest area within the defined area can be used as the area identifier; this application does not specifically limit this. Setting area identifiers for the defined areas facilitates the display and recognition of area identifiers during subsequent area check-ins or other spatiotemporal data analysis, and also facilitates spatiotemporal data analysis, recording, and other processing.

[0175] The map region division method provided in this application embodiment obtains segmented geographic features within the map region to be divided. Based on these segmented geographic features, the map region to be divided is divided into multiple preliminary regions. In other words, the map region to be divided is conveniently and quickly divided into multiple preliminary regions using segmented geographic features as the basis. Then, regions meeting the merging filter criteria are selected from these preliminary regions to obtain multiple regions to be merged. When the preliminary regions meet the merging filter criteria, it indicates that there are fragmented areas or difficult-to-reach areas that need to be merged. The division of these areas would hinder the convenience of user check-in. This increases the complexity of user check-ins, and the regional differences between adjacent fragmented areas may be relatively small. For example, two fragmented areas may both be near a certain scenic spot, making it impossible to show the differences between the areas. This also increases the computational complexity of map regional analysis. Therefore, this application merges the interconnected areas to be merged among the multiple areas to be merged according to a preset merging method. In other words, this application merges the excessively small areas that meet the preset merging conditions, thereby significantly reducing the number of excessively small areas and reducing the number of overly fragmented areas in the map, making the final regional division results more uniform.

[0176] As can be seen, this application can conveniently and quickly divide the map area into regions based on segmented geographic features. Compared with dividing regions by administrative regions, the solution provided by this application, which divides regions by segmented geographic features, is more in line with urban planning and terrain characteristics, resulting in more reasonable regions. This facilitates spatiotemporal data analysis scenarios such as region check-in and region management based on the divided regions. This application also merges regions that meet the merging and filtering criteria, making the final divided regions more even, reasonable, and aesthetically pleasing, thus improving the user experience of region division.

[0177] When the map area division method provided in this application is applied to a map check-in scenario, since the area division in this application is more granular and conforms to urban planning and terrain characteristics, it can provide users with differentiated areas more accurately and precisely, better display the differences in footprints between different users, meet users' personalized area check-in needs, and users can also easily check in to each area, resulting in a better user experience.

[0178] Example 2

[0179] The second embodiment of this application also provides a map-based check-in method, which can be applied to electronic devices, such as servers, desktop computers, laptops, mobile phones, tablets, smartwatches, smart TVs, VR devices, in-vehicle devices, wearable devices, and other electronic devices with data processing capabilities. The method includes the following steps S210 to S220.

[0180] Step S210: In response to the check-in command triggered by the user when located at the target location, determine the check-in area to which the target location belongs in the map. The check-in area in the map is obtained by the map area division method described in any one of the first embodiments.

[0181] Step S220: Determine the check-in area as the user's checked-in area.

[0182] The above map check-in method may also include the following steps S230 to S240.

[0183] Step S230: Display the check-in list in the user interface, which shows the area identifiers of each of the user's checked-in areas.

[0184] Step S240: Highlight the user's checked-in area in the map area of ​​the user interface.

[0185] Highlighting can be achieved by increasing the brightness of the display, displaying it in a different color, or highlighting the area by outlining it with a highlight, etc., and this application does not specifically limit it.

[0186] This embodiment describes the application of the map region division method from the perspective of a specific application scenario of regional check-in. The execution process of this embodiment is similar to that of the first embodiment. For details of the relevant technical features and the effects achieved, please refer to the corresponding description of the map region division method embodiment provided in the first embodiment above.

[0187] Example 3

[0188] The third embodiment of this application also provides a map region division apparatus corresponding to the map region division method embodiment provided in the first embodiment. Since the apparatus embodiment is basically similar to the method embodiment, it is described simply. For details of the relevant technical features and their effects, please refer to the corresponding descriptions of the map region division method embodiments provided above.

[0189] like Figure 17 As shown, the map region division device provided in this embodiment includes:

[0190] The acquisition unit 310 is used to acquire segmented geographic features within the map area to be divided;

[0191] The segmentation unit 320 is used to divide the map area to be segmented into multiple preliminary segmentation areas according to the segmentation geographic elements;

[0192] The merging unit 330 is used to select regions that meet the merging filtering conditions from the multiple preliminary division regions to obtain multiple regions to be merged; according to a preset merging method, it merges the interrelated regions to be merged among the multiple regions to be merged to obtain the region division result corresponding to the map region to be divided.

[0193] Example 4

[0194] The fourth embodiment of this application also provides an electronic device embodiment corresponding to the map region division method provided in the first embodiment. The following description of the electronic device embodiment is merely illustrative. The electronic device embodiment is as follows:

[0195] Please refer to Figure 18 Understanding the above electronic devices, Figure 18 This is a schematic diagram of an electronic device. The electronic device provided in this embodiment includes: a processor 1001, a memory 1002, a communication bus 1003, and a communication interface 1004;

[0196] The memory 1002 is used to store computer instructions for data processing. When these computer instructions are read and executed by the processor 1001, the following steps are performed:

[0197] Obtain the segmented geographic features within the map area to be divided;

[0198] The map area to be divided is divided into multiple preliminary division areas based on the segmented geographic features;

[0199] From the multiple initially divided regions, regions that meet the merging screening criteria are selected to obtain multiple regions to be merged;

[0200] According to the preset merging method, the interconnected regions to be merged among the multiple regions to be merged are merged to obtain the region division result corresponding to the map region to be divided.

[0201] The fifth embodiment of this application also provides an electronic device embodiment corresponding to the map check-in method provided in the second embodiment. The following description of the electronic device embodiment is merely illustrative. The electronic device embodiment is as follows:

[0202] The electronic device provided in this embodiment includes: a processor, a memory, a communication bus, and a communication interface;

[0203] This memory is used to store computer instructions for data processing. When these computer instructions are read and executed by the processor, the following steps are performed:

[0204] In response to a check-in command triggered by a user when located at a target location, the check-in area to which the target location belongs is determined in the map, and the check-in area in the map is obtained by the map area division method described in any one of the first embodiments;

[0205] The check-in area to which the user belongs is determined as the user's checked-in area.

[0206] The sixth embodiment of this application also provides a computer-readable storage medium for implementing the method described in the first embodiment. The embodiments of the computer-readable storage medium provided in this application are described in a relatively simple manner; relevant parts can be found in the corresponding descriptions of the above method embodiments. The embodiments described below are merely illustrative.

[0207] The computer-readable storage medium provided in this embodiment stores computer instructions, which, when executed by a processor, perform the following steps:

[0208] Obtain the segmented geographic features within the map area to be divided;

[0209] The map area to be divided is divided into multiple preliminary division areas based on the segmented geographic features;

[0210] From the multiple initially divided regions, regions that meet the merging screening criteria are selected to obtain multiple regions to be merged;

[0211] According to the preset merging method, the interconnected regions to be merged among the multiple regions to be merged are merged to obtain the region division result corresponding to the map region to be divided.

[0212] The seventh embodiment of this application also provides a computer program product for implementing the map region division method described in the first embodiment. The computer program product embodiments provided in this application are described in a relatively simple manner; relevant parts can be found in the corresponding descriptions of the above method embodiments. The embodiments described below are merely illustrative.

[0213] The computer program product provided in this embodiment includes a computer program, which, when executed by a processor, performs the following steps:

[0214] Obtain the segmented geographic features within the map area to be divided;

[0215] The map area to be divided is divided into multiple preliminary division areas based on the segmented geographic features;

[0216] From the multiple initially divided regions, regions that meet the merging screening criteria are selected to obtain multiple regions to be merged;

[0217] According to the preset merging method, the interconnected regions to be merged among the multiple regions to be merged are merged to obtain the region division result corresponding to the map region to be divided.

[0218] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0219] Memory may include non-persistent storage in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0220] 1. Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information by any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include non-transitory computer-readable media, such as modulated data signals and carrier waves.

[0221] 2. Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0222] Although this application discloses preferred embodiments as described above, it is not intended to limit this application. Any person skilled in the art can make possible changes and modifications without departing from the spirit and scope of this application. Therefore, the scope of protection of this application should be determined by the scope defined in the claims of this application.

Claims

1. A method for dividing a map region, characterized in that, The method includes: Obtain the segmented geographic features within the map area to be divided; The map area to be divided is divided into multiple preliminary division areas based on the segmented geographic features; From the multiple initially divided regions, regions that meet the merging screening criteria are selected to obtain multiple regions to be merged; According to the preset merging method, the interconnected regions to be merged among the multiple regions to be merged are merged to obtain the region division result corresponding to the map region to be divided.

2. The map region division method according to claim 1, characterized in that, The step of dividing the map area to be divided into multiple preliminary subdivision areas based on the segmented geographic features includes: Based on the preset high-level geographic elements in the segmented geographic elements, the map area to be segmented is divided into multiple first preliminary segmentation areas; Based on the preset low-level geographic elements in the segmented geographic elements, each of the first preliminary division regions is divided to obtain multiple preliminary division regions corresponding to the map region to be divided.

3. The map region division method according to claim 1, characterized in that, The step of dividing the map area to be divided into multiple preliminary subdivision areas based on the segmented geographic features includes: When the segmented geographic feature is a linear feature, the linear feature is buffered outward to obtain the polygonal region corresponding to the linear feature; Based on the polygonal region, the map region to be divided is divided into multiple preliminary division regions; When the segmented geographic feature is a isal feature, the map area to be segmented is divided into multiple preliminary segmentation areas based on the region corresponding to the isal feature.

4. The map region division method according to claim 1, characterized in that, The preset merging method includes at least one of the following: Merge regions whose inter-regional distance is less than the first preset distance; After expanding each region to be merged by a second preset distance outward, merge the regions that intersect.

5. The map region division method according to claim 1, characterized in that, The step of merging interconnected regions among the multiple regions to be merged according to a preset merging method includes: The regions to be merged are expanded outward by a third preset distance to obtain expanded regions to be merged. The regions that intersect in the expanded regions to be merged are combined to obtain the merged regions. The merged regions and the expanded regions to be merged that have not been combined are then shrunk inward by the third preset distance to obtain the merged regions.

6. The map region division method according to claim 5, characterized in that, The step of merging interconnected regions among the multiple regions to be merged according to a preset merging method to obtain the region division result corresponding to the map region to be divided includes: Based on a preset merging area threshold, and according to a preset merging method, the interconnected areas to be merged among the multiple areas to be merged are merged into an area no larger than the merging area threshold, so as to obtain the area division result corresponding to the map area to be divided.

7. The map region division method according to any one of claims 1 to 6, characterized in that, After merging the interconnected regions to be merged from the multiple regions to be merged, the region division result corresponding to the map region to be divided is determined by the following method: Identify hard-to-enter areas from the merged areas, wherein the merged areas include the areas corresponding to the map area to be divided after merging the interrelated areas to be merged; From each non-difficult-to-enter region, a target non-difficult-to-enter region that meets a preset association condition with the difficult-to-enter region is determined. The non-difficult-to-enter region is the region in the merged region excluding the difficult-to-enter region. Create an association between the difficult-to-enter area and the target easy-to-enter area; The region division result corresponding to the map region to be divided is determined based on the merged region and the association relationship.

8. The map region division method according to claim 7, characterized in that, The difficult-to-access areas include: the area between ramps and / or the narrow area between two roads; The area between the ramps is identified in the following way: For the void areas in the merged region whose area is smaller than the target area threshold, the areas in each void area that meet the preset adjacent ramp conditions are determined as the areas between ramps; The elongated region is identified in the following way: The region whose width is less than the preset target width in the merged region is defined as the narrow region.

9. A map-based check-in method, characterized in that, The method includes: In response to a check-in command triggered by a user when located at a target location, the check-in area to which the target location belongs is determined in the map, wherein the check-in area in the map is obtained by the map area division method according to any one of claims 1 to 8; The check-in area to which the user belongs is determined as the user's checked-in area.

10. A map region division device, characterized in that, The device includes: The acquisition unit is used to acquire segmented geographic features within the map area to be divided; A segmentation unit is used to divide the map area to be segmented into multiple preliminary segmentation areas based on the segmented geographic features; The merging unit is used to select regions that meet the merging filtering conditions from the multiple preliminary division regions to obtain multiple regions to be merged; according to the preset merging method, the interrelated regions to be merged among the multiple regions to be merged are merged to obtain the region division result corresponding to the map region to be divided.

11. A computer program product, characterized in that, include: A computer program that, when executed by a processor, implements the method as described in any one of claims 1-9.

Images