CN113633980B - Data generation method, device, computer equipment and storage medium - Google Patents
Data generation method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN113633980B CN113633980B CN202110890017.9A CN202110890017A CN113633980B CN 113633980 B CN113633980 B CN 113633980B CN 202110890017 A CN202110890017 A CN 202110890017A CN 113633980 B CN113633980 B CN 113633980B
- Authority
- CN
- China
- Prior art keywords
- room
- map
- preset
- module
- room module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000003993 interaction Effects 0.000 claims abstract description 25
- 238000004590 computer program Methods 0.000 claims description 6
- 210000004027 cell Anatomy 0.000 description 41
- 238000010586 diagram Methods 0.000 description 30
- 238000004364 calculation method Methods 0.000 description 10
- 238000004891 communication Methods 0.000 description 9
- 230000003287 optical effect Effects 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 230000006870 function Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 4
- 230000002093 peripheral effect Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 238000003032 molecular docking Methods 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 210000002457 barrier cell Anatomy 0.000 description 1
- 230000004888 barrier function Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000002347 injection Methods 0.000 description 1
- 239000007924 injection Substances 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000008707 rearrangement Effects 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Classifications
-
- A—HUMAN NECESSITIES
- A63—SPORTS; GAMES; AMUSEMENTS
- A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
- A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
- A63F13/50—Controlling the output signals based on the game progress
- A63F13/53—Controlling the output signals based on the game progress involving additional visual information provided to the game scene, e.g. by overlay to simulate a head-up display [HUD] or displaying a laser sight in a shooting game
- A63F13/537—Controlling the output signals based on the game progress involving additional visual information provided to the game scene, e.g. by overlay to simulate a head-up display [HUD] or displaying a laser sight in a shooting game using indicators, e.g. showing the condition of a game character on screen
- A63F13/5378—Controlling the output signals based on the game progress involving additional visual information provided to the game scene, e.g. by overlay to simulate a head-up display [HUD] or displaying a laser sight in a shooting game using indicators, e.g. showing the condition of a game character on screen for displaying an additional top view, e.g. radar screens or maps
-
- A—HUMAN NECESSITIES
- A63—SPORTS; GAMES; AMUSEMENTS
- A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
- A63F2300/00—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game
- A63F2300/30—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by output arrangements for receiving control signals generated by the game device
- A63F2300/303—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by output arrangements for receiving control signals generated by the game device for displaying additional data, e.g. simulating a Head Up Display
Abstract
The invention discloses a data generation method, a device, computer equipment and a storage medium, wherein the method comprises the following steps: acquiring a preset map rule, wherein the preset map rule at least comprises a map size, the number of preset rooms and a map starting point; selecting at least one preset room according to the preset map rule and adding the selected preset room to a maze map; marking the maze map according to the service attribute information to generate game interaction information. The embodiment of the invention realizes dynamic generation of the maze map, so that the user can enhance the use experience of the user when logging in different maps each time, reduce the error probability of random generation of the map and improve the stability of maze map generation.
Description
Technical Field
The embodiment of the invention relates to the technical field of computer application, in particular to a data generation method, a data generation device, computer equipment and a storage medium.
Background
In recent years, the game industry has rapidly developed, and more users have put higher demands on game quality. As a high-quality game, the existence of the maze plays a role in playing quality, the method of generating the maze directly has a direct influence on the running efficiency of the game, if the maze is calculated in real time, a great amount of equipment calculation performance is often required, if the maze is calculated in a fixed mode, the calculation cost of the game equipment is saved, the loading efficiency of the maze is improved, but the map generation is fixed, the user cannot be provided with higher freshness, and the game experience is greatly reduced.
However, the existing maze generation modes of the game are mainly two, one is to directly design a fixed maze map, and the other is to completely randomly generate the maze map. However, the two schemes have larger defects in terms of calculation cost and game experience, respectively, wherein the fixedly generated maze map has lower equipment calculation cost but lacks enough playability, and the randomly generated maze map has rich playability but has higher equipment calculation cost and is easy to generate map errors. What is needed is a maze data generation method with randomness and rationality, which improves the use experience of game users on the basis of reducing the equipment calculation cost.
Disclosure of Invention
The invention provides a data generation method, a data generation device, computer equipment and a storage medium, so as to realize random generation of maze map data, reduce the calculation cost of the equipment, provide rich map data for game players and improve the use experience of users.
In a first aspect, an embodiment of the present invention provides a data generating method, including:
acquiring a preset map rule, wherein the preset map rule at least comprises a map size, the number of preset rooms and a map starting point;
Selecting at least one preset room according to the preset map rule and adding the selected preset room to a maze map;
marking the maze map according to the service attribute information to generate game interaction information.
In a second aspect, an embodiment of the present invention further provides a data generating apparatus, where the apparatus includes:
the rule acquisition module is used for acquiring preset map rules, wherein the preset map rules at least comprise map sizes, preset room numbers and map starting points;
the room adding module is used for selecting at least one preset room to be added to the maze map according to the preset map rule;
and the service information module is used for marking the maze map according to the service attribute information so as to generate game interaction information.
In a third aspect, an embodiment of the present invention further provides a computer apparatus, where the computer apparatus includes:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the data generation method as described in any of the embodiments of the present invention.
In a fourth aspect, embodiments of the present invention further provide a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a data generation method according to any of the embodiments of the present invention.
According to the embodiment of the invention, the preset map rule for generating the maze is obtained, a plurality of preset rooms are selected according to the preset map rule and added to the maze map, service data information is marked for the maze map to serve as game interaction information, the calculation cost for real-time generation of the map is reduced by presetting the preset rooms, the maze map is randomly generated according to the preset map rule, dynamic generation of the maze map is realized, the user can use different maps logged in each time, the user experience can be enhanced, and the random generation error of the map can be reduced based on the preset rooms, so that the stability of generating the maze map can be improved.
Drawings
FIG. 1 is a flowchart of a data generating method according to a first embodiment of the present invention;
fig. 2a is an exemplary diagram of a room module according to a first embodiment of the present invention;
fig. 2b is an exemplary diagram of a room module according to a first embodiment of the present invention;
fig. 2c is an exemplary diagram of a room module according to a first embodiment of the present invention;
FIG. 2d is an exemplary diagram of a room module provided in accordance with one embodiment of the present invention;
fig. 2e is an exemplary diagram of a room module according to a first embodiment of the present invention;
fig. 3 is an exemplary diagram of a large room module according to a first embodiment of the present invention;
Fig. 4 is a flowchart of a data generating method according to a second embodiment of the present invention;
fig. 5 is a diagram showing an example of a preset room according to a second embodiment of the present invention;
FIG. 6 is an exemplary diagram of a maze map provided by a second embodiment of the present invention;
fig. 7a is an exemplary diagram of a room module according to a second embodiment of the present invention;
fig. 7b is an exemplary diagram of a room module according to a second embodiment of the present invention;
FIG. 8a is an exemplary diagram of a maze map provided by a second embodiment of the present invention;
FIG. 8b is an exemplary diagram of a maze map provided by a second embodiment of the present invention;
FIG. 9a is an exemplary diagram of a maze map provided by a second embodiment of the present invention;
FIG. 9b is an exemplary diagram of a maze map provided by a second embodiment of the present invention;
FIG. 9c is an exemplary diagram of a maze map provided by a second embodiment of the present invention;
FIG. 10 is an exemplary diagram of another maze map provided by the second embodiment of the present invention;
FIG. 11 is a schematic diagram of a data generating device according to an embodiment of the present invention;
fig. 12 is a schematic structural diagram of a computer device according to a fourth embodiment of the present invention.
Detailed Description
The invention is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting thereof. It should be noted that, for convenience of description, only some, but not all of the structures related to the present invention are shown in the drawings, and furthermore, embodiments of the present invention and features in the embodiments may be combined with each other without conflict.
Example 1
Fig. 1 is a flowchart of a data generating method according to an embodiment of the present invention, where the method may be applied to a game maze generation, and the method may be performed by a maze generation device, and the device may be implemented in hardware and/or software, and referring to fig. 1, the method according to the embodiment of the present invention specifically includes the following steps:
step 110, obtaining a preset map rule, wherein the preset map rule at least comprises a map size, a preset room number and a map starting point.
The preset map rule may be a preset rule for generating a maze, and the preset map rule may be specified by a game service provider or by a game participant, for example, a game user may manually input the size of the maze to be generated. The map size may be a parameter that controls the size of the generated maze map, and the map size may include the number of cells included in the maze map, and may be a length-width parameter of the maze map. The number of preset rooms may be the number of preset rooms included in the maze map, the preset rooms may be preset room modules, the room modules may be components of the maze map, and the map start point may be an entrance and exit position of the maze map, and may specifically be a marking parameter.
In the embodiment of the invention, the preset map rule may be specified by a game service provider and/or a game user, and may be obtained when the maze map is generated, where the preset map rule may at least include information such as a map size, a preset room number, and a map start point. For example, the game service provider may provide an initial preset map rule, where the preset map rule may include a map size, a preset number of rooms, a map start point, and the like, the user may change the initial preset map rule, adjust specific parameter values such as the map size, the preset number of rooms, the map start point, and the like, and the terminal device may obtain the preset map rule for generating the maze map when loading the game.
And 120, selecting at least one preset room according to preset map rules and adding the selected at least one preset room to the maze map.
Wherein, the preset room may be a preset room module, the preset room may be a constituent element of the maze map, the preset room may have different sizes, for example, may be divided into a 4*4 room module, a 5*5 large room module, a 3*3 small room module, etc., the preset room may be preset by a game service provider or a game user, one or more cells may be included in the preset room, and each cell may be marked with different service attributes, for example, a passage, a wall, an entrance, etc.
Specifically, in the generation process of the maze map, one or more preset rooms can be selected according to the acquired preset map rules and added into the maze map, and the placement mode of the preset rooms in the maze map can be randomly or according to the preset map rules.
And 130, marking the maze map according to the service attribute information to generate game interaction information.
The service attribute information can be information related to game service, the service attribute information can trigger an interaction process of a game, the service attribute information can comprise attribute information of related game interaction services such as a box, a door, a monster, a trap, a fire and the like, the service attribute information can be identification information, and the triggering of corresponding game interaction can be realized by marking different cells in a maze map through different identification information. The game interaction information can be a trigger effect of the game interaction service, can be related in advance by a game service provider, can be bound with the maze map, and provides corresponding game interaction experience for users.
In the embodiment of the invention, the maze map can be marked according to the service attribute information, the corresponding game interaction information is obtained according to the service attribute information marked in the game map, the game interaction of the maze map is generated, and it can be understood that the service attribute information can mark the maze map randomly or according to the rule preset by a game server.
According to the embodiment of the invention, the preset map rule for generating the maze is obtained, a plurality of preset rooms are selected according to the preset map rule and added to the maze map, service data information is marked for the maze map to serve as game interaction information, the calculation cost for real-time generation of the map is reduced by presetting the preset rooms, the maze map is randomly generated according to the preset map rule, dynamic generation of the maze map is realized, the user can use different maps logged in each time, the user experience can be enhanced, and the random generation error of the map can be reduced based on the preset rooms, so that the stability of generating the maze map can be improved.
Further, on the basis of the embodiment of the present invention, the preset room includes at least one of the following:
the room module consists of 5*5 cells and is divided into at least one group according to the connection mode of the cells; the large room module comprises a room formed by at least one 4*4 unit lattice, and the large room module is marked with an entrance and exit position and/or a map position; a cubicle module consisting of 3*3 cells.
In the embodiment of the invention, the preset rooms can be divided into room modules, large room modules and small room modules according to the size, wherein the room modules can be composed of 5*5 unit cells, the modes of the unit cells connected in each room module for passing are different, fig. 2 a-2 b show room modules in 5 different connection modes, white unit cells can represent positions for communication, and black unit cells can represent positions for not passing.
Specifically, the large room module may be a room formed by a plurality of 5*5 unit cells, and an entrance position mark may be provided in the large room module to ensure accessibility of the large room module in the maze map, further, the large room module may manage a position stored in the maze map, for example, a position located in a center, a lower left corner, a lower right corner, an upper left corner or an upper right corner of the maze map, and it may be understood that when the large room module is added to the maze map, the large room module may be added according to a position of the map, and if the large room does not have the position of the map, the large room module may be randomly added to the maze map according to a selected preset room. Fig. 3 is an exemplary diagram of a large room module provided in the first embodiment of the present invention, referring to fig. 3, the large room module may also be composed of 3 room modules 5*5, in order to ensure that the large room module is a reachable module, an outlet may be preset, and further, in order to further reduce the computing overhead of a terminal, service attribute information, such as a monster, a fire, a box, a trap, and the like, may be preset in the large room module to generate a mark of game interaction information.
In the embodiment of the invention, in order to enhance the flexibility of the maze map, the preset room module can also comprise a small room module, and the small room module can be composed of cells of 3*3 and can fill the maze map so as to reduce the error probability of the map and reduce the probability of inaccessible maze generation.
Example two
Fig. 4 is a flowchart of a data generating method according to a second embodiment of the present invention, where the embodiment of the present invention is embodied on the basis of the foregoing embodiment of the present invention, and referring to fig. 4, the method according to the embodiment of the present invention specifically includes the following steps:
step 210, a preset room is configured based on at least a preset number of unit cells.
Wherein the preset number may be a preset number parameter, different preset numbers may be set for different sizes of preset rooms, for example 5*5 or 4*4, etc.
In the embodiment of the invention, different preset numbers of cells can be used for forming different sizes to obtain preset rooms, and the cells in the preset rooms can comprise passable cells and non-passable cells.
Step 220, marking the accessible directions of the cells in the preset room.
The accessible direction may be a direction in which the cells may pass through, may represent a connection manner with other adjacent preset rooms, the accessible direction may be marked by using numbers, the numbers with different values may represent different accessible directions, fig. 5 is a schematic diagram of a mark of a preset room provided in the second embodiment of the present invention, referring to fig. 5,1 may represent an upper part, 2 may represent a right part, 3 may represent a lower part, and 4 may represent a left part.
In the embodiment of the invention, the connection state of the preset room can be marked by each cell included, so that the generation of the connection state in the preset room is realized, and it can be understood that when the connection state is marked, one cell can be marked as inaccessible, that is, the cell can be a position where a wall or the like cannot pass through, and one cell can be marked as accessible in a part of directions, for example, when the directions of the cells are marked as up or down by 1 and 3, the cell can be further marked as accessible in all directions, that is, all directions are accessible up, down, left and right.
And 230, adding game information marks for the preset rooms.
The game information marks can be mark information of game interaction service, can represent game interaction triggered by unit grids in a preset room, can be character strings composed of numbers, letters and special symbols, can represent different game information marks, and can be understood that part of game information marks can be added in the process of generating the preset room, and the other part of game information marks can be added in the process of generating a maze map, so that the randomness of the game is improved on the basis of ensuring the generating efficiency of the maze map.
Specifically, corresponding game information marks may be stored for each cell in the preset room, the game information marks may identify the type of the game interaction service trigger, and further, the adding process of the game information marks may be to store the game information marks in association with the identification numbers of the cells.
Further, on the basis of the above embodiment of the present invention, the game information mark includes at least one of: obstacle markers, monster markers, treasured box markers, refresh point markers, doorway markers.
In the embodiment of the invention, the game information marks are divided into barrier marks, monster marks, box marks, refreshing point marks and entrance marks according to the types of the game interactive service, and each cell can be identified by one or more game information marks.
Step 240, obtaining a preset map rule, wherein the preset map rule at least comprises a map size, a preset room number and a map starting point.
Further, on the basis of the above embodiment of the present invention, the preset map rule includes at least one of the following:
presetting the appearance position of a room in a maze map; the number of preset rooms included within the maze map; the connection mode of rooms is preset in the maze map.
In an embodiment of the present invention, the preset map rule may include a position of a preset room in the maze map, for example, the large room module is set at a fixed position of the maze map, and at least one entrance and exit of the large room module is required to be connected to the edge. The preset map rule may also include a number of preset rooms, for example, a large room module may include only one in the maze map, or a maximum number of room modules in the maze map, etc. The preset map rules may also include a connection manner of preset rooms within the maze map, for example, directions of accessibility of entrances and exits of adjacent preset rooms are opposite to each other.
Step 250, randomly selecting a room module, a large room module and a small room module according to the size of the maze map.
In the embodiment of the invention, the preset rooms such as the room module, the big room module, the small room module and the like which can be contained can be selected according to the size of the maze map, and the room module, the big room module and the small room module can be selected at the same time or can be selected as a part of the preset rooms, for example, only the room module and the small room module can be selected without selecting the big room module.
And 260, placing the large room module on the maze map according to the position of the map.
Specifically, the map location of the large room module may be obtained, where the map location may be preconfigured or randomly calculated, and the large room module may be added to the region in the maze map corresponding to the map location.
Step 270, randomly selecting a room module and/or a small room module to be placed on the maze map by taking the entrance and exit of the large room module as a starting point.
In the embodiment of the present invention, an entrance of a large room module may be used as a starting point, one room module or a small room module may be randomly selected, and whether the entrance of the selected room module or small room module corresponds to the entrance of the large room module may be determined.
And 280, reselecting the non-drawn room module or small room module by taking the entrance and exit of the room module or small room module as a starting point, and adding the non-drawn room module or small room module to the maze map until the selected room module, large room module and small room module are placed.
In the embodiment of the invention, after the preset room comprising the room module and the small room module is added to the maze map, the selected room module or the small room module can be continuously obtained according to the entrance and exit of the newly added preset room as a starting point and added to the maze map, the above process is repeatedly executed until all the selected preset rooms are placed, and further, if the preset room which cannot be placed exists in the maze map, error reporting information corresponding to the preset room is generated, and a user is prompted that the preset room cannot be added to the maze map.
Step 290, marking the maze map according to the business attribute information to generate game interaction information.
According to the embodiment of the invention, a preset number of unit lattices are used to form preset rooms, the accessible directions of all the unit lattices in the preset rooms are marked, game information marks are added for the preset rooms, preset map rules are acquired, the preset rooms are acquired according to the size of the labyrinth map, the preset rooms comprise at least one of room modules, large room modules and small room modules, the large room modules are added to corresponding areas of the labyrinth map according to the positions of the maps, one or more room modules or small room modules are selected from the entrances and exits of the large room modules as starting points, the entrance and exit of the newly added room modules or the entrance and exit of the small room modules as new starting points, the preset rooms are selected from the entrances and exits of the newly added room modules and the entrance and exits of the small room modules as new starting points, the process is repeated until all the selected preset rooms are added to the labyrinth map, service attribute information is added for the labyrinth map to generate game interaction information, dynamic generation of the labyrinth map is realized, the user login map is different, the user experience can be enhanced, random generation of the map can be reduced, random generation errors can be reduced based on the preset room, and the map generation stability can be improved.
Further, on the basis of the above embodiment of the present invention, the selecting, randomly, the room module and/or the small room module from the gateway of the large room module as a starting point, to be placed on the maze map includes:
acquiring an accessible direction mark of an access port of a large room module; acquiring selected room modules and small room modules according to the passable marks, wherein the accessible direction marks of the entrances and exits of the room modules and the small room modules correspond to the passable direction marks; and adding the acquired room module to a corresponding position of the maze map.
The accessibility direction mark can be mark information reflecting the passing direction of the preset room, the accessibility direction mark can be determined in the generation process of the preset room, and the accessibility direction marks with different values can represent different accessibility directions of different preset rooms.
In the implementation of the invention, the accessibility marks stored in the cells of the gateway of the large room module can be obtained, then the accessibility marks stored in the cells of the gateway of the preset room such as the selected room module or the small room module can be sequentially obtained, and if the accessibility marks correspond to the accessibility marks of the large room module, the corresponding can comprise directions just opposite to each other. The preset room can be determined to be a room module to be added, and the room module can be added to an area corresponding to an inlet and an outlet of a large room module in the maze map, so that the selected small room module or the inlet and the outlet of the room module are connected with the inlet and the outlet of the large room module. Fig. 6 is an exemplary diagram of a maze map provided in the second embodiment of the present invention, and referring to fig. 6, an entrance of a large room module may be connected to an entrance of a room module.
In an exemplary embodiment, a data generation method may include the steps of:
(1) Generating room modules, and manufacturing a batch of 5*5 room modules, wherein each module consists of 25 grids for being spliced into a maze map, and each room module can comprise barrier cells and passage cells; each room module needs to mark the directions of accessibility over the edge cells, and each edge can represent the up, right, down, left, etc. directions according to the counterclockwise direction marks 1,2,3, 4. Further, a fixed configuration of the room module, such as a box, a door, etc., which needs to be marked may be configured by planning, the room module may be represented as a baby room module or a trap room module, etc., and the business room module may be shown in fig. 7a and 7b, respectively, as a monster+baby room module and a door plus baby room module. In the embodiment of the invention, the room modules can be grouped, so that a certain group of room modules does not exceed an upper limit when the maze is generated, for example, the sum of monster rooms and box rooms does not exceed 3.
(2) A fixed-position large room module, a fixed-position small room module and the like are arranged. First, large room modules may be composed of fixed size cells, with the large room modules having fixed monsters, treasures, refresh points, and fixed entrances and exits to the large room modules in addition to the obstructions to the room, fixed refresh areas. The communication between the large room module and other outside room modules only judges whether the inlet is communicated with the outlets of the other room modules. The large room is connected with the rooms of which the sizes are regulated to be a plurality of 4*4, and the access opening is planned to be preset points on the sides of a certain room. The large room module can be placed at a fixed position of the map, or can be placed at a certain position of the maze map in a random mode according to room combination. When the large room modules are randomly placed, at least one point in all points of the entrance is guaranteed to be not connected with the edge. And only one large room module exists in the maze map. Second, a fixed 4*4 group of cubicle modules is specified, each group of cubicle modules has at least n (n is not more than 2) cubicle modules, the group of cubicle modules can randomly appear in the maze map, and if the appearance positions of the cubicle modules are fixed, the number of the cubicle modules appearing is not more than two.
(3) The preset map rules are obtained, for example, as specified map is generated by a combination of room modules of 3*3, each of which may be a small room module or a room module as described above at 4*4. Whether the map contains a preset large room module or not. Whether the room location appears randomly or a fixed location is configured. A fixed small room group and number of room modules appear in the maze map. The number of rooms included in the maze map, such as the maze map, includes 9 cells, of which 6 are rooms and the other cells are filled with walls.
(4) A maze map route is generated. Referring to fig. 8b, the maze map is 3*3 modules, each of which is composed of a large room (fixed room combination) +fixed 4*4 preset room+randomly selected 4*4 (rotatable) combination of the above preset rooms. Presetting a placement rule of a large room: a combination of several fixed rooms may be manually configured. The combination can be as follows: the large room assembly is manually configured in a fixed position of the module, such as in a middle position of the module. If the fixed position of the large room is not manually configured, a combination module meeting the combination requirement of the large room is randomly selected from the modules to place the large room. Referring to fig. 8a, if there is no need for a large room, a module is randomized from the map as the starting point. The route filling method is used for generating the route between all modules from a large room. The route filling method comprises the following steps: starting with the departure point of the large room (if the departure point of the large room is not configured, the modules on a base graph are randomly used as the departure point), randomly drawing one module to other adjacent nodes in the grid, next randomly selecting one module from the already drawn module group (comprising the departure point and the newly generated new random point), selecting the adjacent non-drawn modules to draw, and if the modules beside the module are all drawn, reselecting other modules, and so on. Fig. 9a is an exemplary diagram of another maze map provided in the second embodiment of the present invention, see fig. 9a, where the processing of the departure points of the large room is calculated according to the small rooms, for example, the large room is formed by 3 small rooms, the outlets may be located on the upper and lower sides of the large room, all the departure points in each small room are regarded as having to be led out of one line, it can be seen that the large room is formed by 3 small rooms, the left small room has to be led out of one outlet line, and the right small room has to be led out of one outlet line, if the large room is randomly placed, it is noted that the outlets of the left small room and the outlets of the right small room cannot be close to the wall to prevent the outlets from being blocked, see fig. 9b, the lower right outlet of the large room is blocked, and the upper left outlet of the large room is blocked, see fig. 9 c. Fig. 10 is an exemplary diagram of another maze map provided in the second embodiment of the present invention, referring to fig. 10, the maze map generation based on the above-mentioned data generation method may include the following steps:
First, other fixed rooms are filled.
If in addition to a large room, a fixed room a is needed, each room is polled from the road whether it can meet the fixed room requirement. If the fixed room A can rotate to meet the communication condition of the room 1, the fixed room A can be connected with a large room, and can also rotate to reach the conditions of 2 and 3. Then the fixed room combination is set to (rotation 1, room 1), (rotation 2, room 1), (rotation 3, room 1). . . . . (rotation 3, room 3), (rotation 4, room 3) are N in total, generated from one of N random species.
The next fixed room B is the same. And (3) injection: if the two adjacent sides of the large room and the room 1 are marked as connectable plots, the condition of judging the communication can be achieved by using a room edge plot alignment method, if 1,2 and 3 in the plots adjacent to the large room and the room 1 are marked as connectable plots, then any one of 2 three plots corresponding to 3 and 3 corresponding to 4 and 2 in the edge plots 1 of the room 1 is judged as connectable plots, and then the room is considered to be connectable.
In a second step, deriving from the known large room or starting point other rooms, such as the large room and the fixed room, both of which have been determined, room 3, it is possible to calculate from the edges of the large room and room 1 which alternative rooms can be filled as room 1 to ensure randomness with the large room. And calculating which alternative rooms can be filled as the room 2 from the edges of the large room and the fixed room, and ensuring communication with the large room and the room 3.
And the like, all rooms are filled.
If one room is filled, one side needs to be docked with other rooms, and the other side needs to be capable of docking with other rooms, the other side can be considered to be capable of docking with other rooms only by communicating with one land block. Note that preset rooms may have a swipe upper limit, preset rooms may be grouped, and may be set at each level of the map, which group of preset rooms swipe up to several, to prevent monster + treasures from being excessive.
Starting to generate data in the room, wherein the priority is as follows:
1. an entrance room is set, one room is selected as the entrance room at random, and an entrance point can be matched. If not, the random will not be deployed in a large room.
2. The exit rooms are set, and one room is selected as the exit room. The exit point may be dead. If not, the random will not be deployed in a large room.
3. One empty block is selected as an entrance block in the entrance room, and if the oil lamp is set to be on, another empty block is selected as an oil lamp module in the entrance module room. The oil lamp needs special settings: brushes are in the entrance room. One empty land is an oil lamp module. The oil lamp needs special settings: brushes are in the entrance room.
4. An empty block is selected as an outlet module in the outlet module room.
5. Monster refreshing there are two modes, one is to select several random monster positions for an empty block within all empty blocks. Another is to refresh monsters at random 0-2 plots in each room. If there is already a monster related combination in the room, such as monster + box, then no longer refreshing. The two random modes can be matched, and the two random modes are configured differently according to different maze requirements.
6. The treasures are refreshed, the overall quantity of the treasures is fixed, only one treasures is brushed in each room, the treasures are randomly put into a plurality of module rooms, and then the treasures are randomly put on land in the rooms. The box refreshing has special requirements: the random weight becomes larger if the room is close to the edge (corner room is larger than edge room than center room).
7. Other event refreshes, such as monuments, traps, etc., the globally limited number of items are the same as the first pattern of monster refreshes.
8. Doors, treasures, etc. require keys, or similar mechanisms, to be randomly generated in pairs.
9. The odd refresh rules counted by the above requirements are divided into two types: 1 rule of generating odd things, 2 rule of placing odd things, each odd thing needs to be configured separately.
Example III
Fig. 11 is a schematic structural diagram of a data generating device according to a third embodiment of the present invention, where, as shown in fig. 11, the data generating device according to an embodiment of the present invention may include: a rule acquisition module 301, a room addition module 302 and a business information module 303.
The rule obtaining module 301 is configured to obtain a preset map rule, where the preset map rule includes at least a map size, a preset number of rooms, and a map start point.
The room adding module 302 is configured to select at least one preset room to add to the maze map according to the preset map rule.
And the service information module 303 is used for marking the maze map according to the service attribute information to generate game interaction information.
According to the embodiment of the invention, the rule acquisition module is used for acquiring the preset map rule for generating the maze, the room adding module is used for selecting a plurality of preset rooms to be added to the maze map according to the preset map rule, the service information module is used for marking service data information for the maze map as game interaction information, the calculation cost for real-time generation of the map is reduced by presetting the preset rooms, the maze map is randomly generated according to the preset map rule, the dynamic generation of the maze map is realized, the user can use different registered maps each time, the use experience of the user can be enhanced, the random generation error of the map is reduced based on the preset rooms, and the generation stability of the maze map can be improved.
Further, on the basis of the above embodiment of the present invention, the apparatus further includes:
a room preset module for composing a preset room based on at least a preset number of cells; marking the accessibility direction of each cell in the preset room; adding game information marks for the preset rooms.
Further, on the basis of the above embodiment of the present invention, the game information mark in the device includes at least one of the following: obstacle markers, monster markers, treasured box markers, refresh point markers, doorway markers.
Further, on the basis of the embodiment of the present invention, the preset room in the device includes at least one of the following: the room module consists of 5*5 cells and is divided into at least one group according to the connection mode of the cells; the large room module comprises a room formed by at least one 4*4 unit lattice, and the large room module is marked with an entrance and exit position and/or a map position; a cubicle module consisting of 3*3 cells.
Further, on the basis of the above embodiment of the present invention, the preset map rule in the rule obtaining module 301 includes at least one of the following:
The preset room is arranged at the appearance position of the maze map; the number of preset rooms included in the maze map; and connecting modes of the preset rooms in the maze map.
Further, on the basis of the above embodiment of the present invention, the room adding module 302 in the apparatus includes:
and the room acquisition unit is used for randomly selecting the room module, the large room module and the small room module according to the size of the maze map.
And the room adding unit is used for placing the large room module on the maze map according to the position of the map.
And the room initial unit is used for randomly selecting the room module and/or the small room module to be placed on the maze map by taking the entrance and the exit of the large room module as a starting point.
And the room connection unit is used for reselecting the non-drawn room module or the small room module by taking the entrance and exit of the room module or the small room module as a starting point and adding the non-drawn room module or the small room module to the maze map until the selected room module, the large room module and the small room module are placed.
Further, on the basis of the above embodiment of the present invention, the room initialization unit is specifically configured to: obtaining an accessible direction mark of an access port of the large room module; acquiring the selected room module and the selected small room module according to the passable marks, wherein the passable direction marks of the entrances and exits of the room module and the small room module correspond to the accessible direction marks; and adding the acquired room module to a corresponding position of the maze map.
Example IV
Fig. 12 is a schematic structural diagram of a computer device according to a fourth embodiment of the present invention. FIG. 12 illustrates a block diagram of a computer device 312 suitable for use in implementing embodiments of the present invention. The computer device 312 shown in fig. 12 is merely an example and should not be construed as limiting the functionality and scope of use of embodiments of the present invention. Device 312 is a computing device for the update functionality of a typical intelligent robot map.
As shown in FIG. 12, the computer device 312 is in the form of a general purpose computing device. Components of computer device 312 may include, but are not limited to: one or more processors 316, a storage device 328, and a bus 318 that connects the different system components (including the storage device 328 and the processor 316).
Bus 318 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include industry standard architecture (Industry Standard Architecture, ISA) bus, micro channel architecture (Micro Channel Architecture, MCA) bus, enhanced ISA bus, video electronics standards association (Video Electronics Standards Association, VESA) local bus, and peripheral component interconnect (Peripheral Component Interconnect, PCI) bus.
Computer device 312 typically includes a variety of computer system readable media. Such media can be any available media that is accessible by computer device 312 and includes both volatile and nonvolatile media, removable and non-removable media.
The storage 328 may include computer system-readable media in the form of volatile memory, such as random access memory (Random Access Memory, RAM) 330 and/or cache memory 332. The computer device 312 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, storage system 334 may be used to read from and write to non-removable, nonvolatile magnetic media (not shown in FIG. 12, commonly referred to as a "hard disk drive"). Although not shown in fig. 12, a disk drive for reading from and writing to a removable nonvolatile magnetic disk (e.g., a "floppy disk"), and an optical disk drive for reading from and writing to a removable nonvolatile optical disk (e.g., a Compact Disc-Read Only Memory (CD-ROM), digital versatile Disc (Digital Video Disc-Read Only Memory, DVD-ROM), or other optical media) may be provided. In such cases, each drive may be coupled to bus 318 through one or more data medium interfaces. Storage 328 may include at least one program product having a set (e.g., at least one) of program modules configured to carry out the functions of embodiments of the invention.
Programs 336 having a set (at least one) of program modules 326 may be stored, for example, in storage 328, such program modules 326 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment. Program modules 326 generally perform the functions and/or methods in the described embodiments of the invention.
The computer device 312 may also communicate with one or more external devices 314 (e.g., keyboard, pointing device, camera, display 324, etc.), one or more devices that enable a user to interact with the computer device 312, and/or any devices (e.g., network card, modem, etc.) that enable the computer device 312 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 322. Moreover, the computer device 312 may also communicate with one or more networks such as a local area network (Local Area Network, LAN), a wide area network Wide Area Network, a WAN) and/or a public network such as the internet via the network adapter 320. As shown, network adapter 320 communicates with other modules of computer device 312 via bus 318. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with computer device 312, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, disk array (Redundant Arrays of Independent Disks, RAID) systems, tape drives, data backup storage systems, and the like.
The processor 316 executes various functional applications and data processing by running programs stored in the storage 328, for example, to implement the data generation method provided by the above-described embodiment of the present invention.
Example five
The embodiment of the invention provides a computer readable storage medium, on which a computer program is stored, which when executed by a processing device implements a data generating method as in the embodiment of the invention. The computer readable medium of the present invention described above may be a computer readable signal medium or a computer readable storage medium or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring a preset map rule, wherein the preset map rule at least comprises a map size, the number of preset rooms and a map starting point; selecting at least one preset room according to the preset map rule and adding the selected preset room to a maze map; marking the maze map according to the service attribute information to generate game interaction information.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including, but not limited to, an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units involved in the embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. Wherein the names of the units do not constitute a limitation of the units themselves in some cases.
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
Note that the above is only a preferred embodiment of the present invention and the technical principle applied. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, while the invention has been described in connection with the above embodiments, the invention is not limited to the embodiments, but may be embodied in many other equivalent forms without departing from the spirit or scope of the invention, which is set forth in the following claims.
Claims (8)
1. A method of data generation, the method comprising:
acquiring a preset map rule, wherein the preset map rule at least comprises a map size, the number of preset rooms and a map starting point;
selecting at least one preset room according to the preset map rule and adding the selected preset room to a maze map;
marking the maze map according to service attribute information to generate game interaction information;
the preset room comprises at least one of the following:
the room module consists of 5*5 cells and is divided into at least one group according to the connection mode of the cells;
The large room module comprises a room formed by at least one 4*4 unit lattice, and the large room module is marked with an entrance and exit position and/or a map position;
a small room module consisting of 3*3 cells;
the selecting at least one preset room according to the preset map rule to be added to the maze map comprises the following steps:
randomly selecting the room module, the large room module and the small room module according to the size of the maze map;
placing the large room module on the maze map according to the position of the map;
randomly selecting the room module and/or the small room module to be placed on the maze map by taking an entrance and an exit of the large room module as a starting point;
and re-selecting the non-drawn room module or the small room module by taking the entrance and exit of the room module or the small room module as a starting point, and adding the non-drawn room module or the small room module to the maze map until the selected room module, the large room module and the small room module are placed.
2. The method of claim 1, wherein the generating of the preset room comprises:
constructing a preset room based on at least a preset number of cells;
Marking the accessibility direction of each cell in the preset room;
adding game information marks for the preset rooms.
3. The method of claim 2, wherein the game information indicia comprises at least one of: obstacle markers, monster markers, treasured box markers, refresh point markers, doorway markers.
4. The method of claim 1, wherein the preset map rules comprise at least one of:
the preset room is arranged at the appearance position of the maze map;
the number of preset rooms included in the maze map;
and connecting modes of the preset rooms in the maze map.
5. The method according to claim 1, wherein the randomly selecting the room module and/or the small room module to be placed on the maze map starting from the entrance of the large room module comprises:
obtaining an accessible direction mark of an access port of the large room module;
acquiring the selected room module and the selected small room module according to the accessibility direction marks, wherein the accessibility direction marks of the entrances and exits of the room module and the small room module correspond to the accessibility direction marks;
And adding the acquired room module to a corresponding position of the maze map.
6. A data generation apparatus, the apparatus comprising:
the rule acquisition module is used for acquiring preset map rules, wherein the preset map rules at least comprise map sizes, preset room numbers and map starting points;
the room adding module is used for selecting at least one preset room to be added to the maze map according to the preset map rule;
the service information module is used for marking the maze map according to service attribute information so as to generate game interaction information;
the preset room in the device comprises at least one of the following: the room module consists of 5*5 cells and is divided into at least one group according to the connection mode of the cells; the large room module comprises a room formed by at least one 4*4 unit lattice, and the large room module is marked with an entrance and exit position and/or a map position; a small room module consisting of 3*3 cells;
the room adding module in the device comprises:
the room acquisition unit is used for randomly selecting the room module, the large room module and the small room module according to the size of the maze map;
The room adding unit is used for placing the large room module on the maze map according to the position of the map;
the room initial unit is used for randomly selecting the room module and/or the small room module to be placed on the maze map by taking an entrance and an exit of the large room module as a starting point;
and the room connection unit is used for reselecting the non-drawn room module or the small room module by taking the entrance and exit of the room module or the small room module as a starting point and adding the non-drawn room module or the small room module to the maze map until the selected room module, the large room module and the small room module are placed.
7. A computer device, the computer device comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the data generation method of any of claims 1-5.
8. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the data generation method according to any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110890017.9A CN113633980B (en) | 2021-08-04 | 2021-08-04 | Data generation method, device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110890017.9A CN113633980B (en) | 2021-08-04 | 2021-08-04 | Data generation method, device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113633980A CN113633980A (en) | 2021-11-12 |
| CN113633980B true CN113633980B (en) | 2023-12-05 |
Family
ID=78419574
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110890017.9A Active CN113633980B (en) | 2021-08-04 | 2021-08-04 | Data generation method, device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113633980B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20060115775A (en) * | 2005-05-06 | 2006-11-10 | 삼성전자주식회사 | Method and apparatus for generating crossword game automatically |
| CN107050860A (en) * | 2017-04-24 | 2017-08-18 | 网易（杭州）网络有限公司 | Method, device, storage medium and the processor of map generation |
| CN108108410A (en) * | 2017-12-12 | 2018-06-01 | 苏州蜗牛数字科技股份有限公司 | A kind of online game labyrinth ground drawing generating method |
| CN111437603A (en) * | 2020-03-30 | 2020-07-24 | 北京赤金智娱科技有限公司 | Method and system for generating map of electronic game |
| CN112057870A (en) * | 2020-09-18 | 2020-12-11 | 成都完美天智游科技有限公司 | Game level generation method and device, storage medium and computer equipment |
-
2021
- 2021-08-04 CN CN202110890017.9A patent/CN113633980B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20060115775A (en) * | 2005-05-06 | 2006-11-10 | 삼성전자주식회사 | Method and apparatus for generating crossword game automatically |
| CN107050860A (en) * | 2017-04-24 | 2017-08-18 | 网易（杭州）网络有限公司 | Method, device, storage medium and the processor of map generation |
| CN108108410A (en) * | 2017-12-12 | 2018-06-01 | 苏州蜗牛数字科技股份有限公司 | A kind of online game labyrinth ground drawing generating method |
| CN111437603A (en) * | 2020-03-30 | 2020-07-24 | 北京赤金智娱科技有限公司 | Method and system for generating map of electronic game |
| CN112057870A (en) * | 2020-09-18 | 2020-12-11 | 成都完美天智游科技有限公司 | Game level generation method and device, storage medium and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113633980A (en) | 2021-11-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Weber et al. | Interactive geometric simulation of 4d cities | |
| Cavallaro et al. | Assessment of urban ecosystem resilience through hybrid social–physical complex networks | |
| Sun et al. | Ungating the city: A permeability perspective | |
| Crociani et al. | Route choice in pedestrian simulation: Design and evaluation of a model based on empirical observations | |
| CN108140007A (en) | Across deployed position safely disposing application program | |
| CN105597318A (en) | Method, system and device for automatically generating random game scenes | |
| CN109754458A (en) | Construction method, device and the computer readable storage medium of three-dimensional scenic | |
| CN111437603A (en) | Method and system for generating map of electronic game | |
| Hamilton et al. | Learning through visual systems to enhance the urban planning process | |
| DE112018008032T5 (en) | INTERACTIVE ENVIRONMENTS USING VISUAL CALCULATION AND IMMERSIVE REALITY | |
| US20190236444A1 (en) | Functional synthesis of networks of neurosynaptic cores on neuromorphic substrates | |
| Schaffranek et al. | Space syntax for generative design: On the application of | |
| Ciullo et al. | A framework for building climate storylines based on downward counterfactuals: the case of the European Union Solidarity fund | |
| US8910043B2 (en) | Modifying spaces in virtual universes | |
| CN112023400A (en) | Height map generation method, device, equipment and storage medium | |
| CN113633980B (en) | Data generation method, device, computer equipment and storage medium | |
| Denny | Solving geometric optimization problems using graphics hardware | |
| Friedrich et al. | Flexible layering in hierarchical drawings with nodes of arbitrary size | |
| CN114925436A (en) | Method and system for generating building model based on single-floor house type graph | |
| Hubbard et al. | Modeling alternative sequences of events in dynamic geographic domains | |
| Lu et al. | Game approach to vulnerability analysis of evacuation highway networks | |
| CN106954207A (en) | A kind of method and device for the account attributes value for obtaining target terminal | |
| US11960798B1 (en) | Artificial intelligence systems and methods for processing parametric land plot data | |
| Mazurek et al. | A concept of innovation hub for smart applications, enabling pro-active approach to urban policy and planning processes | |
| US20150186778A1 (en) | Spatial reasoner for reasoning topological relation and directional relation between two geo-entities, method thereof, and recording medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |