CN112597258B - Splitting method and splitting system for dynamic area boundary in game map and computer readable storage medium - Google Patents
Splitting method and splitting system for dynamic area boundary in game map and computer readable storage medium Download PDFInfo
- Publication number
- CN112597258B CN112597258B CN202011308377.5A CN202011308377A CN112597258B CN 112597258 B CN112597258 B CN 112597258B CN 202011308377 A CN202011308377 A CN 202011308377A CN 112597258 B CN112597258 B CN 112597258B
- Authority
- CN
- China
- Prior art keywords
- inflection point
- position index
- map area
- adjacent
- adjacent inflection
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- 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/5372—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 tagging characters, objects or locations in the game scene, e.g. displaying a circle under the character controlled by the player
-
- 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
- A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
- A63F13/60—Generating or modifying game content before or while executing the game program, e.g. authoring tools specially adapted for game development or game-integrated level editor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
Abstract
The invention provides a splitting method, a splitting system and a computer readable storage medium for dynamic region boundaries in a game map, wherein the splitting method comprises the following steps: acquiring a merging area comprising a first map area and a second map area; traversing a boundary of the first map region; traversing adjacent inflection points C of the first map area, and calculating a position index S of the second boundary unit; marking adjacent inflection points CiAnd adjacent inflection point Ci‑1Is in a processed state; mark self-position index Si‑2To position index Si‑1The detour route is from the adjacent inflection point Ci‑2To an adjacent inflection point Ci‑1The detour path of (a) is a first inner boundary; obtaining adjacent inflection points C around the starting directioni‑n‑1And adjacent inflection point Ci‑n‑1Corresponding position index Si‑n‑1(ii) a Mark self-position index Si‑nTo position index Si+1The detour path of (a) is a first outer boundary; the first map area and the second map area are split along the first inner boundary. By adopting the technical scheme, the boundary of the changed map area can be updated with smaller load and extremely short time.
Description
Technical Field
The present invention relates to the field of game control, and in particular, to a method and a system for splitting a boundary of a dynamic area in a game map, and a computer-readable storage medium.
Background
With the rapid development of the intelligent terminal, the situation that a user uses the intelligent terminal to perform various operations is more and more common, and particularly, the situation that the user uses the intelligent terminal to perform games is the most common. In the case of an SLG game (simulation game), a large number of game maps are required to be present in the game for the user to manipulate the game object to move within the game map.
In the prior art, the game maps in the games are distinguished in a region dyeing mode, and the game maps which do not belong to the same battle and are not played by players are marked as different map regions. Usually a map area is composed of a plurality of map pixels of a quadrilateral shape, and there are few cases where map pixels of a hexagonal shape are used. The reason for this is mainly that the regions of the hexagonal map pixels are colored in more challenging places than quadrangles, for example, more load is required during operation for fast calculation of the region boundaries; the need for rapid update when expanding and contracting regions; when the map is zoomed, the boundary line of the map needs to be rendered smoothly; when the map area has the change of the affiliated marketing, the boundary of the map area is required to be dynamically changed correspondingly. Because of the difficulty of implementation, game manufacturers generally do not employ hexagonal map pixels.
Therefore, a new method, system and computer readable storage medium for splitting dynamic region boundaries in a game map are needed, which can quickly define new boundaries of a map region when the attribution of the map region changes.
Disclosure of Invention
In order to overcome the above technical drawbacks, an object of the present invention is to provide a method, a system and a computer readable storage medium for splitting a boundary of a dynamic area in a game map, which update the boundary of a changed map area with a small load and a very short time.
The invention discloses a splitting method of dynamic region boundaries in a game map, which comprises the following steps:
acquiring a merging area comprising a first map area and a second map area, wherein the first map area is adjacent to the second map area and is in a to-be-split state;
traversing the boundary of the first map area to obtain an adjacent inflection point C on the boundary of the first map area;
traversing adjacent inflection points C of a first map area, and calculating position indexes S of a first boundary unit on the first map area, a second boundary unit corresponding to the first boundary unit on a second map area and a second boundary unit which are formed by connecting the adjacent inflection points C;
taking adjacent inflection points C spaced from the second map areaiFor the starting inflection point, the adjacent inflection points C are obtained around a starting directioni-1LogoRecording adjacent inflection point CiAnd adjacent inflection point Ci-1Is in a processed state;
by adjacent inflection points Ci-1For nodes, obtaining adjacent inflection points C around the starting directioni-2Marking adjacent inflection points Ci-1And adjacent inflection point Ci-2Is in a processed state and takes an adjacent inflection point Ci-2Corresponding position index Si-2Obtaining a position index S around a rotation direction opposite to the starting directioni-1Marking a self-position index Si-2To position index Si-1The detour route is from the adjacent inflection point Ci-2To an adjacent inflection point Ci-1The detour path of (a) is a first inner boundary;
repeatedly executing the above two steps until the adjacent inflection point Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining adjacent inflection points C around the starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1；
By position index Si-n-1Is a node, which is detoured around a rotational direction opposite to the starting direction up to a first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The detour path of (a) is a first outer boundary;
the first map area and the second map area are split along the first inner boundary to form respective boundaries of the first map area and the second map area.
Preferably, the above two steps are repeated while adjoining the inflection point Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining adjacent inflection points C around the starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1Comprises the following steps:
by adjacent inflection points Ci-2For nodes, obtaining adjacent inflection points C around the starting directioni-3Marking adjacent inflection points Ci-2And adjacent inflection point Ci-3Is in a processed state;
by adjacent inflection points Ci-3For nodes, obtaining adjacent inflection points C around the starting directioni-4Marking adjacent inflection points Ci-3And adjacent inflection point Ci-4Is in a processed state and takes an adjacent inflection point Ci-4Corresponding position index Si-4Obtaining a position index S around a rotation direction opposite to the starting directioni-3Marking a self-position index Si-4To position index Si-3The detour route is from the adjacent inflection point Ci-3To an adjacent inflection point Ci-4The detour path of (a) is a first inner boundary.
Preferably, the above two steps are repeated while adjoining the inflection point Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining adjacent inflection points C around the starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1Further comprising the steps of:
by adjacent inflection points Ci-4For nodes, obtaining adjacent inflection points C around the starting directioni-5Marking adjacent inflection points Ci-4And adjacent inflection point Ci-5Is in a processed state;
when adjacent to the inflection point Ci-5Corresponding position index Si-5As a contiguous inflection point S of a second map areai-5While obtaining adjacent inflection points C around the starting directioni-6And adjacent inflection point Ci-6Corresponding position index Si-6；
By position index Si-n-1Is a node, which is detoured around a rotational direction opposite to the starting direction up to a first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The step of detouring to form the first outer boundary includes:
by position index Si-6Is a node, which is detoured around a rotational direction opposite to the starting direction up to a first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1；
Mark self-position index Si-6To position index Si+1The detour route is a first outer boundary, wherein the first outer boundary is a position index Si-6To position index Si+1The direct link of (1).
Preferably, the method further comprises the following steps:
acquiring a third map area, wherein the third map area is adjacent to the position, relative to the second map area, beside the first map area;
calculating a third boundary unit corresponding to the first boundary unit and a position index S of the third boundary unit on the third map area;
by position index Si-n-1Is a node, which is detoured around a rotational direction opposite to the starting direction up to a first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The step of taking the detour path as the first outer boundary comprises the following steps:
by adjacent inflection points Ci+1For a node, an adjacent inflection point C marked as processed is obtained around the starting directioni+1And obtaining an adjacent inflection point Ci+1Corresponding position index Si+1；
By position index Si+1As a node, goes around to the adjacent inflection point C around a rotation direction opposite to the initial directioni-nObtaining a contiguous inflection point Ci-nCorresponding position index Si-nMarking a self-position index Si+1To position index Si-nIs the second outer boundary.
Preferably, the method further comprises the following steps:
by adjacent inflection points Ci-n-1For nodes, obtaining adjacent inflection points C around the starting directioni-n-2Marking adjacent inflection points Ci-n-1And adjacent inflection point Ci-n-2Is in a processed state;
by adjacent inflection points Ci-n-2For nodes, obtaining adjacent inflection points C around the starting directioni-n-3Marking adjacent inflection points Ci-n-3Is in a processed state;
taking adjacent inflection points Ci-n-4Corresponding position index Si-n-4Obtaining a position index S around a rotation direction opposite to the starting directioni-n-3Marking a self-position index Si-n-4To position index Si-n-3The detour route is from the adjacent inflection point Ci-n-2To an adjacent inflection point Ci-n-3The detour path of (a) is a second inner boundary;
repeating the above steps until the inflection point C is adjacent to the inflection pointi-nCorresponding position index Si-nAs a contiguous inflection point S of a third map areai+1When the map is divided into the first map area, the second map area and the third map area, the first inner boundary and the second inner boundary are divided into the first map area and the second map area respectively.
Preferably, the method further comprises the following steps:
judging whether the first map area is connected with a second map area channel in a state to be split or not;
when the first map area is connected with a second map area access in a state of waiting to be split, marking the first map area as an effective area;
and when the first map area is not connected with the second map area access in the state of waiting to be split, marking the first map area as a failure area.
The invention also discloses a system for splitting the dynamic area boundary in the game map, which comprises the following steps:
the system comprises an acquisition module, a splitting module and a splitting module, wherein the acquisition module acquires a merging area comprising a first map area and a second map area, and the first map area is adjacent to the second map area and is in a to-be-split state;
the traversal module is used for traversing the boundary of the first map area to obtain an adjacent inflection point C on the boundary of the first map area, traversing the adjacent inflection point C of the first map area, and calculating a first boundary unit on the first map area and a second boundary unit corresponding to the first boundary unit on the second map area which are formed by connecting two adjacent inflection points C;
a calculation module for taking adjacent inflection points C separated from the second map areaiFor the starting inflection point, the adjacent inflection points C are obtained around a starting directioni-1Marking adjacent inflection points CiAnd adjacent inflection point Ci-1Is in a processed state; by adjacent inflection points Ci-1For nodes, obtaining adjacent inflection points C around the starting directioni-2Marking adjacent inflection points Ci-1And adjacent inflection point Ci-2Is in a processed state and takes an adjacent inflection point Ci-2Corresponding position index Si-2Obtaining a position index S around a rotation direction opposite to the starting directioni-1Marking a self-position index Si-2To position index Si-1The detour route is from the adjacent inflection point Ci-2To an adjacent inflection point Ci-1The detour path of (a) is a first inner boundary; when adjacent to the inflection point Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining adjacent inflection points C around the starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1(ii) a By position index Si-n-1Is a node, which is detoured around a rotational direction opposite to the starting direction up to a first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The detour path of (a) is a first outer boundary;
and the splitting module splits the first map area and the second map area along the first inner boundary to form respective boundaries of the first map area and the second map area.
The invention also discloses a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps as described above.
After the technical scheme is adopted, compared with the prior art, the method has the following beneficial effects:
1. based on the hexagonal map pixels, new boundaries under the condition that the attribution of the map area is changed can be quickly defined;
2. the time consumption is short when the boundary of the combined map area is updated, the load is small, and the game experience of the user is improved.
Drawings
FIG. 1 is a schematic flow diagram of a resolution method according to a preferred embodiment of the present invention;
FIG. 2 is a schematic diagram of the operation of the resolution process in accordance with a preferred embodiment of the present invention;
fig. 3 is a schematic diagram of a splitting system in accordance with a preferred embodiment of the present invention.
Detailed Description
The advantages of the invention are further illustrated in the following description of specific embodiments in conjunction with the accompanying drawings.
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
The terminology used in the present disclosure is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used in this disclosure and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present disclosure. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
In the description of the present invention, it is to be understood that the terms "longitudinal", "lateral", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", and the like, indicate orientations or positional relationships based on those shown in the drawings, and are used merely for convenience of description and for simplicity of description, and do not indicate or imply that the referenced devices or elements must have a particular orientation, be constructed in a particular orientation, and be operated, and thus, are not to be construed as limiting the present invention.
In the description of the present invention, unless otherwise specified and limited, it is to be noted that the terms "mounted," "connected," and "connected" are to be interpreted broadly, and may be, for example, a mechanical connection or an electrical connection, a communication between two elements, a direct connection, or an indirect connection via an intermediate medium, and specific meanings of the terms may be understood by those skilled in the art according to specific situations.
In the following description, suffixes such as "module", "component", or "unit" used to denote elements are used only for facilitating the explanation of the present invention, and have no specific meaning in themselves. Thus, "module" and "component" may be used in a mixture.
In an embodiment of the invention, the basic elements of the game map are hexagonal map pixels. The pixels referred to in the invention are the smallest units forming a game map or a map area, and in the embodiment of the invention, the map pixels mainly adopt regular hexagons or regular quadrilaterals. Taking a regular hexagonal map pixel as an example, the edges of the hexagonal map pixel are defined as follows: ei represents the orientation of a certain edge of the map pixel in a regular hexagon; pi is the orientation of its six fixed points; OpEi is the opposite side of Ei, and according to the characteristics of the hexagon, the definition is as follows: the edge Ei is equal to Pi +1, OpEi is equal to or more than 3Ei-3: Ei +3, and the edge Ei of the hexagon is defined as a half edge by utilizing the axial symmetry property of the regular hexagon. When the sidelines to be calibrated are Ei and another Ei of the map pixels belonging to the same map area, stopping calibration; and when the sidelines to be calibrated are Ei and Fi belonging to the map pixels in two different map areas, continuing calibration.
A plurality of map pixels form a map area, and each map area belongs to a certain player in the game map or does not belong to any player when the game map is in a neutral state. To distinguish different ownership rights in a game map, the map area will have its zone boundaries rendered in different colors. Therefore, when the attribution of the map area is changed, for example, when a certain map area is newly occupied by a player, the rendered area boundary is changed. When the ownership of a certain map area by a player is lost, the rendered area boundary will also change. For changed region boundaries. The invention realizes the generation of the new zone boundary by adopting the following steps:
s100: acquiring a merging area comprising a first map area and a second map area, wherein the first map area is adjacent to the second map area and is in a to-be-split state;
according to a first map area and a second map area which are occupied by a certain player in a game map, the two map areas are adjacent and are split to form a new area boundary due to the fact that the game map is about to belong to a different player or camp. It can be understood that, in the currently merged state of the first map area and the second map area, the positions of the boundary points that the first map area and the second map area have before merging are initially recorded, and therefore, the split potential boundary information is recorded in advance.
S200: traversing the boundary of the first map area to obtain an adjacent inflection point C on the boundary of the first map area;
the adjacent inflection point C does not correspond to the boundary point one by one, namely, the position of the inflection point appearing on the boundary is regarded as the adjacent inflection point C.
S300: traversing adjacent inflection points C of a first map area, and calculating position indexes S of a first boundary unit on the first map area, a second boundary unit corresponding to the first boundary unit on a second map area and a second boundary unit which are formed by connecting the adjacent inflection points C;
according to the rule of correspondence of hexagonal map pixels, the adjacent inflection point C necessarily corresponds to the second boundary cell corresponding to the first boundary cell on the second map region and the position index S of the second boundary cell.
S400: taking adjacent inflection points C spaced from the second map areaiFor the starting inflection point, the adjacent inflection points C are obtained around a starting directioni-1Marking adjacent inflection points CiAnd adjacent inflection point Ci-1Is in a processed state;
in general, the starting direction may be counter-clockwise. First adjacent inflection point C passing after detour in the counterclockwise directioni-1Adjacent to the inflection point CiAnd adjacent inflection point Ci-1Should be subsequently processed as a compensation process for the boundary (i.e., the original non-boundary position would be added as the boundary), and is therefore marked as a processed state here, as if the two adjacent corners have been bypassed.
S500: by adjacent inflection points Ci-1For nodes, obtaining adjacent inflection points C around the starting directioni-2Marking adjacent inflection points Ci-1And adjacent inflection point Ci-2Is in a processed state and takes an adjacent inflection point Ci-2Corresponding position index Si-2Obtaining a position index S around a rotation direction opposite to the starting directioni-1Marking a self-position index Si-2To position index Si-1The detour route is from the adjacent inflection point Ci-2To an adjacent inflection point Ci-1The detour path of (a) is a first inner boundary;
next, when the user makes a detour, the user passes through a certain position index S, which is a block area in the map area, for example, an area where a game object operated by a preset user cannot pass through, such as a mountain or a river in the game map. Even in the case of map area merging, there is a portion similar to a hole in the map area due to the existence of the blocking area, and the boundary of the hole portion also shapes the inner boundary of the map area. For this, the inner boundary needs to be re-determined. Thus, self-position index Si-2To position index Si-1By-pass route ofSame self-adjacent inflection point Ci-1To an adjacent inflection point Ci-2Forms the first inner boundary.
S600: repeatedly executing the above two steps until the adjacent inflection point Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining adjacent inflection points C around the starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1；
In this step, the above-mentioned step S400 and step S500 are continuously executed, and the adjacent inflection point C is knowni-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nIn this embodiment, the adjacent inflection point S of the second map areai-nThat is, the obvious boundary inflection point of the second map region, i.e., the adjacent inflection point S of the first map region and the second map regioni-nExtending oppositely to form respective regions. In this case, the adjoining inflection point C is obtained around the starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1Thus, the original boundary of the combined map area is restored to the boundary of the first map area.
S700: by position index Si-n-1Is a node, which is detoured around a rotational direction opposite to the starting direction up to a first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The detour path of (a) is a first outer boundary;
in this step S700, S is indexed by positioni-n-1Is a node, which is detoured around a rotational direction opposite to the starting direction up to a first adjacent inflection point C which is not marked as a processed statei+1And if the detour route is along the outer boundary of the second map area, forming a new combined boundary by using the original boundary of the second map area.
S800: splitting the first map area and the second map area along the first inner boundary to form respective boundaries of the first map area and the second map area
In a preferred embodiment, the above two steps are repeated until the corner C is adjacent to the corner Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining an adjacent inflection point C around said starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1The step S600 specifically includes:
s610: by adjacent inflection points Ci-2For nodes, obtaining adjacent inflection points C around the starting directioni-3Marking adjacent inflection points Ci-2And adjacent inflection point Ci-3Is in a processed state;
s620: by adjacent inflection points Ci-3For nodes, obtaining adjacent inflection points C around the starting directioni-4Marking adjacent inflection points Ci-3And adjacent inflection point Ci-4Is in a processed state and takes an adjacent inflection point Ci-4Corresponding position index Si-4Obtaining a position index S around a rotation direction opposite to the starting directioni-3Marking a self-position index Si-4To position index Si-3The detour route is from the adjacent inflection point Ci-3To an adjacent inflection point Ci-4The detour path of (a) is a first inner boundary.
Further, step S600 further includes:
s630: by adjacent inflection points Ci-4For nodes, obtaining adjacent inflection points C around the starting directioni-5Marking adjacent inflection points Ci-4And adjacent inflection point Ci-5Is in a processed state;
s640: when adjacent to the inflection point Ci-5Corresponding position index Si-5As a contiguous inflection point S of a second map areai-5While obtaining adjacent inflection points C around the starting directioni-6And adjacent inflection point Ci-6Corresponding position index Si-6Thereby bypassing the second map region from its neighboring portion to the self-boundary of the first map region.
At the same time, indexing S by positioni-n-1Is a node, and goes around a rotation direction opposite to the starting direction until the first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The step S700 of taking the detour route as the first outer boundary specifically includes:
s710: by position index Si-6Is a node, which is detoured around a rotational direction opposite to the starting direction up to a first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1；
S720: mark self-position index Si-6To position index Si+1The detour route is a first outer boundary, wherein the first outer boundary is a position index Si-6To position index Si+1The direct link of (1).
In another preferred embodiment, when a merged area including three map areas needs to be split, the splitting method of the present invention further includes the following steps:
s900: acquiring a third map area, wherein the third map area is adjacent to the position, relative to the second map area, beside the first map area;
s1000: calculating a third boundary unit corresponding to the first boundary unit and a position index S of the third boundary unit on the third map area;
by position index Si-n-1Is a node, and goes around a rotation direction opposite to the starting direction until the first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1Step S700, in which the detour path is the first outer boundary, includes:
s1100: by adjacent inflection points Ci+1For a node, an adjacent inflection point C marked as processed is obtained around the starting directioni+1And obtaining an adjacent inflection point Ci+1Corresponding position index Si+1；
S1200: by position index Si+1As a node, goes around to the adjacent inflection point C around a rotation direction opposite to the initial directioni-nObtaining a contiguous inflection point Ci-nCorresponding position index Si-nSelf-alignment of the markIndex Si+1To position index Si-nIs the second outer boundary.
Further, in a preferred embodiment, the splitting method further includes the following steps:
s1300: by adjacent inflection points Ci-n-1For nodes, obtaining adjacent inflection points C around the starting directioni-n-2Marking adjacent inflection points Ci-n-1And adjacent inflection point Ci-n-2Is in a processed state;
s1400: by adjacent inflection points Ci-n-2For nodes, obtaining adjacent inflection points C around the starting directioni-n-3Marking adjacent inflection points Ci-n-3Is in a processed state;
s1500: taking adjacent inflection points Ci-n-4Corresponding position index Si-n-4Obtaining a position index S around a rotation direction opposite to the starting directioni-n-3Marking a self-position index Si-n-4To position index Si-n-3The detour route is from the adjacent inflection point Ci-n-2To an adjacent inflection point Ci-n-3The detour path of (a) is a second inner boundary;
s1600: repeating the above steps until the inflection point C is adjacent to the inflection pointi-nCorresponding position index Si-nAs a contiguous inflection point S of a third map areai+1When the map is divided into the first map area, the second map area and the third map area, the first inner boundary and the second inner boundary are divided into the first map area and the second map area respectively.
Referring to fig. 2, taking the embodiment as an example, the first map area is area C, the second map area and the third map area are area a and area B, respectively, the merged map area includes merged area A, B, C, and area a, area B and area C are required to be split independently. Traversing the region C to obtain an adjacent inflection point C of the region C0-C11Wherein is adjacent to the inflection point C0-C5Corresponding to the position index S on the area A0-S5Adjacent to the inflection point C6-C11Corresponding to the position index S on the area B6-S11。
-a starting inflection point of C11，C11Jump to C around counter-clockwise10，C10Jump to C9When the jumping-over process is found to pass through the blocking area, the cut-off position C is used9Corresponding S9For position indexing, clockwise detour to S along the blocking region10Record the S9To S10A detour path of, and C10Returns to C9Is the first inner boundary.
After recording, continue from the cut-off position C9Starting, jumping to C counterclockwise8，C8Jump to C7When the jumping-over process passes through the blocking area, the cut-off position C is used7Corresponding S7For position indexing, clockwise detour to S along the blocking region8Record the S7To S8A detour path of, and C8Returns to C7Is the second inner boundary.
After recording, continue from the cut-off position C7Starting, jumping to C counterclockwise6，C6Jump to C5When a jump from area B to area A is found, the cut-off position C is used5Corresponding S5For position indexing, clockwise detour to S along the blocking region0(go around the boundary of region B and stop position is C which is first not marked as processed0Corresponding S0) Record the S6To S11Is the first outer boundary.
After recording, continue from the cut-off position C11Starting, jumping to C counterclockwise0Discovery C11Marked as processed, then the position C is cut off11Corresponding S11For position indexing, clockwise detour to S6(go around the boundary of region A and the stop position is the first position index S of region B6) Record the S11To S6Is the second outer boundary.
After recording, continue from the cut-off position C6Starting, jumping to C counterclockwise5，C5Jump to C4，C4Jump to C3It has foundWhen the jumper passes through the blocking area again in the process of jumper connection, the cutoff position C is adopted3Corresponding S3For position indexing, clockwise detour to S along the blocking region4Record the S3To S4A detour path of, and C4Returns to C3Is the third inner boundary.
After recording, continue from the cut-off position C3Starting, jumping to C counterclockwise2，C2Jump to C1When the jumping-over process passes through the blocking area, the cut-off position C is used1Corresponding S1For position indexing, clockwise detour to S along the blocking region2Record the S1To S2A detour path of, and C2Returns to C1Is the fourth inner boundary.
After recording, continue from the cut-off position C1Starting, jumping to C counterclockwise0，C0Jump to C11And the discovery returns to the initial inflection point, then the outer boundary of region B itself, first inner boundary, second inner boundary are sealed, form region B, the outer boundary of region A itself, third inner boundary, fourth inner boundary are sealed, form region A, the outer boundary of first inner boundary, second inner boundary, third inner boundary, fourth inner boundary and region C itself is sealed, form region C.
Preferably or optionally, the splitting method further comprises the steps of:
s1700: judging whether the first map area is connected with a second map area channel in a state to be split or not;
in some cases, there is a connection or non-connection between adjacent map areas, i.e., whether a game object operated by a user can directly proceed from one map area to another adjacent map area. That is, even in the case of being adjacent, there is a possibility that the map regions are not communicated with each other. In the above case, if a third party map area, both connected to the two map area paths, is occupied by other players or camps, the two map areas should also be automatically split. In this regard, the step S1700 is performed.
S1800: when the first map area is connected with a second map area access in a state of waiting to be split, marking the first map area as an effective area;
s1900: and when the first map area is not connected with the second map area access in the state of waiting to be split, marking the first map area as a failure area.
Referring to fig. 3, in a preferred embodiment, a system for splitting a dynamic zone boundary in a game map is disclosed, comprising:
the system comprises an acquisition module, a splitting module and a splitting module, wherein the acquisition module acquires a merging area comprising a first map area and a second map area, and the first map area is adjacent to the second map area and is in a to-be-split state;
the traversal module is used for traversing the boundary of the first map area to obtain an adjacent inflection point C on the boundary of the first map area, traversing the adjacent inflection point C of the first map area, and calculating a first boundary unit on the first map area, a second boundary unit corresponding to the first boundary unit on the second map area and a position index S of the second boundary unit, wherein the first boundary unit and the second boundary unit are formed by connecting two adjacent inflection points C;
a calculation module for taking adjacent inflection points C separated from the second map areaiFor the starting inflection point, the adjacent inflection points C are obtained around a starting directioni-1Marking adjacent inflection points CiAnd adjacent inflection point Ci-1Is in a processed state; by adjacent inflection points Ci-1For nodes, obtaining adjacent inflection points C around the starting directioni-2Marking adjacent inflection points Ci-1And adjacent inflection point Ci-2Is in a processed state and takes an adjacent inflection point Ci-2Corresponding position index Si-2Obtaining a position index S around a direction of rotation opposite to said starting directioni-1Marking a self-position index Si-2To position index Si-1The detour route is from the adjacent inflection point Ci-2To an adjacent inflection point Ci-1The detour path of (a) is a first inner boundary; when adjacent to the inflection point Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining an adjacent inflection point C around said starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position indexSi-n-1(ii) a By position index Si-n-1Is a node, and goes around a rotation direction opposite to the starting direction until the first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The detour path of (a) is a first outer boundary;
and the splitting module splits the first map area and the second map area along the first inner boundary to form respective boundaries of the first map area and the second map area.
The invention also discloses a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps as described above.
It should be noted that the embodiments of the present invention have been described in terms of preferred embodiments, and not by way of limitation, and that those skilled in the art can make modifications and variations of the embodiments described above without departing from the spirit of the invention.
Claims (8)
1. A splitting method of dynamic region boundaries in a game map is characterized by comprising the following steps:
acquiring a merging area comprising a first map area and a second map area, wherein the first map area is adjacent to the second map area and is in a to-be-split state;
traversing the boundary of the first map area to obtain an adjacent inflection point C on the boundary of the first map area;
traversing adjacent inflection points C of the first map area, and calculating position indexes S of a first boundary unit on the first map area, a second boundary unit corresponding to the first boundary unit on a second map area and the second boundary unit, wherein the first boundary unit and the second boundary unit are formed by connecting two adjacent inflection points C;
taking a contiguous inflection point C spaced from the second map areaiFor the starting inflection point, the adjacent inflection points C are obtained around a starting directioni-1Marking adjacent inflection points CiAnd adjacent inflection point Ci-1Is in a processed state;
by adjacent inflection points Ci-1For nodes, obtaining adjacent inflection points C around the starting directioni-2Marking adjacent inflection points Ci-1And adjacent inflection point Ci-2Is in a processed state and takes an adjacent inflection point Ci-2Corresponding position index Si-2Obtaining a position index S around a direction of rotation opposite to said starting directioni-1Marking a self-position index Si-2To position index Si-1The detour route is from the adjacent inflection point Ci-2To an adjacent inflection point Ci-1The detour path of (a) is a first inner boundary;
repeating the above steps until the inflection point C is adjacent to the inflection pointi-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining an adjacent inflection point C around said starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1；
By position index Si-n-1Is a node, and goes around a rotation direction opposite to the starting direction until the first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The detour path of (a) is a first outer boundary;
and splitting the first map area and the second map area along the first inner boundary to form respective boundaries of the first map area and the second map area.
2. The splitting method according to claim 1,
repeatedly executing the above two steps until the adjacent inflection point Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining an adjacent inflection point C around said starting directioni-n-1And adjacent toConnecting inflection point Ci-n-1Corresponding position index Si-n-1Comprises the following steps:
by adjacent inflection points Ci-2For nodes, obtaining adjacent inflection points C around the starting directioni-3Marking adjacent inflection points Ci-2And adjacent inflection point Ci-3Is in a processed state;
by adjacent inflection points Ci-3For nodes, obtaining adjacent inflection points C around the starting directioni-4Marking adjacent inflection points Ci-3And adjacent inflection point Ci-4Is in a processed state and takes an adjacent inflection point Ci-4Corresponding position index Si-4Obtaining a position index S around a direction of rotation opposite to said starting directioni-3Marking a self-position index Si-4To position index Si-3The detour route is from the adjacent inflection point Ci-3To an adjacent inflection point Ci-4The detour path of (a) is a first inner boundary.
3. The splitting method according to claim 2,
repeatedly executing the above two steps until the adjacent inflection point Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining an adjacent inflection point C around said starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1Further comprising the steps of:
by adjacent inflection points Ci-4For nodes, obtaining adjacent inflection points C around the starting directioni-5Marking adjacent inflection points Ci-4And adjacent inflection point Ci-5Is in a processed state;
when adjacent to the inflection point Ci-5Corresponding position index Si-5As a contiguous inflection point S of a second map areai-5While obtaining an adjacent inflection point C around said starting directioni-6And adjacent inflection point Ci-6Corresponding position index Si-6；
By position index Si-n-1Is a node, and goes around a rotation direction opposite to the starting direction until the first adjacent inflection point C which is not marked as a processed statei+1To obtain abutmentInflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The step of detouring to form the first outer boundary includes:
by position index Si-6Is a node, and goes around a rotation direction opposite to the starting direction until the first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1；
Mark self-position index Si-6To position index Si+1The detour route is a first outer boundary, wherein the first outer boundary is a position index Si-6To position index Si+1The direct link of (1).
4. The splitting method according to claim 1, further comprising the steps of:
acquiring a third map area, wherein the third map area is adjacent to the position of the first map area relative to the second map area;
calculating a third boundary unit corresponding to the first boundary unit and a position index S of the third boundary unit on a third map area;
by position index Si-n-1Is a node, and goes around a rotation direction opposite to the starting direction until the first adjacent inflection point C which is not marked as a processed statei+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The step of taking the detour path as the first outer boundary comprises the following steps:
by adjacent inflection points Ci+1For a node, obtaining an adjacent inflection point C marked as processed around the starting directioni+1And obtaining an adjacent inflection point Ci+1Corresponding position index Si+1；
By position index Si+1Is a node, and goes around to the adjacent inflection point C around a rotation direction opposite to the initial directioni-nObtaining a contiguous inflection point Ci-nCorresponding position index Si-nMarking a self-position index Si+1To position index Si-nIs the second outer boundary.
5. The splitting method according to claim 4, further comprising the steps of:
by adjacent inflection points Ci-n-1For nodes, obtaining adjacent inflection points C around the starting directioni-n-2Marking adjacent inflection points Ci-n-1And adjacent inflection point Ci-n-2Is in a processed state;
by adjacent inflection points Ci-n-2For nodes, obtaining adjacent inflection points C around the starting directioni-n-3Marking adjacent inflection points Ci-n-3Is in a processed state;
taking adjacent inflection points Ci-n-4Corresponding position index Si-n-4Obtaining a position index S around a direction of rotation opposite to said starting directioni-n-3Marking a self-position index Si-n-4To position index Si-n-3The detour route is from the adjacent inflection point Ci-n-2To an adjacent inflection point Ci-n-3The detour path of (a) is a second inner boundary;
repeating the above steps until the inflection point C is adjacent to the inflection pointi-nCorresponding position index Si-nAs a contiguous inflection point S of a third map areai+1When the map is divided into the first map area, the second map area and the third map area, the first inner boundary and the second inner boundary are divided into the first map area and the second map area respectively.
6. The splitting method according to claim 1, further comprising the steps of:
judging whether the first map area is connected with a second map area channel in a state of waiting to be split or not;
when a first map area is connected with a second map area access in a state of waiting to be split, marking the first map area as an effective area;
and when the first map area is not connected with the second map area access in the state of waiting to be split, marking the first map area as a failure area.
7. A system for splitting dynamic zone boundaries within a game map, the system comprising:
the system comprises an acquisition module, a splitting module and a splitting module, wherein the acquisition module acquires a merging area comprising a first map area and a second map area, and the first map area is adjacent to the second map area and is in a to-be-split state;
the traversal module is used for traversing the boundary of the first map area to obtain an adjacent inflection point C on the boundary of the first map area, traversing the adjacent inflection point C of the first map area, and calculating a first boundary unit on the first map area, a second boundary unit corresponding to the first boundary unit on the second map area and a position index S of the second boundary unit, wherein the first boundary unit and the second boundary unit are formed by connecting two adjacent inflection points C;
a calculation module for taking adjacent inflection points C separated from the second map areaiFor the starting inflection point, the adjacent inflection points C are obtained around a starting directioni-1Marking adjacent inflection points CiAnd adjacent inflection point Ci-1Is in a processed state; by adjacent inflection points Ci-1For nodes, obtaining adjacent inflection points C around the starting directioni-2Marking adjacent inflection points Ci-1And adjacent inflection point Ci-2Is in a processed state and takes an adjacent inflection point Ci-2Corresponding position index Si-2Obtaining a position index S around a direction of rotation opposite to said starting directioni-1Marking a self-position index Si-2To position index Si-1The detour route is from the adjacent inflection point Ci-2To an adjacent inflection point Ci-1The detour path of (a) is a first inner boundary; when adjacent to the inflection point Ci-nCorresponding position index Si-nAs a contiguous inflection point S of a second map areai-nWhile obtaining an adjacent inflection point C around said starting directioni-n-1And adjacent inflection point Ci-n-1Corresponding position index Si-n-1(ii) a By position index Si-n-1Is a node, and goes around a rotation direction opposite to the initial direction until the first nodeContiguous inflection points C not marked as processedi+1Obtaining a contiguous inflection point Ci+1Corresponding position index Si+1Marking a self-position index Si-nTo position index Si+1The detour path of (a) is a first outer boundary;
and the splitting module splits the first map area and the second map area along the first inner boundary to form respective boundaries of the first map area and the second map area.
8. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011308377.5A CN112597258B (en) | 2020-11-20 | 2020-11-20 | Splitting method and splitting system for dynamic area boundary in game map and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011308377.5A CN112597258B (en) | 2020-11-20 | 2020-11-20 | Splitting method and splitting system for dynamic area boundary in game map and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112597258A CN112597258A (en) | 2021-04-02 |
| CN112597258B true CN112597258B (en) | 2022-03-04 |
Family
ID=75183631
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011308377.5A Active CN112597258B (en) | 2020-11-20 | 2020-11-20 | Splitting method and splitting system for dynamic area boundary in game map and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112597258B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012039990A2 (en) * | 2010-09-24 | 2012-03-29 | Hitachi Data Systems Corporation | System and method for managing scalability in a distributed database |
| CN106767730A (en) * | 2016-11-22 | 2017-05-31 | 航天恒星科技有限公司 | The satellite dynamic banded zone method for splitting described with static grid |
| CN108665508A (en) * | 2018-04-26 | 2018-10-16 | 腾讯科技（深圳）有限公司 | A kind of positioning and map constructing method, device and storage medium immediately |
| CN109544658A (en) * | 2017-09-21 | 2019-03-29 | 腾讯科技（深圳）有限公司 | The rendering method and device of map, storage medium, electronic device |
| CN110292772A (en) * | 2019-07-23 | 2019-10-01 | 上海网之易璀璨网络科技有限公司 | The method and device of map is synthesized in game |
| CN111176282A (en) * | 2019-12-31 | 2020-05-19 | 南京苏美达智能技术有限公司 | Method and system for setting boundary and self-walking equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111238465B (en) * | 2018-11-28 | 2022-02-18 | 台达电子工业股份有限公司 | Map building equipment and map building method thereof |
-
2020
- 2020-11-20 CN CN202011308377.5A patent/CN112597258B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012039990A2 (en) * | 2010-09-24 | 2012-03-29 | Hitachi Data Systems Corporation | System and method for managing scalability in a distributed database |
| CN106767730A (en) * | 2016-11-22 | 2017-05-31 | 航天恒星科技有限公司 | The satellite dynamic banded zone method for splitting described with static grid |
| CN109544658A (en) * | 2017-09-21 | 2019-03-29 | 腾讯科技（深圳）有限公司 | The rendering method and device of map, storage medium, electronic device |
| CN108665508A (en) * | 2018-04-26 | 2018-10-16 | 腾讯科技（深圳）有限公司 | A kind of positioning and map constructing method, device and storage medium immediately |
| CN110292772A (en) * | 2019-07-23 | 2019-10-01 | 上海网之易璀璨网络科技有限公司 | The method and device of map is synthesized in game |
| CN111176282A (en) * | 2019-12-31 | 2020-05-19 | 南京苏美达智能技术有限公司 | Method and system for setting boundary and self-walking equipment |
Non-Patent Citations (2)
| Title |
|---|
| 分布式渲染中动态任务拆分算法的研究;孙亚萍等;《微计算机应用》;20070115(第01期);全文 * |
| 基于模糊最大熵原则的地图图像分割;郭玲，周献中;《计算机应用》;20021128;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112597258A (en) | 2021-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101235821B1 (en) | Recording medium, generation supporting device, and route guidance device | |
| EP0441359B1 (en) | Method of and apparatus for extracting image contour data | |
| US10643071B2 (en) | System and method for augmenting an image with stylized features | |
| CN112395380B (en) | Merging method, merging system and computer readable storage medium for dynamic area boundary in game map | |
| CN104778024B (en) | A kind of electronic Chart Display method and system | |
| CN105893450A (en) | Map displaying method, device and terminal equipment | |
| CN112597258B (en) | Splitting method and splitting system for dynamic area boundary in game map and computer readable storage medium | |
| US20090207170A1 (en) | Map display system, map display method for map display system, map display device, and program | |
| US20210285782A1 (en) | Method, Device and System for Processing Positioning Information | |
| CN105157711A (en) | Navigation method and system for panoramic map | |
| JP2020500319A (en) | Map making device using machine learning and image processing | |
| CN111935733B (en) | Method, device and equipment for checking base station position information and computer storage medium | |
| CN110420461B (en) | Game hierarchical navigation method based on height map | |
| CN111275817A (en) | Method and apparatus for providing feature triangulation | |
| WO2022267528A1 (en) | Multi-layer map display method and apparatus | |
| JP4640011B2 (en) | Image processing apparatus, distant view image display method, and distant view image display program | |
| CN114018239A (en) | Three-dimensional lane map construction method, device, equipment and storage medium | |
| CN112652063B (en) | Method and system for generating dynamic area boundary in game map and computer readable storage medium | |
| JP4862276B2 (en) | Map display device | |
| CN113156461B (en) | Dynamic loading method and system for 2D laser radar SLAM map | |
| US20230168106A1 (en) | Method, apparatus, and system for providing mock map data for map design validation and documentation | |
| CN103838807A (en) | In-door map server | |
| CN112800163B (en) | Map interface display method and device, computer equipment and storage medium | |
| JPS60181962A (en) | Communicating system in parallel computer | |
| CN112396698B (en) | Method, system and computer readable storage medium for demarcating map area boundary in game map |
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 |