Map generation method and computer program product
Patent Information
- Application Number
- CN202510293181.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-03-11
- Publication Date
- 2025-07-01
Smart Images
Figure CN120227644A_ABST
Abstract
Description
Technical Field
[0001] This specification relates to the technical field of map generation, and particularly to a map generation method and a computer program product. Background Art
[0002] In the scenario of map generation, it is often necessary to divide plots according to multiple preset points in the map, so that the generated map consists of multiple divided plots, and each plot corresponds to a preset point one by one. The preset points can be set special buildings, cities, resource points, etc. Currently, production personnel need to manually cut and adjust the map, which consumes a large amount of time and labor costs.
[0003] In view of this, some embodiments of this specification provide a map generation method and a computer program product, which can quickly and conveniently divide plots according to the distribution of preset points in the map, and flexibly adjust the adjacency state between plots as needed. Summary of the Invention
[0004] One or more embodiments of this specification provide a map generation method, including: based on the distribution of preset points, dividing the map into regions to obtain a pre-divided map, where the plots in the pre-divided map correspond to the preset points one by one; obtaining a connection line associated with the first plot and the second plot in the pre-divided map, and setting at least one additional point on the connection line; based on the distribution of the preset points and the additional points, re-dividing the map into regions to obtain a re-divided map, where the plots in the re-divided map correspond to the preset points or the additional points one by one; in the re-divided map, merging the plot corresponding to the additional point with at least one other plot to realize the switching of the adjacency state between the first plot and the second plot.
[0005] According to the method provided by one or more embodiments of this specification, in the pre-divided map, the first plot and the second plot are in a non-adjacent state; the connection line between the first preset point corresponding to the first plot and the second preset point corresponding to the second plot is set as the connection line associated with the first plot and the second plot in the pre-divided map.
[0006] According to the method provided by one or more embodiments of this specification, in the re-divided map, merging the plot corresponding to the additional point with at least one other plot to realize the switching of the adjacency state between the first plot and the second plot includes: in the re-divided map, merging the plot corresponding to the additional point with the plot corresponding to the first preset point as the updated first plot, and taking the plot corresponding to the second preset point as the updated second plot; when the updated first plot and the updated second plot have a common side, realizing the switching of the adjacency state between the first plot and the second plot from the non-adjacent state to the adjacent state.
[0007] For the method provided according to one or more embodiments of this specification, in the re-partitioned map, the plot corresponding to the added point is merged with at least one other plot to achieve the switching between the adjacent state and the non-adjacent state of the first plot and the second plot, including: in the re-partitioned map, the plot corresponding to at least part of the added points close to the first preset point is merged with the plot corresponding to the first preset point to be the updated first plot, and the plot corresponding to the remaining part of the added points is merged with the plot corresponding to the second preset point to be the updated second plot; when the updated first plot and the updated second plot have a common side, the switching of the first plot and the second plot from the non-adjacent state to the adjacent state is achieved.
[0008] For the method provided according to one or more embodiments of this specification, in the pre-partitioned map, the first plot and the second plot are in an adjacent state and have a first common side; the first common side is set to be associated with the connection line between the first plot and the second plot in the pre-partitioned map.
[0009] The method provided according to one or more embodiments of this specification further includes: in the pre-partitioned map, determining a third plot that has at least one intersection point with the first common side and is different from the first plot or the second plot, and obtaining a third preset point corresponding to the third plot; in the re-partitioned map, the plot corresponding to the added point is merged with at least one other plot to achieve the switching between the adjacent state and the non-adjacent state of the first plot and the second plot, including: taking the plot corresponding to the first preset point in the re-partitioned map as the updated first plot, and taking the plot corresponding to the second preset point in the re-partitioned map as the updated second plot; merging the plot corresponding to the added point with the plot corresponding to the third preset point in the re-partitioned map to be the updated third plot; when the updated first plot and the updated second plot do not have a common side, the switching of the first plot and the second plot from the adjacent state to the non-adjacent state is achieved.
[0010] According to the method provided by one or more embodiments of this specification, in the re-partitioned map, the plot corresponding to the added point is merged with at least one other plot to achieve the switching between the adjacent state and the non-adjacent state of the first plot and the second plot, including: taking the plot corresponding to the first preset point in the re-partitioned map as the updated first plot, and taking the plot corresponding to the second preset point in the re-partitioned map as the updated second plot; in the re-partitioned map, determining a fourth plot that has at least one common side with the plot corresponding to the added point and is different from the updated first plot or the updated second plot; merging the plot corresponding to the added point with the fourth plot in the re-partitioned map as the updated fourth plot; when the updated first plot and the updated second plot do not have a common side, realizing the switching of the first plot and the second plot from the adjacent state to the non-adjacent state.
[0011] According to the method provided by one or more embodiments of this specification, when the updated first plot and the updated second plot do not achieve the switching between the adjacent state and the non-adjacent state, increase the number of added points set on the connection line; increasing the number of added points set on the connection line includes reducing the preset distance between the added points, or randomly adding at least one added point.
[0012] According to the method provided by one or more embodiments of this specification, the distance from any point within any plot in the pre-partitioned map or the re-partitioned map to the preset point or the added point corresponding to this plot is less than the distance from the point to the preset point or the added point corresponding to other plots; the distances from any point on the common side of any two adjacent plots in the pre-partitioned map or the re-partitioned map to the preset points or the added points corresponding to the two adjacent plots are equal.
[0013] According to the method provided by one or more embodiments of this specification, the regional division of the map to obtain the pre-partitioned map and the re-regional division of the map to obtain the re-partitioned map are implemented based on the same regional division method.
[0014] According to the method provided by one or more embodiments of this specification, the regional division method includes the Voronoi diagram algorithm.
[0015] According to the method provided by one or more embodiments of this specification, the map includes multiple cities; the positions of the multiple cities in the map correspond one-to-one with the preset points.
[0016] One or more embodiments of this specification also provide a map generation system, including: a first acquisition module, configured to divide a map into regions based on the distribution of preset points to obtain a pre-partitioned map, where the plots in the pre-partitioned map correspond one-to-one to the preset points; a point addition module, configured to obtain the connection line between the first plot and the second plot in the pre-partitioned map, and set at least one additional point on the connection line; a second acquisition module, configured to re-divide the map based on the distribution of the preset points and the additional points to obtain a re-partitioned map, where the plots in the re-partitioned map correspond one-to-one to the preset points or the additional points; a plot adjustment module, configured to merge the plot corresponding to the additional point with at least one other plot in the re-partitioned map to realize the switching between the adjacent state and the non-adjacent state of the first plot and the second plot.
[0017] Some embodiments of this specification also provide a computer program product, including computer instructions or a computer program. When at least part of the computer instructions or the computer program is executed by a processor, it can implement the map generation method provided by the embodiments of this specification. BRIEF DESCRIPTION OF THE DRAWINGS
[0018] This specification will be further described by way of exemplary embodiments, which will be described in detail through the accompanying drawings. The same reference numerals in the drawings represent the same structures or steps.
[0019] Figure 1 is a schematic diagram of an application scenario of a map generation method shown in some embodiments of this specification.
[0020] Figure 2 is an exemplary flowchart of a map generation method shown in some embodiments of this specification.
[0021] Figure 3 is a schematic diagram of a pre-partitioned map shown in some embodiments of this specification.
[0022] Figure 4 is a schematic diagram of a re-partitioned map shown in some embodiments of this specification.
[0023] Figure 5 is an exemplary flowchart of switching the first plot and the second plot from the non-adjacent state to the adjacent state shown in some embodiments of this specification.
[0024] Figure 6 is a schematic diagram of the first plot and the second plot in a pre-partitioned map shown in some embodiments of this specification.
[0025] Figure 7 is a schematic diagram of a re-partitioned map before plot merging shown in some embodiments of this specification.
[0026] Figure 8 It is a schematic diagram of an updated first plot and an updated second plot shown in some embodiments of this specification.
[0027] Figure 9 It is a schematic diagram of another updated first plot and an updated second plot shown in some embodiments of this specification.
[0028] Figure 10 It is an exemplary flowchart of switching the first plot and the second plot from an adjacent state to a non - adjacent state shown in some embodiments of this specification.
[0029] Figure 11 It is a schematic diagram of the first plot and the second plot in another pre - partitioned map shown in some embodiments of this specification.
[0030] Figure 12 It is a schematic diagram of another re - partitioned map without plot merging shown in some embodiments of this specification.
[0031] Figure 13 It is a schematic diagram of a re - partitioned map after plot merging shown in some embodiments of this specification.
[0032] Figure 14 It is a schematic diagram of another re - partitioned map after plot merging shown in some embodiments of this specification.
[0033] Figure 15 It is an exemplary module diagram of a map generation system shown in some embodiments of this specification. Detailed implementation manners
[0034] To more clearly illustrate the technical solutions of the embodiments of this specification, the embodiments will be introduced in detail below with reference to the accompanying drawings. Obviously, the following description is some examples or embodiments of this specification. For those of ordinary skill in the art, without creative efforts, the technical solutions or means disclosed in this specification can also be applied to other scenarios based on these technical contents.
[0035] It should be understood that the "system", "device", "unit" and / or "module" used in this specification is a way to distinguish different components, elements, parts, portions or assemblies at different levels. However, if other words can achieve the same purpose, the above - mentioned words can be replaced by other expressions.
[0036] Unless otherwise specified, the technical terms used in this specification to describe components, elements, etc. do not specifically refer to the singular, but may also include the plural. Generally speaking, terms such as "including" and "comprising" only imply the inclusion of the clearly identified steps, elements or components, and these steps, elements and components do not constitute an exclusive list. For example, the described method or device may also include other steps or components.
[0037] In this specification, flowcharts are used to illustrate the operation steps performed by the devices or systems of related embodiments. Unless otherwise specified, the order in which these steps are described should not be construed as a limitation on the order of step execution. A person of ordinary skill in the art can adjust the order of execution of these steps based on the knowledge and information conveyed by the embodiments of this specification. The above adjustments include, but are not limited to, swapping the order of precedence, merging multiple steps, and splitting a certain step.
[0038] A map is a graphic or image that expresses the spatial distribution, connections, and changing states of various things within a certain area through a visual presentation method. For example, a two-dimensional plane map of a certain city can represent the distribution of roads and buildings in the city area on the two-dimensional plane. In the virtual game application scenario, the map can be a game map, which is used to help players locate their positions in the virtual game scenario and help players understand the distribution of various interactive objects in the virtual game scenario, so that players can better enjoy the game experience in the virtual game scenario. For example, players can obtain the positions of game objects to be raided through the game map, and then control the game characters they control to go to the positions of the game objects for game raids. In a strategic type game (Strategy Game, SLG) or other games with similar gameplay designs, the map can be composed of multiple plots obtained based on regional division, and each plot corresponds to a preset point in the map, where each preset point can correspond to an interactive game resource in the game, such as a city that can be occupied, a resource point or a supply point that can be occupied, etc. Players can select plots with different game resources on the map to occupy and / or attack, and increase the chance of winning the game by occupying more or more strategically significant plots. To implement the above game scenario settings, map generation processing including map area division needs to be performed in advance.
[0039] Figure 1 is a schematic diagram of an application scenario of a map generation method shown according to some embodiments of this specification. As Figure 1 shown, the application scenario 100 may include a server 110, a network 120, a storage medium 130, and a terminal device 140. The server 110 and the terminal device 140 can transmit data through the network 120.
[0040] Among them, the server 110 can be a computer device with relatively high computing performance, which is used to provide the required material content for map generation according to user operations or other instruction information, or to render and generate a visual map, or to provide the generated map to other terminal devices in need for display. In some embodiments, the server 110 can be a single computer device or a computing cluster composed of multiple computer devices, so as to provide more powerful computing power and more efficient response to related operations in the map generation process.
[0041] The network 120 can be any form of wired or wireless network, or any combination thereof. By way of example only, the network 120 can be one or more combinations of a wired network, a fiber optic network, a telecommunications network, an internal network, the Internet, a local area network (LAN), a wide area network (WAN), a wireless local area network (WLAN), a metropolitan area network (MAN), a wide area network (WAN), a public switched telephone network (PSTN), a Bluetooth network, etc. The network 120 can have multiple access points, and the server 110 and the terminal device 140 can access the network 120 through the access points.
[0042] The storage medium 130 can be used to store relevant data and / or instructions. In some embodiments, the storage medium 130 can store the material content required for map generation, the algorithm program required for map generation, the generated visual map, etc. In some embodiments, the storage medium 130 can include one or more storage components, and each storage component can be an independent device or a part of other devices. In some embodiments, the storage medium 130 can be provided in the server 110. In some embodiments, the storage medium 130 can be provided in the terminal device 140. In some embodiments, the storage medium 130 can include a random access memory (RAM), a read-only memory (ROM), a mass storage device, a removable storage device, a volatile read-write memory, etc. or any combination thereof. Exemplarily, the mass storage device can include a magnetic disk, an optical disk, a solid state disk, etc. In some embodiments, the storage medium 130 can be implemented on a cloud platform.
[0043] The terminal device 140 can include, but is not limited to, electronic devices with a graphical user interface such as a desktop computer, a smart phone, a laptop computer, a game console, and a tablet computer. The terminal device 140 can obtain user operations or other instruction information through a human-machine interface device, where the human-machine interface device can be a part of the terminal device 140 or can be separated from the terminal device 140, but there is a signal connection between them. The terminal device 140 can perform related operations for map generation such as obtaining and calling map generation materials, dividing regions of the map, and performing image processing operations on the visual map to be generated. In Figure 1In the application scenario 100 shown, the terminal device 140 can have a signal connection with the server 110 through the network 120. A user can obtain the material content required for map generation from the server 110, or perform rendering operations for map generation or other image processing operations through the server 110.
[0044] It should be noted that Figure 1 The schematic diagram of the application scenario of the map generation method shown is only an example. The application scenario of the map generation method described in the embodiments of this specification is to more clearly illustrate the technical solutions of the embodiments of this specification, and does not constitute a limitation on the technical solutions provided in the embodiments of this specification. For example, in a scenario where map generation is performed only through the terminal device 140, Figure 1 the server 110 and the network 120 shown can be omitted, and the storage medium 130 can be set in the terminal device 140 to cooperate with the application installed on the terminal device 140 to generate a map; for another example, in a scenario where map generation is performed only through the server 110, Figure 1 the terminal device 140 and the network 120 shown can be omitted, and the storage medium 130 can be set in the server 110 to cooperate with the application installed on the server 110 to generate a map. Those of ordinary skill in the art know that with the evolution of the devices required for map generation and the emergence of new business scenarios, the technical solutions provided in the embodiments of this specification are equally applicable to similar technical problems.
[0045] In the current map generation scenario, it is often necessary for production personnel to divide the map into blocks manually according to the distribution of preset points (such as set special buildings, cities, resource points, etc.) in the map, so that each plot corresponds to a preset point in the map. As the area of the map increases and the number of preset points in the map increases, it often requires multiple production personnel to spend a lot of time on map block division. At the same time, during the map generation process, it is often necessary to adjust the adjacency relationship between plots multiple times according to different planning requirements to meet the corresponding game settings, which also requires production personnel to repeat the manual cutting of the plots to be adjusted multiple times, consuming a large amount of time and labor costs.
[0046] In view of this, the embodiments of this specification provide a map generation method and a computer program product, which can assist production personnel to quickly and conveniently achieve the division of map plots and flexibly adjust the adjacency state between plots according to needs, greatly saving the labor and time costs in the map generation stage.
[0047] Figure 2 It is an exemplary flowchart of a map generation method according to some embodiments of this specification. In some embodiments, Figure 2The process 200 shown can be executed by a terminal device. For example, it can be executed by a terminal device 140 as shown in Figure 1 ; or, Figure 2 the process 200 shown can also be executed by other processing devices. For example, it can be executed by a server 110 as shown in Figure 1 ; or, Figure 2 the process 200 shown can be jointly executed by a terminal device and other processing devices. For example, it can be jointly executed by a terminal device 140 and a server 110 as shown in Figure 1 . In some embodiments, the process 200 can be implemented by a map generation system 1500 deployed on a processing device and / or a terminal device.
[0048] In some embodiments, as shown in Figure 2 , the process 200 may include the following steps.
[0049] Step 210: Based on the distribution of preset points, divide the map into regions to obtain a pre-partitioned map, where the plots in the pre-partitioned map correspond one-to-one with the preset points. In some embodiments, step 210 can be implemented by a first acquisition module 1510.
[0050] In some embodiments, the preset points can be pre-set by a production staff in the map, and during the subsequent map generation process, the relative setting positions of each preset point in the map remain unchanged, that is, the distribution of the preset points in the map remains unchanged. For example, each preset point can be preset according to the positions of each city in the game on the game map. In some embodiments, the pre-partitioned map can be obtained by dividing the regions according to the relative setting positions of the preset points in the map. The pre-partitioned map consists of multiple plots; each plot in the pre-partitioned map can contain a preset point, and each plot in the pre-partitioned map can correspond one-to-one with the preset point contained therein. For example, the pre-partitioned map is obtained by dividing the regions according to the positions of the cities on the game map, and each plot corresponds to a city. In some embodiments, each plot can also correspond to multiple preset points according to the game planning requirements, and the relationship between the plot and the preset points can be one-to-many, which is not limited herein.
[0051] Figure 3 is a schematic diagram of a pre-partitioned map according to some embodiments of this specification. In some embodiments, as shown in Figure 3 , the pre-partitioned map 300 contains multiple plots 310, each plot 310 contains and only contains one preset point 311, and each plot 310 corresponds one-to-one with the preset point 311 contained therein.
[0052] In some embodiments, in the process of dividing a map into regions, the acquisition of divided plots can be carried out according to the following rules: for any point within any plot, the distance to the preset point corresponding to the local plot is less than the distance to the preset points corresponding to other plots; and for any point on the common side of any two adjacent plots, the distances to the preset points corresponding to the two adjacent plots are equal. For example, in the pre-divided map 300 as shown in Figure 3 , for the first plot 310a corresponding to the first preset point A, the distance from any point in the first plot 310a to the first preset point A is less than the distance from the any point to other preset points (e.g., the preset point 311) in the pre-divided map; and for the first plot 310a and the adjacent third plot 310c, for any point on the common side 312 of the first plot 310a and the third plot 310c, the distances to the first preset point A corresponding to the first plot 310a and the third preset point C corresponding to the third plot 310c are equal. Dividing the region based on the above rules is equivalent to dividing the plot around each preset point, so that each obtained plot contains a corresponding preset point.
[0053] In some embodiments, based on a preset region division method, the automatic division of the map can be realized according to the distribution of preset points, so as to replace the manual cutting method by the production staff to divide the map into blocks, thereby quickly and conveniently realizing the plot division and obtaining the pre-divided map. In some embodiments, the region division method can be configured as the Voronoi diagram algorithm. The Voronoi diagram algorithm is a spatial segmentation algorithm that can divide the plane into multiple regions based on a preset number of generating points. Each obtained region contains a generating point, that is, the obtained regions can be in one-to-one correspondence with the generating points contained therein; for a region obtained by the Voronoi diagram algorithm, all points therein are closer to the generating point corresponding to the region than points in other regions. This division method ensures the independence of each region, so that the points in each region are the closest to the generating point corresponding to the current region. In some embodiments, when using the Voronoi diagram algorithm to divide the map to obtain the pre-divided map, the preset points can be used as the generating points in the Voronoi diagram algorithm for region division; for a fixed distribution of preset points, the pre-divided map generated by the Voronoi diagram algorithm is unique. In some embodiments, other spatial segmentation algorithms other than the Voronoi diagram algorithm can also be used to obtain the pre-divided map, which is not limited herein.
[0054] In some embodiments, the pre-partitioned map can be applied as a game map in the scenario of a strategy game (SLG). The map can include multiple cities, and the positions of these cities in the map can correspond one-to-one with preset points. That is, the preset points can be set according to the positions of the cities in the map, and regional division can be performed according to the distribution of the preset points to obtain the pre-partitioned map. Each plot in the pre-partitioned map corresponds one-to-one with the city included in the plot. When a player occupies a certain city during the play of the strategy game, it is equivalent to occupying the plot corresponding to the city. The player can further perform game operations such as offensive operations, alliance operations, material transportation operations, and troop transportation operations on other plots adjacent to the plot. And according to the requirements of the game scenario, the game can also be designed so that the player cannot directly initiate offensive operations and other game operations on other plots that are not adjacent to the occupied plot. In some embodiments, the map can also include multiple game resource acquisition points, such as a mine resource point for acquiring ore resources in the game, a food resource point for acquiring food resources in the game, etc. The positions of the multiple game resource acquisition points in the map can also be set as preset points and have a one-to-one correspondence.
[0055] Step 220: Obtain the connection line associated with the first plot and the second plot in the pre-partitioned map, and set at least one additional point on the connection line. In some embodiments, step 220 can be implemented by the point addition module 1520.
[0056] In some embodiments, for the obtained pre-partitioned map, if the adjacency relationships between the plots in the pre-partitioned map all meet the preset adjacency / non-adjacency requirements, the pre-partitioned map can be directly used as the generated map and applied to corresponding application scenarios such as virtual games. If the adjacency relationship between two or some plots in the pre-partitioned map fails to meet the preset adjacency / non-adjacency requirements, for example, there is no common side between the plots corresponding to two preset points that need to be adjacent, or there is a common side between the plots corresponding to two preset points that need to be spaced apart, it is necessary to adjust the size and / or shape of these plots so that the adjusted plot distribution meets the preset adjacency / non-adjacency requirements. In some embodiments, the preset adjacency / non-adjacency requirements can be set by the production staff.
[0057] In some embodiments, the first plot and the second plot can be a pair of plots in the pre-partitioned map that do not meet the preset adjacency / non-adjacency requirements. For example, according to the preset adjacency requirements, such as Figure 3 the first plot 310a and the second plot 310b in the pre-partitioned map described above should be two adjacent plots, and in such as Figure 3In the pre-partitioned map 300 shown, the first plot 310a and the second plot 310b are in a non-adjacent state and do not meet the preset adjacency requirement. Therefore, it is necessary to adjust the size and / or shape of the first plot and the second plot so that the adjusted first plot and the second plot are adjacent to meet the preset adjacency requirement. During the process of adjusting the size and / or shape of the first plot and the second plot as described above, at least one additional point can be selected on the line connecting the first plot and the second plot, and the map can be re-partitioned according to the distribution of the additional points and the preset points. Finally, in the re-partitioned map, the updated first plot and the second plot are re-determined according to certain rules to achieve the switching between the adjacent state and the non-adjacent state between the first plot and the second plot. In some embodiments, the line connecting the first plot and the second plot can be set according to the adjacent / non-adjacent state of the first plot and the second plot in the pre-partitioned map. For example, when the first plot and the second plot are in a non-adjacent state in the pre-partitioned map, the line can be the line connecting the first preset point corresponding to the first plot and the second preset point corresponding to the second plot. For example, as Figure 3 shown in the pre-partitioned map 300, the line connecting the first plot 310a and the second plot 310b can be the line 313 between the first preset point A and the second preset point B; or when the first plot and the second plot are in an adjacent state in the pre-partitioned map, the line can be a common side of the first plot and the second plot. In some embodiments, the additional points are at least one point randomly set on the line or at least one point set on the line according to certain rules. These additional points are added to adjust the adjacent / non-adjacent state of the first plot and the second plot. For example, in the pre-partitioned map 300 shown in Figure 3 , at least one additional point 314 is set on the line 313 connecting the first plot 310a and the second plot 310b. The specific settings of the line connecting the first plot and the second plot and the additional points will be described in detail later and will not be elaborated here.
[0058] Step 230: Based on the distribution of the preset points and the additional points, re-partition the map to obtain a re-partitioned map, where the plots in the re-partitioned map correspond one-to-one to the preset points or the additional points. In some embodiments, step 230 can be implemented by the second acquisition module 1530.
[0059] In some embodiments, during the process of re - dividing the map, the acquisition of divided plots can be carried out according to the following rules: in the re - divided map, for any point within any plot, the distance to the preset point or the added point corresponding to this plot is less than the distance to the preset point or the added point corresponding to other plots; and for any point on the common edge of any two adjacent plots, the distance to the preset point or the added point corresponding to the two adjacent plots is equal. Based on the above rules for regional division, it is equivalent to dividing plots around each preset point and added point, so that each divided plot contains a corresponding preset point or added point.
[0060] In some embodiments, during the process of re - dividing the map, the same regional division method as that for obtaining the pre - divided map can be adopted, and the map can be automatically regionally divided according to the distribution of preset points and added points, so as to replace the way that the production staff manually cuts the map into blocks, thereby quickly and conveniently realizing the re - division of plots. In some embodiments, the regional division method can be configured as the Voronoi diagram algorithm.
[0061] Figure 4 is a schematic diagram of a re - divided map shown according to some embodiments of this specification. In some embodiments, as Figure 4 shown, the re - divided map 400 includes multiple plots 410, and each plot 410 contains and only contains one preset point 311 or one added point 314. Comparing Figure 3 and Figure 4 it can be seen that in the pre - divided map 300 and the re - divided map 400, the number of preset points 311 (i.e., the solid black dots in Figure 3 and Figure 4 ) and their distribution in the map area have not changed at all; in the re - divided map 400, based on three added points 314, three plots corresponding to the three added points 314 are newly formed, and the size and / or shape of the plots corresponding to some preset points 311 can also be updated according to the regional division. For example, as Figure 4 shown, the first plot 410a corresponding to the first preset point A in the re - divided map 400 has also changed in size and shape compared with the first plot 310a corresponding to the first preset point A in the pre - divided map 300 as Figure 3 shown.
[0062] Step 240: In the re - divided map, merge the plot corresponding to the added point with at least one other plot to realize the switching between the adjacent state and the non - adjacent state of the first plot and the second plot. In some embodiments, step 240 can be implemented by the plot adjustment module 1540.
[0063] In some embodiments, it is possible to merge the plot corresponding to the added point with at least one other plot in the re-partitioned map to achieve the switching between the adjacent state and the non-adjacent state of the first plot and the second plot. In some embodiments, it is possible to merge the plot corresponding to the added point with the plot corresponding to at least one preset point in the re-partitioned map, so that each plot in the merged re-partitioned map can correspond one-to-one with the preset points, in order to obtain the required generated map. In some embodiments, during the process of merging the plot corresponding to the added point with at least one other plot, it is possible to adjust the size and / or shape of the first plot and / or the second plot by merging the plot area corresponding to the added point with the first plot and / or the second plot, or by excluding the plot area corresponding to the added point from the first plot and / or the second plot, and make the adjacent / non-adjacent state of the adjusted first plot and second plot meet the preset adjacent / non-adjacent requirements. For example, according to the preset requirements of the game planner, the first plot 310a and the second plot 310b should be two adjacent plots, but in the pre-partitioned map 300 as shown in Figure 3 the first plot 310a corresponding to the first preset point A and the second plot 310b corresponding to the second preset point B are in a non-adjacent state, not meeting the preset adjacent / non-adjacent requirements; while in the re-partitioned map 400 as shown in Figure 4 it is possible to merge the entire plot 410a corresponding to the added point 314 with the plot corresponding to the first preset point A as the updated first plot corresponding to the first preset point A, and the updated first plot and the updated second plot corresponding to the second preset point B are switched from the non-adjacent state to the adjacent state, thus achieving the preset adjacent requirements. The above preset requirements can be input by the production staff or preset by the game. The specific implementation method of merging the plot corresponding to the added point with at least one other plot will be described in detail later and will not be elaborated here.
[0064] Through the above steps 210 to 240, it is possible to achieve the switching between the adjacent state and the non-adjacent state of the selected first plot and second plot in the map, enabling the user to flexibly adjust the adjacent / non-adjacent state between the plots in the map according to the actual planning needs. The following will further illustrate the map generation method provided by the present disclosure in combination with specific embodiments of the first plot and the second plot switching from the non-adjacent state to the adjacent state and the first plot and the second plot switching from the adjacent state to the non-adjacent state respectively.
[0065] The method for generating a map in which the first plot and the second plot are switched from a non - adjacent state to an adjacent state will be described below. Taking the example where the first plot and the second plot in the map are preset as adjacent plots, but in the pre - partitioned map, the first plot and the second plot are in a non - adjacent state, at this time, it is necessary to re - divide the area of the map so that the first plot and the second plot are changed from a non - adjacent state to an adjacent state. Figure 6 is a schematic diagram of the first plot and the second plot in a pre - partitioned map according to some embodiments of this specification. In some embodiments, as Figure 6 shown, the pre - partitioned map 600 can generate multiple plots 630 based on the distribution of preset points 620 using the Voronoi diagram algorithm, and each plot 630 corresponds to a preset point 620 one by one. In some embodiments, as Figure 6 shown, in the pre - partitioned map 600, the first plot 600a and the second plot 600b are in a non - adjacent state. Since the first plot and the second plot are preset as adjacent plots, it is necessary to re - divide the area of the map so that the first plot and the second plot are changed from a non - adjacent state to an adjacent state. Figure 5 is an exemplary flowchart for switching the first plot and the second plot from a non - adjacent state to an adjacent state according to some embodiments of this specification. In some embodiments, as Figure 5 shown, the process 500 may include the following steps.
[0066] Step 510: Set the connection line between the first preset point corresponding to the first plot and the second preset point corresponding to the second plot as the connection line associated with the first plot and the second plot in the pre - partitioned map, and set at least one additional point on the connection line.
[0067] In some embodiments, in order to realize the switching of the first plot 600a and the second plot 600b from a non - adjacent state to an adjacent state, additional points can be set between the first plot 600a and the second plot 600b, and the plots can be re - divided based on the additional points. As Figure 6 shown, the connection line 610 between the first preset point A corresponding to the first plot 600a and the second preset point B corresponding to the second plot 600b can be set as the connection line associated with the first plot and the second plot in the pre - partitioned map. By setting at least one additional point on the connection line 610, the setting of additional points between the first plot 600a and the second plot 600b can be realized. As Figure 6 shown, there are three additional points 611, 612, and 613 set on the connection line 610.
[0068] In some embodiments, the additional points can be randomly set on the line connecting the first preset point and the second preset point. In some embodiments, the additional points can be set at a preset interval on the line connecting the first preset point and the second preset point, so that the distances between any two adjacent additional points are equal. In some embodiments, the length of the preset interval can be set according to the historical experience of the production personnel in adding points. In some embodiments, the length of the preset interval can be positively correlated with the distance between the first preset point and the second preset point. The greater the distance between the first preset point and the second preset point, the longer the corresponding preset interval length.
[0069] In some embodiments, in addition to setting the line connecting the first preset point corresponding to the first plot and the second preset point corresponding to the second plot as the line associated with the first plot and the second plot in the pre-divided map, an arbitrary first random point can be selected in the first plot, and an arbitrary second random point can be selected in the second plot. The line connecting the first random point and the second random point can be set as the line associated with the first plot and the second plot in the pre-divided map, which is not limited herein.
[0070] Step 520: Based on the distribution of the preset points and the additional points, re-divide the map to obtain a re-divided map. In some embodiments, the implementation of step 520 can refer to the implementation manner of step 230 in the foregoing embodiments, which will not be elaborated herein.
[0071] Figure 7 is a schematic diagram of a re-divided map without plot merging according to some embodiments of this specification. In some embodiments, as Figure 7 shown, the re-divided map 700 can generate multiple plots based on the distribution of the preset point 620 and the additional points 611, 612, and 613 using the Voronoi diagram algorithm. Each plot corresponds to a preset point 620 or an additional point. In some embodiments, as Figure 7 shown, in the re-divided map 700 without plot merging, the plot corresponding to the first preset point A is shown as 700a in the figure, the plot corresponding to the second preset point B is shown as 700b in the figure, the plot corresponding to the additional point 611 is shown as 700c in the figure, the plot corresponding to the additional point 612 is shown as 700d in the figure, and the plot corresponding to the additional point 613 is shown as 700e in the figure.
[0072] Step 530: In the re-divided map, merge the plot corresponding to the additional point with the plot corresponding to the first preset point as the updated first plot, and use the plot corresponding to the second preset point as the updated second plot.
[0073] Figure 8It is a schematic diagram of an updated first plot and an updated second plot according to some embodiments of this specification. In some embodiments, by comparing Figure 7 and Figure 8 it can be seen that in the re-blocked map 800 after plot merging, the updated first plot is shown as 810 in the figure. The plot 810 is obtained by merging the plot 700a corresponding to the first preset point A shown by Figure 7 and the plots 700c, 700d, and 700e corresponding to all newly added points. The updated second plot is shown as 820 in the figure, and the plot 820 is the same as the plot 700b shown by Figure 7 . As shown by Figure 8 it can be seen that the updated first plot 810 and the updated second plot 820 have a common side, realizing the switching of the first plot and the second plot from a non-adjacent state to an adjacent state.
[0074] Step 540: Determine whether the updated first plot and the updated second plot have a common side. If so, realize the switching of the first plot and the second plot from a non-adjacent state to an adjacent state. If not, increase the number of additional points set on the connection line, and then turn to step 520.
[0075] In some embodiments, as shown by Figure 8 , if the updated first plot 810 and the updated second plot 820 have a common side, it means that the switching of the two plots from a non-adjacent state to an adjacent state is realized. In some embodiments, if there is still no common side between the updated first plot and the updated second plot, it means that the setting of the additional points is not in place yet. For example, there may be a situation where the additional points are too far from the second preset point corresponding to the second plot, resulting in the updated first plot and the updated second plot obtained after plot merging still unable to be switched to an adjacent state. At this time, the number of additional points on the connection line 610 can be increased and the map can be re-divided until there is a common side between the updated first plot and the updated second plot to realize the switching of the two plots from a non-adjacent state to an adjacent state.
[0076] In some embodiments, to increase the number of additional points set on the connection line, at least one additional point can be randomly added on the connection line. In some embodiments, when the additional points on the connection line are set according to a preset spacing, the number of additional points can be increased by reducing the preset spacing between the additional points.
[0077] In some embodiments, in addition to merging the plot corresponding to the additional point with the plot corresponding to the first preset point as the updated first plot to achieve plot merging, other plot merging schemes can also be adopted. In some embodiments, the plot corresponding to at least part of the additional points close to the first preset point can be merged with the plot corresponding to the first preset point as the updated first plot, and at the same time, the plot corresponding to the remaining part of the additional points can be merged with the plot corresponding to the second preset point as the updated second plot. Figure 9 is a schematic diagram of another updated first plot and updated second plot according to some embodiments of the present specification. In some embodiments, different from the plot merging scheme as Figure 8 shown, in the plot merging scheme as Figure 9 shown, the plot 700c corresponding to the additional point 611 and the plot 700d corresponding to the additional point 612 close to the first preset point A are merged with the plot 700a corresponding to the first preset point A as the updated first plot 910, and the plot 700e corresponding to the remaining additional point 613 is merged with the plot 700b corresponding to the second preset point B as the updated second plot 920. When the updated first plot 910 and the updated second plot 920 have a common side, the switching of the two plots from the non - adjacent state to the adjacent state can also be achieved. Compared with the plot merging scheme as Figure 8 shown, the updated first plot 910 and the updated second plot 920 obtained by the plot merging scheme as Figure 9 shown can adjust and select the number of plots corresponding to the additional points merged into the first plot 910 and the second plot 920 according to the needs of the production personnel, so that the sizes and / or shapes of the updated first plot 910 and the updated second plot 920 in the re - divided map 900 after merging are more in line with the needs of the production personnel.
[0078] The following will describe the map generation method for switching the first plot and the second plot from the adjacent state to the non - adjacent state. Taking the example where the first plot and the second plot in the map are preset as non - adjacent plots, while in the pre - divided map, the first plot and the second plot are in the adjacent state, at this time, it is necessary to re - divide the map area to change the first plot and the second plot from the non - adjacent state to the adjacent state. Figure 11 is a schematic diagram of the first plot and the second plot in another pre - divided map according to some embodiments of the present specification. In some embodiments, as Figure 11 shown, the pre - divided map 1100 can generate multiple plots 1130 based on the distribution of the preset points 1120 using the Voronoi diagram algorithm, and each plot 1130 corresponds to a preset point 1120 one by one. In some embodiments, in Figure 11In the pre - segmented map 1100 shown, the first plot 1100a and the second plot 1100b are adjacent. Since the first plot and the second plot are preset as non - adjacent plots, it is necessary to re - divide the area of the map so that the first plot and the second plot change from the adjacent state to the non - adjacent state. Figure 10 is an exemplary flowchart for switching the first plot and the second plot from the adjacent state to the non - adjacent state according to some embodiments of the present specification. In some embodiments, as Figure 10 shown, the process 1000 may include the following steps.
[0079] Step 1010: Set the first common edge of the first plot and the second plot to be associated with the connection line between the first plot and the second plot in the pre - segmented map, and set at least one additional point on the connection line.
[0080] In some embodiments, in order to realize the switching of the first plot 1100a and the second plot 1100b from the adjacent state to the non - adjacent state, additional points can be set on the common edge of the first plot 1100a and the second plot 1100b, and the plots can be re - divided based on the additional points. As Figure 11 shown, the first common edge 1110 of the first plot 1100a and the second plot 1100b can be set to be associated with the connection line between the first plot 1100a and the second plot 1100b in the pre - segmented map. By setting at least one additional point on the connection line 1110, the setting of additional points between the first plot 1100a and the second plot 1100b can be realized. As Figure 11 shown, there are two additional points 1111 and 1112 set on the connection line 1110.
[0081] In some embodiments, the additional points can be randomly set on the first common edge. In some embodiments, the additional points can be set on the first common edge at a preset interval so that the distance between any two adjacent additional points is equal. In some embodiments, the length of the preset interval can be set according to the historical additional - point - setting experience of the production staff. In some embodiments, the length of the preset interval can be positively correlated with the length of the first common edge. The longer the length of the first common edge, the longer the corresponding length of the preset interval.
[0082] Step 1020: In the pre - segmented map, determine a third plot that has at least one intersection with the first common edge and is different from the first plot or the second plot, and obtain the third preset point corresponding to the third plot. In some embodiments, the above step 1020 can also be executed before the above step 1010, that is, the execution order of the above step 1010 and step 1020 is not limited.
[0083] In some embodiments, the third plot is a plot that has at least one intersection with the first common side and is different from the first plot or the second plot. There can be one or more such plots. When there are multiple such plots, the production staff can randomly select one plot from the multiple such plots as the third plot and obtain the corresponding third preset point. This third preset point is used to determine the merging object of the plot corresponding to the additional point after the subsequent re-blocked map is generated. In some embodiments, such as Figure 11 shown, the first common side 1110 has at least one intersection with plot 1100c and plot 1100d, which are different from the first plot 1100a and the second plot 1100b. One plot can be selected from plot 1100c and plot 1100d as the third plot. In some embodiments, plot 1100c can be selected as the third plot, and the corresponding third preset point C of the third plot 1100c is obtained. In some embodiments, plot 1100d can also be selected as the third plot, which is not limited herein.
[0084] Step 1030: Based on the distribution of the preset points and the additional points, re-divide the map into regions to obtain a re-blocked map. In some embodiments, the implementation of step 1030 can refer to the implementation manner of step 230 in the foregoing embodiments, which will not be elaborated herein.
[0085] Step 1040: In the re-blocked map, use the plot corresponding to the first preset point as the updated first plot, and use the plot corresponding to the second preset point in the re-blocked map as the updated second plot.
[0086] Figure 12 is a schematic diagram of another re-blocked map without plot merging shown according to some embodiments of this specification. In some embodiments, such as Figure 12 shown, in the re-blocked map 1200 without plot merging, the plot corresponding to the first preset point A is shown as 1200a in the figure, the plot corresponding to the second preset point B is shown as 1200b in the figure, the plot corresponding to the third preset point C is shown as 1200c in the figure, the plot corresponding to the additional point 1111 is shown as 1200d in the figure, and the plot corresponding to the additional point 1112 is shown as 1200e in the figure.
[0087] Step 1050: In the re-blocked map, merge the plot corresponding to the additional point with the plot corresponding to the third preset point in the re-blocked map as the updated third plot.
[0088] In some embodiments, such as Figure 12As shown, if the updated first plot 1200a and the updated second plot 1200b do not have a common side, the obtained re-blocked map already satisfies the switching of the first plot and the second plot from the adjacent state to the non-adjacent state. But at this time, in the re-blocked map 1200 as shown in Figure 12 there are still a plot 1200d corresponding to the added point 1111 and a plot 1200e corresponding to the added point 1112 in the re-blocked map 1200, which does not meet the requirement that each plot in the generated map corresponds one-to-one to a preset point. Therefore, the plot 1200d corresponding to the added point 1111 and the plot 1200e corresponding to the added point 1112 can be merged with the plots corresponding to other preset points so that each plot in the merged re-blocked map corresponds one-to-one to a preset point to obtain the required generated map. In some embodiments, the plot corresponding to the added point can be merged with the plot corresponding to the third preset point in the re-blocked map. Figure 13 is a schematic diagram of a re-blocked map after plot merging according to some embodiments of the present specification. In some embodiments, referring to Figure 12 and Figure 13 it can be seen that in the re-blocked map 1300 after plot merging, the plot 1310a corresponding to the third preset point C is the updated third plot, which is obtained by merging the plot 1200c corresponding to the third preset point C as shown in Figure 12 , the plot 1200d corresponding to the added point 1111 and the plot 1200e corresponding to the added point 1112. As shown in Figure 13 , in the merged re-blocked map 1300, each plot corresponds one-to-one to a preset point and can be used as the required generated map.
[0089] Step 1060: Determine whether the updated first plot and the updated second plot have a common side: If not, realize the switching of the first plot and the second plot from the adjacent state to the non-adjacent state; if so, increase the number of added points set on the connection line, and then turn to step 1030.
[0090] In some embodiments, if there is still a common side between the updated first plot and the updated second plot, it means that the setting of the added points is not yet in place. For example, there may be a situation where the distance between two added points is too far, resulting in the updated first plot and the updated second plot obtained after the plot re-division still unable to be switched to the non-adjacent state. At this time, the number of added points can be increased on the first common side 1110 and the map can be re-divided until there is no common side between the updated first plot and the updated second plot to realize the switching of the two plots from the adjacent state to the non-adjacent state.
[0091] In some embodiments, to increase the number of additional points set on a connection line, at least one additional point can be randomly added on the connection line. In some embodiments, when the additional points on the connection line are set according to a preset spacing, the number of additional points can be increased by reducing the preset spacing between the additional points.
[0092] In some embodiments, in addition to merging the plot corresponding to the additional point with the plot corresponding to the third preset point as the updated third plot to achieve plot merging, other plot merging schemes can also be adopted. In some embodiments, in the obtained re-blocked map, a fourth plot that has at least one common side with the plot corresponding to the additional point and is different from the updated first plot or the updated second plot can be determined, and then the plot corresponding to the additional point is merged with the fourth plot as the updated fourth plot to achieve plot merging. Figure 14 is a schematic diagram of another re-blocked map after plot merging according to some embodiments of this specification. In some embodiments, different from the plot merging scheme as Figure 13 shown, in the plot merging scheme as Figure 14 shown, in the re-blocked map 1200 as Figure 12 shown, a fourth plot that has at least one common side with the plot 1200d corresponding to the additional point 1111 or the plot 1200e corresponding to the additional point 1112 and is different from the updated first plot 1200a or the updated second plot 1200b is determined. As Figure 12 shown, the fourth plot can be any one of the plots 1200c, 1200f, 1200g, 1200h as Figure 12 shown, where the plot 1200c and the plot 1200f are plots that have a common side with the plot 1200d corresponding to the additional point 1111, and the plot 1200g and the plot 1200h are plots that have a common side with the plot 1200e corresponding to the additional point 1112. Taking Figure 14 as an example, taking the plot 1200f in Figure 12 as the fourth plot, the updated fourth plot 1410a is obtained by merging the plot 1200f, the plot 1200d corresponding to the additional point 1111, and the plot 1200e corresponding to the additional point 1112. As Figure 14 shown, in the merged re-blocked map 1400, each plot corresponds to a preset point one by one and can serve as the required generated map.
[0093] Some embodiments of this specification also provide a map generation system. Figure 15 is an exemplary module diagram of a map generation system according to some embodiments of this specification. In some embodiments, as Figure 15As shown, the system 1500 may include a first acquisition module 1510, a point addition module 1520, a second acquisition module 1530, and a plot adjustment module 1540.
[0094] The first acquisition module 1510 is configured to divide the map into regions based on the distribution of preset points to obtain a pre-partitioned map, where the plots in the pre-partitioned map correspond one-to-one to the preset points.
[0095] The point addition module 1520 is configured to obtain the connection line between the first plot and the second plot in the pre-partitioned map, and set at least one additional point on the connection line.
[0096] The second acquisition module 1530 is configured to re-divide the map based on the distribution of the preset points and the additional points to obtain a re-partitioned map, where the plots in the re-partitioned map correspond one-to-one to the preset points or the additional points. In some embodiments, the second acquisition module 1530 and the first acquisition module 1510 may be implemented by the same functional module. The functional module generates the corresponding pre-partitioned map or re-partitioned map according to the input preset points or the combination of preset points and additional points.
[0097] The plot adjustment module 1540 is configured to merge the plot corresponding to the additional point with at least one other plot in the re-partitioned map to realize the switching between the adjacent state and the non-adjacent state of the first plot and the second plot.
[0098] For more content about each module, reference can be made to Figures 2 to 14 the relevant description, which will not be elaborated here. It should be understood that Figure 15 the system and its modules shown can be implemented in various ways. For example, in some embodiments, the system and its modules can be implemented by hardware, software, or a combination of software and hardware. Among them, the hardware part can be implemented using dedicated logic; the software part can be stored in a memory and executed by an appropriate instruction execution system, such as a microprocessor or dedicated design hardware. Those skilled in the art can understand that the above methods and systems can be implemented using computer-executable instructions and / or control codes included in a processor. For example, such codes are provided in a carrier medium such as a disk, CD, or DVD-ROM, or in the memory of a programmable device. The systems and modules of this specification can be implemented not only by hardware circuits of programmable hardware devices such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips and transistors, or programmable logic devices such as field programmable gate arrays, but also by software executed by various types of processors, or by a combination of the above hardware circuits and software (for example, firmware).
[0099] It should be noted that the above description of the system and its modules is only for convenience of description and does not limit this specification to the scope of the examples given. It can be understood that for those skilled in the art, after understanding the principle of the system, they may, without departing from this principle, arbitrarily combine the various modules to form a subsystem connected to other modules. Or split some modules to obtain more modules or multiple units under this module. Such deformations are all within the scope disclosed in this specification.
[0100] In some embodiments provided in this specification, a computer program product is also provided, including computer instructions or a computer program. When at least part of the computer instructions or the computer program is executed by a processor, the map generation method provided in the foregoing embodiments of this specification can be implemented.
[0101] In some embodiments, the above-mentioned processor may be a combination of one or more of the following processors: central processing unit (CPU), application specific integrated circuit (ASIC), application specific instruction set processor (ASIP), graphics processing unit (GPU), physics processing unit (PPU), digital signal processor (DSP), field programmable gate array (FPGA), programmable logic device (PLD), programmable logic controller (PLC), reduced instruction set computer (RISC), microprocessor.
[0102] The beneficial effects that may be brought by the embodiments of this specification include but are not limited to: (1) Based on the distribution of preset points, using a preset area division algorithm, the area division of the map can be quickly and conveniently realized, saving the labor cost and time cost in the map generation stage compared with manual cutting by production personnel. (2) By adding points, re-dividing areas and merging plots in the pre-divided map, the switching between the adjacent state and the non-adjacent state of any two plots can be realized, saving the labor cost and time cost compared with the production personnel re-manually cutting local plots multiple times. It should be noted that the beneficial effects that may be produced by different embodiments are different. In different embodiments, the beneficial effects that may be produced may be any one or several combinations of the above, or any other beneficial effects that may be obtained.
[0103] The basic concepts have been described above. Obviously, for those skilled in the art, the above detailed disclosure is only an example and does not constitute a limitation to this specification. Although not explicitly stated here, those skilled in the art may make various modifications, improvements and corrections to this specification. Such modifications, improvements and corrections are taught in this specification, so such modifications, improvements and corrections still belong to the spirit and scope of the exemplary embodiments of this specification.
Claims
1. A map generation method, characterized in that: The method comprises: Based on the distribution of the preset points, the map is divided into regions to obtain a pre-block map, wherein the plots in the pre-block map correspond one to one with the preset points; Acquire a connection line associated with the first plot and the second plot in the pre-block map, and set at least one additional point on the connection line; Based on the distribution of the preset points and the additional points, the map is re-divided into regions to obtain a re-blocked map, wherein the plots in the re-blocked map correspond one-to-one to the preset points or the additional points; In the re-blocked map, the plot corresponding to the additional point is merged with at least one other plot to achieve switching between an adjacent state and a non-adjacent state between the first plot and the second plot.
2. The method according to claim 1, characterized in that In the pre-block map, the first plot and the second plot are in the non-adjacent state; A line between a first preset point corresponding to the first plot and a second preset point corresponding to the second plot is set as a line associated with the first plot and the second plot in the pre-block map.
3. The method according to claim 2, characterized in that In the re-blocked map, merging the plot corresponding to the additional point with at least one other plot to achieve switching between an adjacent state and a non-adjacent state between the first plot and the second plot, including: In the re-blocked map, the plot corresponding to the additional point is merged with the plot corresponding to the first preset point to serve as an updated first plot, and the plot corresponding to the second preset point is served as an updated second plot; When the updated first plot and the updated second plot have a common edge, the first plot and the second plot are switched from the non-adjacent state to the adjacent state.
4. The method according to claim 2, characterized in that: In the re-blocked map, merging the plot corresponding to the additional point with at least one other plot to achieve switching between an adjacent state and a non-adjacent state between the first plot and the second plot, including: In the re-blocked map, at least part of the plots corresponding to the additional points close to the first preset point are merged with the plot corresponding to the first preset point to serve as an updated first plot, and the remaining part of the plots corresponding to the additional points are merged with the plot corresponding to the second preset point to serve as an updated second plot; When the updated first plot and the updated second plot have a common edge, the first plot and the second plot are switched from the non-adjacent state to the adjacent state.
5. The method according to claim 1, characterized in that In the pre-block map, the first plot and the second plot are in the adjacent state and have a first common edge; The first common edge is set to be the line associated with the first plot and the second plot in the pre-block map.
6. The method according to claim 5, characterized in that The method further includes: determining, in the pre-block map, a third land parcel that has at least one intersection with the first common edge and is different from the first land parcel or the second land parcel, and acquiring a third preset point corresponding to the third land parcel; In the re-blocked map, merging the plot corresponding to the additional point with at least one other plot to achieve switching between an adjacent state and a non-adjacent state between the first plot and the second plot, including: The plot corresponding to the first preset point in the re-blocked map is used as the updated first plot, and the plot corresponding to the second preset point in the re-blocked map is used as the updated second plot; In the re-divided map, the plot corresponding to the additional point is merged with the plot corresponding to the third preset point in the re-divided map to serve as an updated third plot; When the updated first plot and the updated second plot do not have a common edge, the first plot and the second plot are switched from the adjacent state to the non-adjacent state.
7. The method according to claim 5, characterized in that In the re-blocked map, merging the plot corresponding to the additional point with at least one other plot to achieve switching between an adjacent state and a non-adjacent state between the first plot and the second plot, including: The plot corresponding to the first preset point in the re-blocked map is used as the updated first plot, and the plot corresponding to the second preset point in the re-blocked map is used as the updated second plot; In the re-blocked map, determining a fourth block that has at least one common edge with the block corresponding to the additional point and is different from the updated first block or the updated second block; In the re-blocked map, the plot corresponding to the additional point is merged with the fourth plot to serve as an updated fourth plot; When the updated first plot and the updated second plot do not have a common edge, the first plot and the second plot are switched from the adjacent state to the non-adjacent state.
8. The method according to any one of claims 3 to 4 and claims 6 to 7, characterized in that: When the updated first land parcel and the updated second land parcel fail to switch between the adjacent state and the non-adjacent state, increasing the number of the additional points set on the connecting line; The increasing the number of the additional points arranged on the connection line includes reducing a preset interval between the additional points, or randomly adding at least one of the additional points.
9. The method according to claim 1, characterized in that: The distance from any point in any plot in the pre-block map or the re-block map to the preset point or the additional point corresponding to the local plot is smaller than the distance from the any point to the preset point or the additional point corresponding to other plots; The distances from any point on the common edge of any two adjacent blocks in the pre-block map or the re-block map to the preset points or the additional points corresponding to the two adjacent blocks are equal.
10. A computer program product, comprising computer instructions or a computer program, wherein when at least part of the computer instructions or the computer program is executed by a processor, the map generating method according to any one of claims 1 to 9 can be implemented.