Map generation method and computer program product

Abstract

The invention provides a map generation method and a computer program product, and relates to the technical field of map generation, the map comprises at least one preset point location, and the method comprises the following steps: based on the distribution condition of the preset point locations, carrying out region division on the map to obtain a pre-partitioned map, plots in the pre-partitioned map are in one-to-one correspondence with preset point locations, and the vertex of each plot corresponds to a movable point location; selecting two land parcel boundary lines associated with a first land parcel and a second land parcel in the pre-partitioned map; at least one additional point location is arranged on each of the boundary lines of the two land parcels; and one additional point location and / or the movable point location is moved to the other additional point location or the movable point location, so that the edge connected to the movable additional point location and / or the movable point location moves together, and switching of the first land parcel and the second land parcel between the adjacent state and the non-adjacent state is achieved.

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. The map includes at least one preset point. The method includes: based on the distribution of the 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, and the vertex of each plot corresponds to a movable point; selecting two plot boundary lines associated with the first plot and the second plot in the pre-divided map; respectively setting at least one additional point on the two plot boundary lines; moving one of the additional points and / or the movable points to other additional points or movable points, so that the sides connected to the moved additional points and / or movable points also move, so as to realize the switching between the adjacency state and the non-adjacency state of 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; selecting two plot boundary lines associated with the first plot and the second plot in the pre-divided map includes: selecting the plot boundary line of the first plot close to the second plot as the first plot boundary line; selecting the plot boundary line of the second plot close to the first plot as the second plot boundary line.

[0006] According to the method provided by one or more embodiments of this specification, respectively setting at least one additional point on the two plot boundary lines includes: setting a first additional point on the first plot boundary line; setting a second additional point on the second plot boundary line; wherein, the preset point corresponding to the plot between the first plot and the second plot is located on one side of the line connecting the first additional point and the second additional point.

[0007] According to the method provided by one or more embodiments of this specification, move one of the additional points and / or movable points to other additional points or movable points, so that the sides connected to the moved additional points and / or movable points move together, to achieve the switching between the adjacent state and the non-adjacent state of the first plot and the second plot, including: moving the first additional point to the position of the second additional point, so that the sides connected to the first additional point move together; moving the first movable point on the boundary line of the first plot to the position of the second movable point on the boundary line of the second plot, so that the sides connected to the first movable point move together, to achieve the switching of the first plot and the second plot from the non-adjacent state to the adjacent state; wherein, the first movable point and the second movable point are on the same side of the line connecting the first additional point and the second additional point.

[0008] According to the method provided by one or more embodiments of this specification, after moving the first additional point to the position of the second additional point, the area enclosed by the first movable point, the second movable point and the second additional point does not contain a preset point.

[0009] 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 the adjacent state; selecting two plot boundary lines associated with the first plot and the second plot in the pre-divided map includes: respectively selecting two plot boundary lines in the first plot that intersect with the common side of the first plot and the second plot as the third plot boundary line and the fourth plot boundary line.

[0010] According to the method provided by one or more embodiments of this specification, setting at least one additional point on each of the two plot boundary lines includes: setting a third additional point on the third plot boundary line; setting a fourth additional point on the fourth plot boundary line; wherein, the preset points corresponding to the first plot and the preset points corresponding to the second plot are respectively on both sides of the line connecting the third additional point and the fourth additional point.

[0011] According to the method provided by one or more embodiments of this specification, move one of the additional points and / or movable points to other additional points or movable points, so that the sides connected to the moved additional points and / or movable points move together, to achieve the switching between the adjacent state and the non-adjacent state of the first plot and the second plot, including: moving the third additional point to the position of the fourth additional point, so that the sides connected to the third additional point move together, to achieve the switching of the first plot and the second plot from the adjacent state to the non-adjacent state.

[0012] The method provided according to one or more embodiments of this specification further includes: after moving the third additional point to the position of the fourth additional point, setting a fifth additional point on the plot boundary line formed by the fourth additional point and the third movable point on the common side, where the vertex of the common side close to the third additional point is set as the third movable point; moving the fifth additional point to the position of the fourth movable point in the second plot, causing the side connected to the fifth additional point to move accordingly, where the vertex of the common side close to the fourth additional point is set as the fourth movable point.

[0013] The method provided according to one or more embodiments of this specification further includes: based on the re-partitioned map after realizing the switching between the adjacent state and the non-adjacent state of the first plot and the second plot, determining whether the plots in the re-partitioned map correspond one-to-one to the preset points; if so, using the re-partitioned map as the generated map.

[0014] For the method provided according to one or more embodiments of this specification, determining whether the plots in the re-partitioned map correspond one-to-one to the preset points includes: obtaining the minimum circumscribed matrix corresponding to each plot in the re-partitioned map; for each preset point, respectively obtaining the plot corresponding to the minimum circumscribed matrix containing the preset point as the plot to be determined corresponding to the preset point; based on the ray in the preset direction with the preset point as the origin, obtaining the number of intersection points between the ray and the plot boundary line of the plot to be determined; based on the number of intersection points, determining whether the preset point is located in the plot to be determined; based on the corresponding relationship between the preset point and the plot to be determined, determining whether the plots in the re-partitioned map correspond one-to-one to the preset points.

[0015] For the method provided according to one or more embodiments of this specification, based on the number of intersection points, determining whether the preset point is located in the plot to be determined includes: when the number of intersection points is odd, determining that the preset point is located in the plot to be determined; based on the corresponding relationship between the preset point and the plot to be determined, determining whether the plots in the re-partitioned map correspond one-to-one to the preset points includes: when the preset point corresponds one-to-one to the plot to be determined and the number of plots in the re-partitioned map is the same as the number of preset points, determining that the plots in the re-partitioned map correspond one-to-one to the preset points.

[0016] For the method provided according to one or more embodiments of this specification, the distance from any point within any plot in the pre-partitioned map to the preset point corresponding to this plot is less than the distance from the point to the preset points corresponding to other plots; the distance from any point on the common side of any two adjacent plots in the pre-partitioned map to the preset points corresponding to the adjacent plots is equal.

[0017] The map provided according to one or more embodiments of this specification includes multiple cities; the positions of the multiple cities in the map correspond one-to-one to the preset points.

[0018] One or more embodiments of this specification also provide a map generation system, which includes: a plot acquisition module that divides 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 with the preset points, and the vertices of each plot correspond to a movable point; a boundary selection module for selecting two plot boundary lines associated with the first plot and the second plot in the pre-partitioned map; a point addition module for respectively setting at least one additional point on the two plot boundary lines; and a plot adjustment module for moving one of the additional points and / or the movable points to other additional points or movable points, so that the sides connected to the moved additional points and / or movable points also move, to realize the switching between the adjacent state and the non-adjacent state of the first plot and the second plot.

[0019] Some embodiments of this specification also provide a computer program product, including computer instructions or a computer program. When at least a 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

[0020] This specification will be further described by way of exemplary embodiments, which will be described in detail through the drawings. The same numbers in the drawings represent the same structures or steps.

[0021] Figure 1 is a schematic diagram of an application scenario of a map generation method shown in some embodiments of this specification.

[0022] Figure 2 is an exemplary flowchart of a map generation method shown in some embodiments of this specification.

[0023] Figure 3 is a schematic diagram of a pre-partitioned map shown in some embodiments of this specification.

[0024] Figure 4 is a schematic diagram of moving an additional point and / or a movable point shown in some embodiments of this specification.

[0025] Figure 5 is a schematic diagram of the first plot and the second plot in a pre-partitioned map shown in some embodiments of this specification.

[0026] Figure 6 is a schematic diagram of the moving process of the additional point and / or the movable point shown in some embodiments of this specification.

[0027] Figure 7 is a schematic diagram of moving the first additional point shown in some embodiments of this specification.

[0028] Figure 8 It is a schematic diagram of moving a first movable point position shown in some embodiments of this specification.

[0029] Figure 9 It is a schematic diagram of a first plot and a second plot in another pre-partitioned map shown in some embodiments of this specification.

[0030] Figure 10 It is a schematic diagram of a moving process of adding additional point positions and / or movable point positions shown in some embodiments of this specification.

[0031] Figure 11 It is a schematic diagram of moving a third additional point position shown in some embodiments of this specification.

[0032] Figure 12 It is a schematic diagram of moving a fifth additional point position shown in some embodiments of this specification.

[0033] Figure 13 It is an exemplary flowchart of determining whether plots in a re-partitioned map correspond one-to-one with preset point positions shown in some embodiments of this specification.

[0034] Figure 14 It is a schematic diagram of the minimum bounding matrix corresponding to a plot shown in some embodiments of this specification.

[0035] Figure 15 It is an exemplary module diagram of a map generation system shown in some embodiments of this specification. Detailed implementation manners

[0036] 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 content described below 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 according to these technical contents.

[0037] It should be understood that the "system", "device", "unit" and / or "module" used in this specification is a method for distinguishing different components, elements, parts, portions or assemblies at different levels. However, if other words can achieve the same purpose, the above words can be replaced by other expressions.

[0038] Unless otherwise specified, the technical terms describing components, elements, etc. in this specification do not specifically refer to the singular, but may also include the plural. Generally speaking, terms such as "including" and "comprising" only indicate 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.

[0039] Flowcharts are used in this specification 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 sequence, merging multiple steps, and splitting a certain step.

[0040] A map is a graph or image that expresses the spatial distribution, connection, and change state of various things within a certain area through a visual presentation. For example, a two-dimensional plane map of a certain city can represent the distribution of roads and buildings in the city area on a 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 location of the game objects to be attacked through the game map, and then control the game characters they control to go to the location of the game objects to carry out game attacks. In a strategy 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. 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 through 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.

[0041] Figure 1 It is a schematic diagram of an application scenario of a map generation method shown in 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 perform data transmission through the network 120.

[0042] 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 relevant operations in the map generation process.

[0043] 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, an optical fiber network, a telecommunication 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.

[0044] 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 memory, 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.

[0045] 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 relevant 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.

[0046] 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.

[0047] In the current map generation scenario, it is often necessary for production personnel to manually cut the map into blocks 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 map area 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 processing. 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 manually cut the plots that need to be adjusted repeatedly, consuming a large amount of time and labor costs.

[0048] 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 plot division of the map, and enable production personnel to flexibly adjust the adjacency state between plots according to needs, greatly saving labor costs and time costs in the map generation stage.

[0049] Figure 2 It is an exemplary flowchart of a map generation method according to some embodiments of this specification. In some embodiments, Figure 2The illustrated process 200 can be executed by a terminal device. For example, it can be executed by the terminal device 140 as shown in Figure 1 ; or, Figure 2 The illustrated process 200 can also be executed by other processing devices. For example, it can be executed by the server 110 as shown in Figure 1 ; or, Figure 2 The illustrated process 200 can be jointly executed by a terminal device and other processing devices. For example, it can be jointly executed by the terminal device 140 and the 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.

[0050] In some embodiments, the map can include at least one preset point. The preset point can be pre-set in the map by a producer, and during the subsequent map generation process, the relative setting position of each preset point in the map remains unchanged, that is, the distribution of the preset points in the map remains unchanged. For example, in some virtual game scenarios, it is necessary to determine the setting positions of multiple cities or resource points in the corresponding virtual game map, and the setting positions of the preset points can correspond to the setting positions of the above-mentioned cities or resource points.

[0051] In some embodiments, as shown in Figure 2 , the process 200 can include the following steps.

[0052] Step 210: Based on the distribution of the 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, and the vertices of each plot correspond to a movable point. In some embodiments, step 210 can be implemented by a plot acquisition module 1510.

[0053] In some embodiments, the map can be divided into regions according to the preset positions of the preset points in the map, so as to divide the map into multiple polygon plots, and each of the divided plots contains a preset point, thereby realizing the one-to-one correspondence between the plots and the preset points. In some embodiments, the vertices of each plot correspond to a movable point, and the producer can move the position of the above-mentioned movable point according to the actual needs of the plot division, so as to adjust the size and shape of the plots in the pre-partitioned map. In some embodiments, the pre-partitioned map can be presented through a human-computer interaction interface, and the producer can select the movable points to be moved through the human-computer interaction interface and drag the selected movable points through a drag operation, thereby realizing the position movement of the movable points.

[0054] Figure 3It is a schematic diagram of a pre-partitioned map shown according to some embodiments of this specification. In some embodiments, as Figure 3 shown, the pre-partitioned map 300 includes multiple plots 310, such as 310a, 310b, 310c. Each plot 310 contains and only contains one preset point 311, and each plot 310 corresponds one-to-one with the preset point 311 it contains. The vertex of each plot corresponds to a movable point. For example, the vertex 312 can be moved by a drag operation.

[0055] In some embodiments, during the process of dividing the map into regions, the plots can be obtained according to the following rules: for any point within any plot, the distance to the preset point corresponding to this 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 distance to the preset points corresponding to the two adjacent plots is equal. For example, in the pre-partitioned map 300 as Figure 3 shown, 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 any point to other preset points (for example, the preset point 311) in the pre-partitioned map; and for the first plot 310a and the adjacent third plot 310c, for any point on the common side of the first plot 310a and the third plot 310c, the distance to the first preset point A corresponding to the first plot 310a and the third preset point C corresponding to the third plot 310c is equal. Dividing the region based on the above rules is equivalent to dividing the plots around each preset point, which can ensure that each divided plot contains a corresponding preset point.

[0056] In some embodiments, based on a preset area division method, the map can be automatically divided into areas according to the distribution of preset points, so as to replace the manual cutting method of the map by the production staff, thereby quickly and conveniently realizing the plot division and obtaining the pre-divided map. In some embodiments, the area 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 divided region contains a generating point, that is, the divided regions can correspond one by one to the generating points contained therein; for a region divided by the Voronoi diagram algorithm, all points in this region are closer to the generating point corresponding to this region than the points in other regions. This division method ensures the independence of each region, making the distance between the points in each region and the generating point corresponding to the current region the closest. In some embodiments, when using the Voronoi diagram algorithm to divide the map into areas to obtain the pre-divided map, the preset points can be used as the generating points in the Voronoi diagram algorithm for area 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 here.

[0057] In some embodiments, the pre-divided map can be used as a game map in the scenario of a strategy game (Strategy Game, SLG). The map can contain multiple cities, and the positions of these cities in the map can correspond one by one to the preset points, that is, the preset points can be set according to the positions of the cities in the map, and the map can be divided into areas according to the distribution of the preset points to obtain the pre-divided map. Each plot in the pre-divided map corresponds to the city contained in this plot; when a player occupies a certain city during the play of a strategy game, it is equivalent to occupying the plot corresponding to this 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 this 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 contain multiple game resource acquisition points, such as a mine resource point for obtaining ore resources in the game, a food resource point for obtaining 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 there can be a one-to-one correspondence between the game resource acquisition points and the preset points.

[0058] Step 220: Select two plot boundary lines associated with the first plot and the second plot in the pre-partitioned map. In some embodiments, step 220 may be implemented by the boundary selection module 1520.

[0059] 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 relationships between two or some plots in the pre-partitioned map do not 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 separated, then the size and / or shape of these plots need to be adjusted 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 or by the virtual game using the map.

[0060] In some embodiments, the first plot and the second plot may 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 in the pre-partitioned map, the first plot 310a and the second plot 310b should be two adjacent plots, while in the pre-partitioned map 300 shown in Figure 3 , the first plot 310a and the second plot 310b are in a non-adjacent state and do not meet the preset adjacency requirements. Therefore, the size and / or shape of the first plot and the second plot need to be adjusted so that the adjusted first plot and the second plot are adjacent to meet the preset adjacency requirements.

[0061] In some embodiments, the plot boundary line refers to the line connecting two adjacent vertices in the plot, that is, the plot is an area surrounded by multiple sequentially connected plot boundary lines. In some embodiments, during the process of adjusting the size and / or shape of the first plot and the second plot, two plot boundary lines associated with the first plot and the second plot can be selected first, and then movable points can be added on the selected plot boundary lines to adjust the setting position and / or setting shape of the plot boundary line, so as to change the adjacency state of the first plot and the second plot. In some embodiments, the selection of the two plot boundary lines can be based on the adjacency / non-adjacency state of the first plot and the second plot in the pre-partitioned map. For example, in Figure 3In the pre-divided map 300 shown, the first plot 310a and the second plot 310b are in a non-adjacent state. At this time, the two plot boundary lines selected can be the plot boundary line 310a1 of the first plot 310a close to the second plot 310b and the plot boundary line 310b1 of the second plot 310b close to the first plot 310a respectively. For another example, in the pre-divided map 300 shown in Figure 3 the first plot 310a and the third plot 310c are in an adjacent state. At this time, the two plot boundary lines selected can be the plot boundary line 310a2 and the plot boundary line 310a1 of the first plot 310a that intersect with the common side 310c1 respectively, or the plot boundary line 310c2 and the plot boundary line 310c3 of the third plot 310c that intersect with the common side 310c1 respectively. The specific selection of the plot boundary lines will be specifically described later and will not be elaborated here.

[0062] Step 230: Set at least one additional point on each of the two plot boundary lines. In some embodiments, step 230 can be implemented by the point addition module 1530.

[0063] In some embodiments, the additional points are points freely set by the production personnel on the plot boundary line according to the need to switch between the adjacent state / non-adjacent state of the plots, and can be moved according to the needs of the production personnel. In some embodiments, the production personnel can, through the man-machine interaction interface, perform an operation of adding additional points (such as moving the cursor to the position on the plot boundary line where the additional points need to be set and inputting a double-click instruction, etc.) at the position on the plot boundary line where the additional points need to be set to implement the setting of the additional points. In some embodiments, one additional point can be set on the plot boundary line. For example, on the plot boundary line 310a1 shown in Figure 3 there is an additional point a11 set. In some embodiments, two or more additional points can be set on the plot boundary line. For example, on the plot boundary line 310b1 shown in Figure 3 there are two additional points b11 and b12 set. The specific setting of the additional points will be specifically described later and will not be elaborated here.

[0064] Step 240: Move one of the additional points and / or the movable points to other additional points or movable points, so that the sides connected to the moved additional points and / or movable points move together, so as 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.

[0065] In some embodiments, the production staff can change the size and / or shape of the first plot and the second plot by moving the additional points and / or movable points, thereby realizing the switching between the adjacent state and the non-adjacent state of the first plot and the second plot. In some embodiments, the pre-partitioned map can be presented through a human-computer interaction interface. The production staff can select the additional points and / or movable points that need to be moved through the human-computer interaction interface, and drag the selected additional points and / or movable points through a drag operation, so as to realize the position movement of the additional points and / or movable points; during the process of moving the additional points and / or movable points, except for the additional points and / or movable points in motion, the positions of other additional points and movable points remain unchanged, and the sides connected to the additional points and / or movable points in motion move together with the additional points and / or movable points in motion.

[0066] Figure 4 is a schematic diagram of moving an additional point and / or a movable point according to some embodiments of this specification. In some embodiments, as Figure 3 and Figure 4 shown, the additional point b12 moves from the initial set position to the initial set position of the additional point a11 and coincides with the additional point a11, and the two sides connected to the additional point b12 move together; the movable point b13 of the second plot 310b moves from the initial set position to the initial set position of the movable point a12 of the first plot 310a and coincides with the movable point a12, and the two sides connected to the movable point b13 move together; for the updated map 400 after the point movement, the updated first plot 310a' and the updated second plot 310b' have a common side 410 (i.e., the connection line between the additional point a11 and the movable point a12), thereby realizing the switching of the first plot and the second plot from the non-adjacent state to the adjacent state. The specific moving method of the additional points and / or movable points will be described in detail later and will not be elaborated here.

[0067] Through Figure 2 the map generation method shown, it is possible to realize the switching between the adjacent state and the non-adjacent state of the selected first plot and second plot in the map, so that the production staff can 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 by combining specific embodiments in which the first plot and the second plot are switched from the non-adjacent state to the adjacent state, and the first plot and the second plot are switched from the adjacent state to the non-adjacent state respectively.

[0068] The method for generating a map when 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 adjust the size and / or shape of the first plot and / or the second plot so that the first plot and the second plot change from a non - adjacent state to an adjacent state. Figure 5 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 5 shown, the pre - partitioned map 500 can generate multiple plots 510 based on the distribution of preset points 511 using the Voronoi diagram algorithm. Each plot 510 corresponds to a preset point 511 one - to - one, and the vertices of each plot correspond to a movable point 512. In some embodiments, as Figure 5 shown, in the pre - partitioned map 500, the first plot 510a and the second plot 510b are in a non - adjacent state. According to the preset information, the first plot 510a and the second plot 510b are preset as adjacent plots. It is possible to select the plot boundary lines, set additional points, and move the additional points and / or movable points in the pre - partitioned map 500 to achieve the adjacency of the first plot 510a and the second plot 510b.

[0069] The selection of plot boundary lines when the first plot and the second plot are switched from a non - adjacent state to an adjacent state will be described below. In some embodiments, when the first plot and the second plot are switched from a non - adjacent state to an adjacent state, additional points can be set on two plot boundary lines associated with the first plot and the second plot respectively. In order to make the additional points approach each other after movement so that the first plot and the second plot are close to each other, the plot boundary line of the first plot close to the second plot and the plot boundary line of the second plot close to the first plot can be selected as the two plot boundary lines associated with the first plot and the second plot. In some embodiments, the plot boundary line of the first plot close to the second plot can be selected as the first plot boundary line, and the plot boundary line of the second plot close to the first plot can be selected as the second plot boundary line. In some embodiments, as Figure 5 shown, in the pre - partitioned map 500, the plot boundary line 510a1 in the first plot 510a is a plot boundary line close to the second plot 510b, and the plot boundary line 510a1 can be used as the selected first plot boundary line; the plot boundary line 510b1 in the second plot 510b is a plot boundary line close to the first plot 510a, and the plot boundary line 510b1 can be used as the selected second plot boundary line.

[0070] The following will describe the setting of additional points when the first plot and the second plot are switched from a non - adjacent state to an adjacent state. In some embodiments, after selecting the boundary line of the first plot and the boundary line of the second plot, a first additional point can be set on the boundary line of the first plot, and a second additional point can be set on the boundary line of the second plot, and the preset point corresponding to the plot between the first plot and the second plot is located on one side of the line connecting the first additional point and the second additional point, so as to prevent other preset points from being included in the updated first plot and / or second plot during the subsequent movement of the first additional point and the second additional point. In some embodiments, as Figure 5 shown, a first additional point a11 can be set on the boundary line 510a1 of the first plot, and a second additional point b11 can be set on the boundary line 510b1 of the second plot. In some embodiments, the production staff can also set two or more additional points on the boundary line of the first plot and / or the boundary line of the second plot according to actual needs, which is not limited herein.

[0071] The following will describe the moving method of the additional points and / or movable points when the first plot and the second plot are switched from a non - adjacent state to an adjacent state. Figure 6 is a schematic diagram of the moving process of the additional points and / or movable points according to some embodiments of the present specification. In some embodiments, as Figure 6 shown, the process 600 may include the following steps.

[0072] Step 610: Move the first additional point to the position of the second additional point, so that the side connected to the first additional point moves together.

[0073] Figure 7 is a schematic diagram of moving the first additional point according to some embodiments of the present specification. In some embodiments, as Figure 7 shown, the first additional point a11 moves from the initial setting position to the initial setting position of the second additional point b11, so that the side 710' connected to the first additional point a11 moves from Figure 7 the dotted - line position 710' in Figure 7 to the solid - line position 710 in Figure 7 and the side 720' connected to the first additional point a11 moves from Figure 7 the dotted - line position 720' in Figure 7 to the solid - line position 720 in

[0074] Step 620: Move the first movable point on the boundary line of the first plot to the position of the second movable point on the boundary line of the second plot, so that the side connected to the first movable point also moves, to achieve the switching of the first plot and the second plot from a non - adjacent state to an adjacent state, where the first movable point and the second movable point are on the same side of the line connecting the first additional point and the second additional point.

[0075] Figure 8 It is a schematic diagram of moving the first movable point according to some embodiments of this specification. In some embodiments, as Figure 8 shown, the boundary line 510a1 of the first plot includes two movable points a12 and a13, and the boundary line 510b1 of the second plot includes two movable points b12 and b13, where a12 and b12 are on the same side of the line connecting the first additional point a11 and the second additional point b11, and a13 and b13 are on the same side of the line connecting the first additional point a11 and the second additional point b11. In some embodiments, as Figure 8 shown, a12 can be selected as the first movable point and b12 as the second movable point. By moving the first movable point a12 to the second movable point b12, the side 810' connected to the first movable point a12 moves from Figure 7 the dotted - line position 810' in Figure 8 to the solid - line position 810 in Figure 8 and the side 820' connected to the first movable point a12 moves from Figure 8 the dotted - line position 820' in Figure 8 to the solid - line position 820 in

[0076] In some embodiments, a13 can also be selected as the first movable point position, and b13 as the second movable point position. By moving the first movable point position a13 to the first movable point position b13, the adjacency of the updated first plot 510a and the second plot 510b can also be achieved. However, at this time, the updated first plot 510a contains both two preset point positions 811 and 812, which violates the plot division principle that the preset point positions and the divided plots correspond one by one. Therefore, when selecting the first movable point position and the second movable point position, it can be based on the principle that after moving the first additional point position to the position of the second additional point position, the area enclosed by the first movable point position, the second movable point position, and the second additional point position does not contain other preset point positions, so as to avoid the situation that the updated first plot and / or the second plot contains more than one preset point position.

[0077] The following will describe the method for generating a map when the first plot and the second plot are switched 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 adjust the size and / or shape of the first plot and / or the second plot to change the first plot and the second plot from the non - adjacent state to the adjacent state. Figure 9 It is a schematic diagram of the first plot and the second plot in another pre - divided map shown in some embodiments of this specification. In some embodiments, as Figure 9 shown, the pre - divided map 900 can generate multiple plots 910 based on the distribution of the preset point positions 911 by using the Voronoi diagram algorithm. Each plot 910 corresponds to a preset point position 911 one by one, and the vertex of each plot 910 corresponds to a movable point position 912. In some embodiments, as Figure 9 shown, in the pre - divided map 900, the first plot 910a and the second plot 910b are in the adjacent state, while according to the preset information, the first plot 910a and the second plot 910b are preset as non - adjacent plots. The non - adjacency of the first plot 910a and the second plot 920b can be achieved by steps of selecting the plot boundary line, setting the additional point positions, and moving the additional point positions and / or the movable point positions in the pre - divided map 900.

[0078] The selection of the plot boundary line when the first plot and the second plot switch from an adjacent state to a non - adjacent state will be described below. In some embodiments, when the first plot and the second plot switch from an adjacent state to a non - adjacent state, the setting of additional points can be carried out on two plot boundary lines associated with the first plot and the second plot respectively. In order to ensure that after the movement of the additional points, the first plot and the second plot can be spaced apart, the plot boundary line intersecting the common side of the first plot and the second plot can be selected as the plot boundary line associated with the first plot and the second plot. In some embodiments, two plot boundary lines in the first plot that intersect the common side of the first plot and the second plot can be selected as the third plot boundary line and the fourth plot boundary line respectively. In some embodiments, as Figure 9 shown, in the pre - partitioned map 900, the first plot 910a and the second plot 910b have a common side 910a1. The plot boundary line 910a2 in the first plot 910a that intersects the common side 910a1 can be selected as the third plot boundary line, and another plot boundary line 910a3 that intersects the common side 910a1 can be selected as the fourth plot boundary line. In some embodiments, two plot boundary lines in the second plot that intersect the common side of the first plot and the second plot can be selected as the third plot boundary line and the fourth plot boundary line respectively, that is Figure 9 shown, the plot boundary line 910b1 and the plot boundary line 910b2 are respectively used as the third plot boundary line and the fourth plot boundary line, which is not limited herein.

[0079] The setting of additional points when the first plot and the second plot switch from an adjacent state to a non - adjacent state will be described below. In some embodiments, after the third plot boundary line and the fourth plot boundary line are selected, a third additional point can be set on the third plot boundary line, and a fourth additional point can be set on the fourth plot boundary line. Moreover, the preset points corresponding to the first plot and the second plot are respectively located on both sides of the line connecting the third additional point and the fourth additional point, so as to prevent the updated first plot and the second plot from still having a common side during the subsequent movement of the third additional point and the fourth additional point. In some embodiments, as Figure 9 shown, a third additional point a11 can be set on the third plot boundary line 910a2, and a fourth additional point a12 can be set on the fourth plot boundary line 910a3. In some embodiments, the production staff can also set two or more additional points on the third plot boundary line and / or the fourth plot boundary line according to actual needs, which is not limited herein.

[0080] The moving method of the additional points and / or the movable points when the first plot and the second plot switch from an adjacent state to a non - adjacent state will be described below. Figure 10It is a schematic diagram of the movement process for adding another additional point and / or movable point according to some embodiments of this specification. In some embodiments, as Figure 10 shown, the process 1000 may include the following steps.

[0081] Step 1010: Move the third additional point to the position of the fourth additional point, causing the side connected to the third additional point to move accordingly, so as to realize the switch of the first plot and the second plot from the adjacent state to the non - adjacent state.

[0082] Figure 11 It is a schematic diagram of moving the third additional point according to some embodiments of this specification. In some embodiments, as Figure 11 shown, the third additional point a11 moves from its initial set position to the initial set position of the fourth additional point a12, causing the side 1110' connected to the third additional point a11 to move from Figure 11 the dashed - line position 1110' in Figure 11 to the solid - line position 1110 in Figure 11 and causing the side 1120' connected to the third additional point a12 to change from the dashed - line position 1120' in Figure 11 to the solid - line position 1120 in Figure 11 shown. In some embodiments, as Figure 11 shown, after step 1010, the first plot 910a and the second plot 910b no longer have a common side, realizing the switch from the adjacent state to the non - adjacent state.

[0083] In some embodiments, as Figure 11 shown, although the updated first plot 910a and second plot 910b have switched from the adjacent state to the non - adjacent state, in the Figure 11 shown map, there is a plot 1100a (i.e., the plot enclosed by the fourth additional point a12 and the two vertices of the common side 910a1) that does not contain any of the preset points. To meet the condition that there is a one - to - one correspondence between the preset points and the plots in the generated map, the above plot 1100a can be further eliminated by adding points and moving points. In some embodiments, as Figure 10 shown, the process 1000 may further include the following steps.

[0084] Step 1020: Set a fifth additional point on the plot boundary line formed by the fourth additional point and the third movable point on the common side, where the vertex of the common side close to the third additional point is set as the third movable point.

[0085] In some embodiments, as Figure 11As shown, the common side 910a1 of the first plot 910a and the second plot 910b includes vertices a13 and a14, where the vertex a13 is close to the initial setting position of the third additional point a11 and is set as the third movable point. At this time, the plot boundary line formed by the fourth additional point a12 and the third movable point a13 is the side 1120 as shown in Figure 11 , and the fifth additional point 1121 can be set on the side 1120.

[0086] Step 1030: Move the fifth additional point to the position of the fourth movable point in the second plot, so that the side connected to the fifth additional point moves accordingly, where the vertex in the common side close to the fourth additional point is set as the fourth movable point.

[0087] Figure 12 is a schematic diagram of moving the fifth additional point according to some embodiments of this specification. In some embodiments, as shown in Figure 11 and Figure 12 , the vertex a14 in the common side 910a1 of the first plot 910a and the second plot 910b is close to the initial setting position of the fourth additional point a12 and is set as the fourth movable point. In some embodiments, as shown in Figure 12 , the fifth additional point 1121 moves from the initial setting position to the position of the fourth movable point a14, so that the side 1210' connected to the fifth additional point 1121 moves from the Figure 12 dashed line position 1210' in to the Figure 11 solid line position 1210, and the side 1220' connected to the fifth additional point 1121 moves from the Figure 12 dashed line position 1220' in to the Figure 12 solid line position 910a1. In some embodiments, as shown in Figure 11 and Figure 12 , the updated map 1200 after step 1030 eliminates the plot 1100a and can meet the condition that the preset points and plots in the generated map correspond one by one.

[0088] In some embodiments, considering that during the process of adding points and / or movable points, the production staff will drive the edges connected to the added points and / or movable points to move together, which may cause the distribution of other plots to be affected when the first plot and the second plot switch between the adjacent state and the non - adjacent state, resulting in abnormal situations such as a plot containing more than one preset point or a plot not containing any preset points. Especially when the number of plots is large, it is difficult for the production staff to directly confirm whether the preset points and the plots correspond one by one through observation. Therefore, it is necessary to perform further verification operations on the re - partitioned map after the first plot and the second plot switch between the adjacent state and the non - adjacent state. In some embodiments, as Figure 2 shown, process 200 may further include the following steps.

[0089] Step 250: Based on the re - partitioned map after the first plot and the second plot switch between the adjacent state and the non - adjacent state, determine whether the plots in the re - partitioned map correspond one by one to the preset points; if so, use the re - partitioned map as the generated map. The following will explain how to determine whether the plots in the re - partitioned map correspond one by one to the preset points.

[0090] Figure 13 is an exemplary flowchart for determining whether the plots in the re - partitioned map correspond one by one to the preset points according to some embodiments of this specification. In some embodiments, as Figure 13 shown, process 1300 may include the following steps.

[0091] Step 1310: Obtain the minimum circumscribed matrix corresponding to each plot in the re - partitioned map. In some embodiments, the re - partitioned map may be located in a preset rectangular coordinate system, and the positions of the vertices of each plot and each preset point in the re - partitioned map can be determined by their coordinates in the rectangular coordinate system. Since it is difficult to directly determine the plot where the preset point is located based on the coordinates of the vertices, in some embodiments, the minimum circumscribed matrix corresponding to each plot can be obtained first according to the coordinates of the vertices of each plot, where the long side and the short side of the minimum circumscribed matrix are respectively parallel to the two coordinate axes of the rectangular coordinate system.

[0092] Figure 14 is a schematic diagram of the minimum circumscribed matrix corresponding to a plot according to some embodiments of this specification. As Figure 14As shown in the figure, the coordinates of the four vertices of plot 1410 are (x1, y1), (x2, y2), (x3, y3), and (x4, y4) respectively, where x1 is the minimum value in the X direction in the rectangular coordinate system XoY of the plane, x3 is the maximum value in the X direction in the rectangular coordinate system XoY of the plane, y2 is the minimum value in the Y direction in the rectangular coordinate system XoY of the plane, and y4 is the maximum value in the Y direction in the rectangular coordinate system XoY of the plane. Then the coordinates of the four vertices of the minimum circumscribed matrix 1420 corresponding to plot 1410 are (x1, y2), (x1, y4), (x3, y2), and (x3, y4).

[0093] Step 1320: For each preset point, obtain the plot corresponding to the minimum circumscribed matrix containing the preset point respectively as the plot to be judged corresponding to the preset point. In some embodiments, it can be judged whether it is located in the minimum circumscribed matrix according to the coordinates of the preset point in the rectangular coordinate system of the plane. In some embodiments, as Figure 14 shown, the coordinates corresponding to the preset point 1411 are (x0, y0). Since x0 is within the interval [x1, x3] and y0 is within the interval [y2, y4], it indicates that the preset point 1411 is located in the minimum circumscribed matrix 1420.

[0094] Step 1330: Based on the ray in the preset direction with the preset point as the origin, obtain the number of intersection points between the ray and the plot boundary line of the plot to be judged. In some embodiments, as Figure 14 shown, for the preset point 1411, the X direction in the rectangular coordinate system XoY of the plane can be used as the preset direction to construct a ray 1412, and obtain the number of intersection points between the ray 1412 and the plot boundary line of plot 1410.

[0095] Step 1340: Based on the number of intersection points, judge whether the preset point is located in the plot to be judged. In some embodiments, if the preset point is not located in the closed plot to be judged, then the ray in the preset direction with the preset point as the origin may not have an intersection point with the plot boundary line of the plot to be judged, or may have 2 intersection points, or may have a greater number of intersection points, and the number of intersection points is even; if the preset point is located in the closed plot to be judged, then the ray in the preset direction with the preset point as the origin will have at least 1 intersection point with the plot boundary line of the plot to be judged, and the number of intersection points is odd. Therefore, if the number of intersection points is odd, such as 1, it can be judged that the preset point is located in the plot to be judged. In some embodiments, if the number of intersection points is even, such as 0 or 2, it can be judged that the preset point is not located in the plot to be judged.

[0096] Step 1350: Based on the corresponding relationship between the preset points and the plot to be judged, determine whether the plots in the re-divided map correspond one-to-one with the preset points. In some embodiments, by making the above judgment on whether each preset point in the re-divided map is located in the plot to be judged, the number of plots corresponding to each preset point can be obtained. If all the preset points are only located in one plot to be judged, it means that there is no abnormal situation where more than one preset point is included in one plot in the re-divided map, and the preset points correspond one-to-one with the plots to be judged. In some embodiments, when the preset points correspond one-to-one with the plots to be judged, it is possible to further judge whether there is an abnormal situation where a plot in the re-divided map does not contain any preset points by judging whether the number of plots in the re-divided map is consistent with the number of preset points: if the number of plots is consistent with the number of preset points, it means that there is no abnormal situation where a plot in the re-divided map does not contain any preset points. In some embodiments, when the preset points correspond one-to-one with the plots to be judged, and the number of plots in the re-divided map is consistent with the number of the preset points, it can be judged that the plots in the re-divided map correspond one-to-one with the preset points.

[0097] In some embodiments, for the generated map in which the plots correspond one-to-one with the preset points, the production staff can also set one or more additional points on the boundary lines of the plots in the generated map according to actual needs, and adjust the edge shape of the plots by moving the additional points, so that the edge changes of the plots are more gentle and smooth.

[0098] Some embodiments of this specification also provide a map generation system. In some embodiments, the map may include at least one preset point, where the preset points can be pre-set by the 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. In some embodiments, the pre-divided map can be used as a game map in the scenario of a strategic type game, and the map may include multiple cities, and the positions of these cities in the map can correspond one-to-one with the preset points. Figure 15 is an exemplary block diagram of a map generation system shown according to some embodiments of this specification. In some embodiments, as Figure 15 shown, the system 1500 may include a plot acquisition module 1510, a boundary selection module 1520, a point addition module 1530, and a plot adjustment module 1540.

[0099] In some embodiments, the plot acquisition module 1510 is used to divide the map into regions based on the distribution of the preset points to obtain a pre-divided map, where the plots in the pre-divided map correspond one-to-one with the preset points, and the vertices of each plot correspond to a movable point.

[0100] In some embodiments, the boundary selection module 1520 is configured to select two plot boundary lines associated with the first plot and the second plot in the pre-partitioned map.

[0101] In some embodiments, the point addition module 1530 is configured to respectively set at least one additional point on the two plot boundary lines.

[0102] In some embodiments, the plot adjustment module 1540 is configured to move one of the additional points and / or movable points to other additional points or movable points, so that the side connected to the moved additional point and / or movable point is also moved, so as to realize the switching between the adjacent state and the non-adjacent state of the first plot and the second plot.

[0103] 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 carrier media such as magnetic disks, CDs, or DVD-ROMs, or in the memories of programmable devices. The systems and modules in this specification can be implemented not only by hardware circuits such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips and transistors, or programmable hardware devices such as field programmable gate arrays and programmable logic devices, but also by software implemented by various types of processors, or by a combination of the above hardware circuits and software (for example, firmware).

[0104] 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.

[0105] 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, it can implement the map generation method provided in the foregoing embodiments of this specification.

[0106] In some embodiments, the foregoing 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.

[0107] The beneficial effects that may be brought about 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, it is possible to quickly and conveniently achieve the area division of the map, saving the labor cost and time cost in the map generation stage compared to manual cutting by production personnel. (2) By adding points in the pre-partitioned map and moving the added points and the vertices of the plots to adjust the size and / or shape of the plots, it is possible to switch between the adjacent state and the non-adjacent state of any two plots, enabling production personnel to flexibly and freely adjust the adjacent state of the plots. 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.

[0108] 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 fall within the spirit and scope of the exemplary embodiments of this specification.

Claims

1. A method for generating a map, wherein the map includes at least one preset point, characterized in that: include: Based on the distribution of the preset points, the map is divided into regions to obtain the pre-blocked map, wherein the plots in the pre-blocked map correspond to the preset points one by one, and each vertex of the plot corresponds to a movable point; Selecting two plot boundaries associated with a first plot and a second plot in the pre-divided map; At least one additional point is set on each of the two land boundary lines; Move one of the additional points and / or the movable points to the other additional points or the movable points, so that the edges connected to the moved additional points and / or the movable points are moved together, so as to realize the switching of the first plot and the second plot between the adjacent state and the non-adjacent state.

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; The selecting of two land parcel boundary lines associated with the first land parcel and the second land parcel in the pre-block map comprises: Selecting a boundary line of a plot of the first plot close to the second plot as a first plot boundary line; Selecting a boundary line of the second plot of land close to the first plot of land as the boundary line of the second plot of land; The step of setting at least one additional point on the two land boundary lines comprises: Setting a first additional point on the boundary line of the first plot; Setting a second additional point on the boundary line of the second plot of land; Among them, the preset point corresponding to the plot located between the first plot and the second plot is located on one side of the line between the first additional point and the second additional point.

3. The method according to claim 2, characterized in that The moving one of the additional points and / or the movable points to the other additional points or the movable points so that the edges connected to the moved additional points and / or the movable points are moved together to achieve the switching between the adjacent state and the non-adjacent state of the first plot and the second plot, includes: Move the first additional point to the position of the second additional point, so that the edge connected to the first additional point moves together; Moving a first movable point on the boundary line of the first plot to a second movable point on the boundary line of the second plot, so that the edge connected to the first movable point moves together, so as to realize the switching of the first plot and the second plot from the non-adjacent state to the adjacent state; The first movable point and the second movable point are located on the same side of a line connecting the first additional point and the second additional point.

4. The method according to claim 1, characterized in that: In the pre-block map, the first block and the second block are in the adjacent state; The selecting of two land parcel boundary lines associated with the first land parcel and the second land parcel in the pre-block map comprises: Two plot boundary lines in the first plot that intersect with the common edge of the first plot and the second plot are selected as the third plot boundary line and the fourth plot boundary line respectively.

5. The method according to claim 4, characterized in that The step of setting at least one additional point on the two land boundary lines comprises: Setting a third additional point on the boundary line of the third plot; Setting a fourth additional point on the boundary line of the fourth plot; Among them, the preset point corresponding to the first plot of land and the preset point corresponding to the second plot of land are respectively located on both sides of the line between the third additional point and the fourth additional point.

6. The method according to claim 5, characterized in that The moving one of the additional points and / or the movable points to the other additional points or the movable points so that the edges connected to the moved additional points and / or the movable points are moved together to achieve the switching between the adjacent state and the non-adjacent state of the first plot and the second plot, includes: The third additional point is moved to the position of the fourth additional point, so that the edge connected to the third additional point is moved together, so as to realize the switching of the first plot and the second plot from the adjacent state to the non-adjacent state.

7. The method according to claim 6, characterized in that Also includes: After the third additional point is moved to the position of the fourth additional point, a fifth additional point is set on the land boundary formed by the fourth additional point and the third movable point of the common edge, wherein the vertex of the common edge close to the third additional point is set as the third movable point; The fifth additional point is moved to the position of the fourth movable point in the second plot, so that the edge connected to the fifth additional point is moved together, wherein the vertex of the common edge close to the fourth additional point is set as the fourth movable point.

8. The method according to claim 1, characterized in that The method further comprises: Based on the re-blocked map after the first block and the second block are switched between an adjacent state and a non-adjacent state, it is determined whether the blocks in the re-blocked map correspond one-to-one to the preset points; if so, the re-blocked map is used as the generated map.

9. The method according to claim 8, characterized in that The determining whether the land parcels in the re-blocked map correspond one-to-one to the preset points includes: Obtaining a minimum circumscribed matrix corresponding to each block in the re-blocked map; For each of the preset points, a plot corresponding to the minimum circumscribed matrix including the preset point is obtained as the plot to be determined corresponding to the preset point; Based on a ray in a preset direction with the preset point as the origin, obtaining the number of intersections between the ray and the boundary line of the plot to be determined; Based on the number of intersections, determining whether the preset point is located in the block to be determined; Based on the correspondence between the preset points and the plots to be judged, it is determined whether the plots in the re-blocked map correspond one-to-one to the preset points.

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.

Images