EP1788500B1 - Storage medium having game program stored therin, and game apparatus and game processing method therefor - Google Patents

Storage medium having game program stored therin, and game apparatus and game processing method therefor Download PDF

Info

Publication number
EP1788500B1
EP1788500B1 EP06017537.9A EP06017537A EP1788500B1 EP 1788500 B1 EP1788500 B1 EP 1788500B1 EP 06017537 A EP06017537 A EP 06017537A EP 1788500 B1 EP1788500 B1 EP 1788500B1
Authority
EP
European Patent Office
Prior art keywords
arrangement
objects
distance
game
temporary
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
Application number
EP06017537.9A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP1788500A3 (en
EP1788500A2 (en
Inventor
Yoichi Yamada
Koji Kitagawa
Shinko Takeshita
Kazuaki Morita
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nintendo Co Ltd
Original Assignee
Nintendo Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nintendo Co Ltd filed Critical Nintendo Co Ltd
Publication of EP1788500A2 publication Critical patent/EP1788500A2/en
Publication of EP1788500A3 publication Critical patent/EP1788500A3/en
Application granted granted Critical
Publication of EP1788500B1 publication Critical patent/EP1788500B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/55—Controlling game characters or game objects based on the game progress
    • A63F13/57—Simulating properties, behaviour or motion of objects in the game world, e.g. computing tyre load in a car race game
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T19/00—Manipulating 3D models or images for computer graphics
    • G06T19/20—Editing of 3D images, e.g. changing shapes or colours, aligning objects or positioning parts
    • 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/60—Methods for processing data by generating or executing the game program
    • A63F2300/64—Methods for processing data by generating or executing the game program for computing dynamical parameters of game objects, e.g. motion determination or computation of frictional forces for a virtual car
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2219/00—Indexing scheme for manipulating 3D models or images for computer graphics
    • G06T2219/20—Indexing scheme for editing of 3D models
    • G06T2219/2004—Aligning objects, relative positioning of parts

Definitions

  • the present invention relates to a storage medium having a game program stored therein and a game apparatus and game processing method therefor. More specifically, the present invention relates to a storage medium having stored therein a game program for arranging a plurality of objects in a virtual game world and a game apparatus and game processing method therefor.
  • an image closely representing a real world has been obtained by generating a game image in which a plurality of game objects are arranged in a virtual game world.
  • a plurality of game objects representing the plurality of objects of the real world have to be arranged in random positions in order to make the virtual world seem real.
  • Patent document 1 discloses an apparatus in which falling matters such as snow are represented in a virtual three dimensional space, for example.
  • a plurality of falling objects which are arranged in the three dimensional space are used to represent a plurality of real falling matters.
  • the objects are then made to move downwardly while they are rotated in a predetermined rotation direction and by a predetermined rotation angle, so that a state of falling of a falling matter arranged in a respective falling object is depicted.
  • types of falling matters used and their spatial arrangements may be made same for all falling objects so as to reduce a processing load, or spatial arrangements for the falling objects may be made different from each other.
  • the distance between a plurality of matters randomly arranged differs depending on the likelihood of the matters to overlap each other or the like.
  • simply arranging a game object representing the matter in a random manner cannot yield a natural representation therefor.
  • the likelihood of the matter to overlap with another has to be considered. For example, positions of a plurality of matters (e.g., fallen leaves around a deciduous tree) within a predetermined area of the ground in the real world are random and the matters frequently overlap each other.
  • positions of a plurality of matters e.g., floating weeds growing in crowds
  • which float within a predetermined area of a water surface are random but the matters less frequently overlap each other.
  • Each simulated bird is implemented as an independent actor that navigates according to its local perception of the dynamic environment, the laws of simulated physics that rule its motion, and a set of behaviors programmed into it by the "animator".
  • the aggregate motion of the simulated flock is the result of the dense interaction of the relatively simple behaviors of the individual simulated birds.
  • US 6 171 186 B1 in a race game comprising a preliminary round and a main race, a player can start the game without waiting for other players, the boredom of waiting time is eliminated, and skillful players can be satisfied with the game.
  • an image processing device for generating game images, and a plurality of game units each provided respectively with communications control devices connected to this image processing device, which control communications with other devices, are provided.
  • the communications control devices are connected to each other.
  • the corresponding communications control device immediately starts a preliminary round, and when this preliminary round is completed, it displays a demonstration screen during the waiting period before the start of the main race.
  • the main race determines the start position of the player according to the results from the preliminary round, suspends the game for any player who runs out of time, and when a main race is finished, it displays a demonstration screen until the start of the next main race.
  • US6525736 provides a method for moving grouped characters whose interaction can be expressed realistically.
  • an acceleration for moving a character away from anther character when the another character exists within a short distance region of the character an acceleration for matching the character with speed and direction of another character moving as so to follow a leader when the another character exists within a middle distance region, and an acceleration for moving the character away from another character when the another character exists within a long distance region are calculated, and a position of the character on a three-dimensional virtual space is calculated on the basis of summed acceleration obtained by sing the calculated accelerations for each of components x, y, z on the three-dimensional virtual.
  • an object of the present invention is to provide, when game objects are to be arranged in a virtual game world, a storage medium having stored therein a game program for arranging the game objects to positions close to the positions seen in reality, and a game apparatus and game processing method therefor.
  • the invention is defined in the independent claims. Preferred features are set out in the dependent claims.
  • a first aspect is directed to a storage medium having stored therein a game program executed in a computer (30) of a game apparatus (3) for displaying, on a display screen (2), a game image showing at least a portion of a virtual game world where a plurality of objects (OBJs) are presented.
  • the game program causes the computer to execute an arrangement condition setting step (S51), an object temporary arrangement step (S57), a distance-between-objects calculation step (S58), an object arrangement finalization step (S59), and a display control step (S66).
  • an arrangement condition setting step an area (A) for arranging the plurality of objects in the virtual game world and a minimum allowed distance (Lmin) between objects to be arranged therein are set.
  • the object temporary arrangement step a position of an object is changed for temporarily arranging the object to an arbitrary position in the area set in the virtual game world until arrangement of the object is finalized.
  • a distance (L) between the object temporarily arranged in the object temporary arrangement step and an object whose arrangement in the area is completed is calculated.
  • the object arrangement finalization step the arrangement of the temporarily arranged object is finalized when the distance calculated in the distance-between-objects calculation step is equal to or greater than the minimum allowed distance.
  • the display control step a plurality of objects whose arrangement is finalized in the object arrangement finalization step are displayed on the display screen.
  • a maximum number (Smax) for limiting a number of changes (S) performed, in the object temporary arrangement step, for a position of the object for temporarily arranging the object is further set in the arrangement condition setting step.
  • Smax a maximum number for limiting a number of changes (S) performed, in the object temporary arrangement step, for a position of the object for temporarily arranging the object
  • the arrangement condition setting step when the number of temporary arrangements performed for the object in the object temporary arrangement step reaches the maximum number ("Yes" in S63), the arrangement of the temporarily arranged object is finalized even when the distance calculated in the distance-between-objects calculation step is smaller than the minimum allowed distance.
  • an arrangement number (Nmax) for limiting a number of objects to be arranged in the area is further set in the arrangement condition setting step.
  • the game program causes the computer to repeatedly execute an arrangement process performed in the object temporary arrangement step, the distance-between-objects calculation step, and the object arrangement finalization step until a number (N) of objects whose arrangement is finalized in the object arrangement finalization step reaches the arrangement number.
  • a time limit (Tmax) for arranging the object in the area is further set in the arrangement condition setting step.
  • the game program causes the computer to repeatedly execute an arrangement process performed in the object temporary arrangement step, the distance-between-objects calculation step, and the object arrangement finalization step until the time limit is reached.
  • the game program causes the computer to further execute an object selection step (S56) .
  • an object selection step each time an arrangement of an object is finalized, a next object (D31a, D32a, ..., D3Ma, ...) to be temporarily arranged in the object temporary arrangement step is selected from an object group (D1g) having a plurality of classified classes of objects.
  • an arrangement orientation ( ⁇ ) of the selected object is arbitrarily set in the object selection step.
  • the selected object (D31c, D32c, ..., D3Mc, ... ) is temporarily arranged in accordance with the arrangement orientation.
  • a seventh aspect is directed to a game apparatus for displaying, on a display screen, a game image showing at least a portion of a virtual game world where a plurality of objects are presented.
  • the game apparatus comprises arrangement condition setting means, object temporary arrangement means, distance-between-objects calculation means, object arrangement finalization means, and display control means.
  • the arrangement condition setting means sets an area for arranging the plurality of objects in the virtual game world and a minimum allowed distance between objects to be arranged therein.
  • the object temporary arrangement means changes a position of an object for temporarily arranging the object to an arbitrary position in the area set in the virtual game world until an arrangement of the object is finalized.
  • the distance-between-objects calculation means calculates a distance between the object temporarily arranged by the object temporary arrangement means and an object whose arrangement in the area is completed.
  • the object arrangement finalization means finalizes the arrangement of the temporarily arranged object when the distance calculated by the distance-between-obj ects calculation means is equal to or greater than the minimum allowed distance.
  • the display control means displays, on the display screen, a plurality of objects whose arrangement is finalized by the object arrangement finalization means.
  • the arrangement condition setting means further sets a maximum number for limiting a number of changes performed, by the object temporary arrangement means, for a position of the object for temporarily arranging the object.
  • the object arrangement finalization means finalizes, when a number of temporary arrangements performed for the object by the object temporary arrangement means reaches the maximum number, the arrangement of the temporarily arranged object is finalized even when the distance calculated in the distance-between-objects calculation means is smaller than the minimum allowed distance.
  • the arrangement condition setting means further sets an arrangement number for limiting a number of objects to be arrange in the area.
  • the game apparatus repeatedly executes an arrangement process performed by the object temporary arrangement means, the distance-between-objects calculation means, and the object arrangement finalization means until a number of objects whose arrangements are finalized by the object arrangement finalization means reaches the arrangement number.
  • the arrangement condition setting means further sets a time limit for arranging the object in the area.
  • the game apparatus repeatedly executes an arrangement process performed by the object temporary arrangement means, the distance-between-objects calculation means, and the object arrangement finalization means until the time limit is reached.
  • the game apparatus further comprises an object selection means.
  • the object selection means selects a next object to be temporarily arranged by the object temporary arrangement means from an object group having a plurality of classified classes of objects.
  • the object selection means arbitrarily sets an arrangement orientation of the selected object.
  • the object temporary arrangement means temporarily arranges the selected object in accordance with the arrangement orientation.
  • a thirteenth aspect is directed to a game processing method for displaying, on a display screen, a game image showing at least a portion of a virtual game world where a plurality of objects are presented.
  • the game processing method comprises an arrangement condition setting step, an object temporary arrangement step, a distance-between-objects calculation step, an object arrangement finalization step, and a display control step.
  • the arrangement condition setting step an area for arranging the plurality of objects in the virtual game world and a minimum allowed distance between objects to be arranged therein are set.
  • the object temporary arrangement step a position of an object is changed for temporarily arranging the object to an arbitrary position in the area set in the virtual game world until an arrangement of the object is finalized.
  • the distance-between-obj ects calculation step a distance between the object temporarily arranged in the object temporary arrangement step and an object whose arrangement in the area is completed is calculated.
  • the object arrangement finalization step the arrangement of the temporarily arranged object is finalized when the distance calculated in the distance-between-objects calculation step is equal to or greater than the minimum allowed distance.
  • the display control step a plurality of objects whose arrangement is finalized in the object arrangement finalization step are displayed on the display screen.
  • a maximum number for limiting a number of changes performed, in the object temporary arrangement step, for a position of the object for temporarily arranging the object is further set in the arrangement condition setting step.
  • the object arrangement finalization step when a number of temporary arrangements performed for the object in the object temporary arrangement step reaches the maximum number, the arrangement of the temporarily arranged object is finalized even when the distance calculated in the distance-between-objects calculation step is smaller than the minimum allowed distance.
  • an arrangement number for limiting a number of objects to be arranged in the area is further set in the arrangement condition setting step.
  • An arrangement process performed in the object temporary arrangement step, the distance-between-objects calculation step, and the object arrangement finalization step is repeated until a number of objects whose arrangements are finalized in the object arrangement finalization step reaches the arrangement number.
  • a time limit for arranging the object in the area is further set in the arrangement condition setting step. An arrangement process performed in the object temporary arrangement step, the distance-between-objects calculation step, and the object arrangement finalization step is repeated until the time limit is reached.
  • an object selection step is further comprised.
  • the object selection step each time an arrangement of an object is finalized, a next object to be temporarily arranged in the object temporary arrangement step is selected from an object group having a plurality of classified classes of objects.
  • an arrangement orientation for the selected object is arbitrarily set in the object selection step.
  • the selected object is temporarily arranged in accordance with the arrangement orientation.
  • an object is arranged in a predetermined area in a virtual game world with reference to the distance between the object and another object; in addition, these objects are arranged to arbitrary positions in the predetermined area, whereby the objects can be randomly arranged in a well-balanced manner in the predetermined area.
  • objects can be presented in a manner appropriate to a game and the objects are arranged in the predetermined area such that they appear natural, while following a rule that each of the objects is arranged in the predetermined area.
  • the object when an object cannot be temporarily arranged to a position separated from another object by equal to or greater than a minimum allowed distance after the object has been arranged a maximum number of times, the object is arranged to a position separated from the other object by a distance smaller than the minimum allowed distance, though a probability of this occurrence is relatively low. Accordingly, a plurality of objects can be randomly and naturally arranged. Also, through adjusting the maximum number for arrangement, it is possible to adjust a proportion of objects arranged to positions separated from another object by a distance smaller than the minimum allowed distance.
  • the number of objects to be arranged in an area set in a virtual game world can be adjusted.
  • a plurality of objects can be arranged in accordance with a time limit such as a display cycle in which a virtual game world is displayed to a display device, whereby a processing error due to a delay in an arrangement operation can be prevented.
  • each object to be arranged can be selected from an object group having a plurality of classes (e.g., size being different), whereby it is possible to obtain a wide variation of objects to be arranged in a virtual game world, enabling a natural representation.
  • classes e.g., size being different
  • an orientation of an object is arbitrarily set with respect to each object to be arranged, whereby objects arranged in a virtual game world can be naturally represented.
  • FIG. 1 is an external view of the game system 1 of FIG. 1 .
  • a stationary game apparatus using the game system 1 of the present invention is used as an example.
  • the game system 1 is configured such that a CRT (Cathode Ray Tube) display (hereinafter, referred to as a "monitor") 2 having speakers 2a of a home-use television receiver or the like is connected to a stationary game apparatus (hereinafter, simply referred to as a "game apparatus") 3 via a connection code.
  • the game apparatus 3 includes a controller 6 and an optical disk 4, the controller 6 being connected to the game apparatus 3 via a connection code and the optical disk 4, as an example of an information storage medium, being exchangeably used with respect to the game apparatus 3.
  • an external memory card 5 is detachably attached to the game apparatus 3, as necessary.
  • the external memory card 5 has a backup memory or the like mounted thereon for fixedly storing save data or the like.
  • the game apparatus 3 executes a game program stored in an optical disk 4 and displays the result on the monitor 2 as a game image. Also, the game apparatus 3 can reproduce a state of a game played in the past using save data stored in the external memory card 5 and display the game image on the monitor 2. A player playing with the game apparatus 3 can enjoy the game by operating the controller 6 while watching a game image displayed on the monitor 2. When a plurality of players play a game together, they respectively operate a plurality of controllers 6 while watching a game image displayed on the monitor 2, so that they can enjoy the game.
  • the controller 6 is connected to the game apparatus 3 via the connection code.
  • the connection code is detachable to the game apparatus 3.
  • the controller 6 is a means to operate a player object appearing in a game space displayed mainly on the monitor 2 and includes a plurality of operation buttons, keys, and input sections for a stick and the like. Specifically, the controller 6 is formed with grip sections to be gripped by each hand of a player.
  • the controller 6 includes a main stick 61 and a cross key 67, a C stick 68, an A button 62, a B button 63, an X button 64, a Y button 65, and a start-pause button 69, the cross key 67 being operable by the thumb or the like of the left hand of the player and the Y button 65 being operable by the thumb or the like of the right hand of the player. Further additionally, the controller 6 includes an R button 66a and an L button 66b respectively operable by the left and right index fingers of the player. Note that although these input sections are used in accordance with a progress of a game later described, a detailed description therefor is omitted since the input sections are not directly involved with the description of the present invention.
  • the optical disk 4 stores a game program which is a group of instructions and a group of data in a format executable by a computer, especially by a CPU 30 (described later), of the game apparatus 3.
  • This game program is appropriately read into a main memory 33 for execution.
  • described is an example of executing a game program stored in the optical disk 4.
  • FIG. 2 is a functional block diagram of the game apparatus 3.
  • the game apparatus 3 includes, for example, a risk (RISC) CPU (central processing unit) 30 for executing various types of programs.
  • the CPU 30 executes a start program stored in a boot ROM not shown to, for example, initializes memories including the main memory 33, and then executes a game program stored in the optical disk 4 for performing a game process in accordance with the game program.
  • a GPU Graphics Processing Unit
  • main memory 33 main memory
  • DSP Digital Signal Processor
  • ARAM Analog RAM
  • a controller I/F (interface) 36, a video I/F 37, an external memory I/F 38, an audio I/F 39, and a disk I/F 41 are connected via a predetermined bus.
  • the controller I/F (interface) 36, the video I/F 37, the external memory I/F 38, the audio I/F 39, and the disk I/F 41 are respectively connected to the controller 6, the monitor 2, the external memory card 5, the speakers 2a, and the disk drive 40.
  • the GPU 32 performs image processing based on an instruction from the CPU 30.
  • the GPU includes a semiconductor chip for performing calculation processing necessary for displaying 3D graphics, for example.
  • the GPU 32 performs the image processing by using a memory (not shown) dedicated for image processing and a portion of a storage area of the main memory 33. Through using such memories, the GPU 32 generates game image data to be displayed on the monitor 2, and appropriately outputs the generated data to the monitor 2 via the memory controller 31 and the video I/F 37.
  • the main memory 33 is a storage area used by the CPU 30 and appropriately stores a game program, game data, or the like necessary for processing performed by the CPU 30.
  • the main memory 33 stores a game program read out from the optical disk 4 by the CPU 30, various types of data, or the like.
  • the game program, various types of data, or the like stored in the main memory 33 are executed by the CPU 30.
  • the DSP 34 processes sound data or the like generated by the CPU 30 during the execution of the game program.
  • the DSP 34 is connected to the ARAM 35 for storing the generated sound data or the like.
  • the ARAM 35 is used when the DSP 34 performs predetermined processing (for example, storage of the game program or sound data already read out).
  • the DSP 34 reads out the sound data stored in the ARAM 35 and outputs the sound data to speakers 2a included in the monitor 2 via the memory controller 31 and the audio I/F 39.
  • the memory controller 31 comprehensively controls data transfer, and is connected to the above-described various I/Fs.
  • the controller I/F 36 includes, for example, four controller I/Fs 36a, 36b, 36c, and 36d, and communicably connects the game apparatus 3 to an external device which is engageable via connectors of the controller I/Fs 36a through 36d.
  • the controller 6 is engaged with such a connecter and is connected to the game apparatus 3 via the controller I/F 36.
  • the monitor 2 is connected to the video I/F 37.
  • the external memory I/F 38 is connected to the external memory card 5 and is accessible to a backup memory or the like provided in the external memory card 5.
  • the speakers 2a built in the monitor 2 are connected, enabling sound data read out from the ARAM 35 by the DSP 34 or sound data directly outputted from the disk drive 40 to be outputted from the speakers 2a.
  • the disk drive 40 is connected to the disk I/F 41.
  • the disk drive 40 reads out data stored at a predetermined reading position of the optical disk 4 and outputs to the bus of the game apparatus 3 or the audio I/F 39.
  • the game program of the present invention may not only be supplied to the game apparatus 3 via an external storage medium such as the optical disk 4 or the like, but also be supplied via a wired or a wireless communication line. Also, the game program may be previously stored in a nonvolatile storage apparatus inside the game apparatus 3.
  • the information storage medium storing the game program is not limited to a CD-ROM, a DVD, or one of storage media of an optical disk type, and maybe a nonvolatile semiconductor memory.
  • the main memory 33 appropriately stores a game program, such as described above, necessary for the process of the CPU 30.
  • the main memory 33 includes a game program, various types of data, and the like read out from the optical disk 4 by the CPU 30.
  • FIG. 3 described is an example of data stored in the main memory 33 when a game program of the present invention is executed.
  • FIG. 3 is an outline of a memory map for illustrating the example of data stored in the main memory 33.
  • the main memory 33 has a program storage area and a data storage area, but FIG. 3 shows only the data storage area used in an operation for an object arrangement in the present invention.
  • the data storage area of the main memory 33 generally stores arrangement condition data D1, arrangement state data D2, arrangement object data D3, and the like.
  • the arrangement condition data D1 indicates conditions for arranging a plurality of objects.
  • the arrangement condition data D1 includes reference point coordinate data D1a, arrangement area data D1b, scheduled arrangement number data D1c, maximum arrangement trial number data D1d, minimum arrangement distance data D1e, arrangement time limit data D1f, object-to-be-arranged data D1g, and the like.
  • the reference point coordinate data D1a is coordinate data of a reference point when an object is arranged in a virtual game world, and the reference point is a reference position in an area where the object is arranged and is defined by three dimensional game space coordinates on a game field, for example.
  • an area where an object is allowed to be arranged is referred to as an "arrangement area" .
  • the arrangement area data D1b indicates an area used when objects are arranged in a virtual game world.
  • Example of such an arrangement area is a circle area, with a predetermined radius, whose center is the above-described reference point.
  • the scheduled arrangement number data D1c indicates the maximum number (a scheduled arrangement number Nmax) of objects to be arranged in the arrangement area.
  • the maximum arrangement trial number data D1d indicates, when an object is to be arranged in the arrangement area, a maximum number (a maximum arrangement trial number Smax) of times a position of the object is allowed to be changed until arrangement conditions are met.
  • the minimum arrangement distance data D1e indicates a minimum distance (a minimum arrangement distance Lmin) between arranged objects.
  • the arrangement time limit data D1f indicates a time limit (an arrangement time limit Tmax; an example thereof is a time period of one frame) during which an operation of arranging objects is continued.
  • the object-to-be-arranged data D1g indicates various types of objects to be selected for arrangement.
  • the arrangement state data D2 includes arrangement number data D2a, arrangement trial number data D2b, elapsed arrangement time period data D2c, and the like.
  • the arrangement state data D2 indicates an arrangement state appropriately updated each time an arrangement of an object occurs.
  • the arrangement number data D2a indicates the number of objects (an arrangement number N) whose arrangements are completed when a plurality of objects are arranged.
  • the arrangement trial number data D2b indicates the number of position changes (the arrangement trial number S) made in arranging a selected object in the arrangement area.
  • the elapsed arrangement time period data D2c indicates a time period elapsed (an elapsed arrangement time period T) in arranging objects.
  • the arrangement object data D3 indicates an object arranged in a virtual game world, and, for arranged objects, first object data D31, second object data D32, and so on until M-th object data D3M are respectively set.
  • the object data D31 through D3M respectively includes object class data D31a through D3Ma, arrangement coordinate data D31b through D3Mb, arrangement orientation data D31c through D3Mc, and the like.
  • Objects are classified into a class based on a type, a size, or the like, and the object class data D31a through D3Ma each indicates a class of an object to be arranged.
  • the arrangement coordinate data D31b through D3Mb each indicates a position of an object arranged in the virtual game world and is defined by three dimensional game space coordinates, on a game field, of the center of the object, for example.
  • the arrangement orientation data D31c through D3Mc each indicates an orientation of an object arranged in the virtual game world, and is defined by an angle of the arranged object with respect to a predetermined reference direction or by vector data.
  • FIG. 4 is a flowchart showing a game process executed by the game apparatus 3 when an object is arranged.
  • FIG. 5 is a diagram for illustrating a center position C and an arrangement orientation ⁇ of an object OBJ to be arranged.
  • FIG. 6 is a diagram for illustrating a reference point P and an arrangement area A.
  • FIG. 7 is a diagram showing a state of a first object OBJ1 being arranged on the reference point P.
  • FIG. 8 is a diagram showing a distance L12, between the first object OBJ1 and a second object OBJ2, determined when the second object OBJ2 is arranged.
  • FIG. 5 is a diagram for illustrating a center position C and an arrangement orientation ⁇ of an object OBJ to be arranged.
  • FIG. 6 is a diagram for illustrating a reference point P and an arrangement area A.
  • FIG. 7 is a diagram showing a state of a first object OBJ1 being arranged on the reference point P.
  • FIG. 8
  • FIG. 9 is a diagram showing distances L13 and L23 determined when a third object OBJ3 is arranged, the distance L13 being a distance between the first object OBJ1 and the third object OBJ3 and the distance L23 being a distance between the second object OBJ2 and the third object OBJ3.
  • FIG. 10 is a diagram showing an example of a state in which arranging a plurality of objects OBJs is completed through the process of the flowchart of FIG. 4 . Note that, in the flowchart shown in FIG. 4 , a game process for an object arrangement is described, and a detailed description for another game process not directly relating to the present invention is omitted. In FIG. 4 , each step executed by the CPU 30 is referred to with "S".
  • the CPU 30 of the game apparatus 3 executes a start program stored in the boot ROM not shown, and units such as the main memory 33 or the like are initialized. Then, a game program stored in the optical disk 4 is read into the main memory 33, and the CPU 30 executes the game program and displays a game image on the monitor 2, and thereby starting a game.
  • the CPU 30 sets arrangement conditions when a plurality of objects OBJs are to be arranged to predetermined positions in the virtual game world (step 51). For example, the CPU 30 sets, to the arrangement condition data D1, arrangement conditions such as positions (reference points Ps) in the virtual game world where a plurality of objects are to be arranged, an area (arrangement area A) used for arrangement, a scheduled arrangement number Nmax, a maximum arrangement trial number Smax, a minimum arrangement distance Lmin, and an arrangement time limit Tmax. Typically, in accordance with, e.g., the positions of objects to be in the virtual game world, the CPU 30 acquires previously set arrangement conditions for setting the arrangement condition data D1.
  • arrangement condition data D1 arrangement conditions such as positions (reference points Ps) in the virtual game world where a plurality of objects are to be arranged, an area (arrangement area A) used for arrangement, a scheduled arrangement number Nmax, a maximum arrangement trial number Smax, a minimum arrangement distance Lmin, and an arrangement time limit Tmax.
  • the CPU 30 sets a reference point P and an arrangement area A in the virtual game world (e. g. , on a game field) (step 53), and the process proceeds to the next step.
  • a reference point P is set on the game field, and then a circle, with a predetermined radius, whose center is the reference point P is set as an arrangement area A, as shown in FIG. 6 , for example.
  • a state (position and orientation) of an object OBJ to be arranged in the virtual game world is determined by coordinates, in the virtual game world, of a center position C and an arrangement angle ⁇ , the center position C (e.g., a center of gravity of the object OBJ) being a reference position for the object OBJ and the arrangement angle ⁇ being an angle for the object OBJ with respect to a predetermined reference direction.
  • the center position C e.g., a center of gravity of the object OBJ
  • the arrangement angle ⁇ being an angle for the object OBJ with respect to a predetermined reference direction.
  • step 54 the CPU 30 selects an object class from among selectable classes (e.g., a fallen leaf) indicated in the object-to-be-arranged data D1g, and arranges an object OBJ belonging to the selected object class such that the center position C thereof corresponds to the reference point P, as shown in FIG. 7 . Then, the CPU 30 determines an arrangement angle ⁇ of the object OBJ in, for example, a random manner.
  • the object arranged in step 54 is referred to as a first object OBJ1 having a center position C1 been set.
  • the CPU 30 temporarily arranges the object OBJ selected in step 56 to an arbitrary position in the arrangement area A (step 57). Then, the CPU 30 determines whether or not the distance between the temporarily arranged object OBJ and an object OBJ whose arrangement is completed is within a predetermined range (step 58) . Specifically, the CPU 30 calculates a distance L between the center position C of the temporarily arranged object OBJ and a center position C of the object OBJ whose arrangement is completed and determines whether or not the distance L is equal to or greater than the minimum arrangement distance Lmin.
  • a second object OBJ2 is temporarily arranged in step 57 as shown in FIG. 8 .
  • a distance L12 between the center position C1 of the first object OBJ1 and a center position C2 of the second object OBJ2 is calculated and whether or not the distance L12 is equal to or greater than the minimum arrangement distance Lmin is determined. Also, suppose a third object OBJ3 is temporarily arranged in step 57 after the first and second objects OBJ1 and OBJ2 are arranged, as shown in FIG. 9 .
  • a distance L13 between the center position C1 of the first object OBJ1 and a center position C3 of the third object OBJ3 and a distance L23 between the center position C2 of the second object OBJ2 and the center position C3 of the third object OBJ3 are calculated, and whether or not the distances L13 and L23 are equal to or greater than the minimum arrangement distance Lmin is determined.
  • the CPU 30 proceeds with the process to next step 59.
  • a distance L between a temporarily arranged object and an object OBJ whose arrangement is completed is smaller than the minimum arrangement distance Lmin, the CPU 30 proceeds with the process to next step 63.
  • step 59 the CPU 30 determines that arrangement of the object OBJ temporarily arranged in the virtual game world in step 57 is to be finalized and writes the arrangement object data D3 indicating the arrangement of the object. Through step 59, arrangement of one object OBJ is finalized.
  • the CPU 30 updates the arrangement state data D2 by adding one to the arrangement number N (step 60) and determines whether or not the arrangement number N having been updated has reached a scheduled arrangement number Nmax (step 61). When the arrangement number N has not reached the scheduled arrangement number Nmax, the CPU 30 proceeds with the process to next step 62. On the other hand, when the arrangement number N has reached the scheduled arrangement number Nmax, the CPU 30 determines that arrangement of the object is performed the scheduled number of times and proceeds with the process to step 66.
  • step 62 the CPU 30 determines whether or not an elapsed arrangement time period T is within an arrangement time limit Tmax. When the elapsed arrangement time period T is within the arrangement time limit Tmax, the CPU 30 returns the process back to step 55 to repeat the process. On the other hand, when the elapsed arrangement time period T has reached the arrangement time limit Tmax, the CPU 30 determines that a time limit allowed for arranging objects is passed and proceeds with the process to step 66.
  • step 58 When it is determined in step 58 that the distance between a position of the temporarily arranged object and an object whose arrangement is completed is smaller than the minimum arrangement distance Lmin, the CPU 30 determines whether or not the arrangement trial number S has reached a maximum arrangement trial number Smax (step 63). When the arrangement trial number S has reached the maximum arrangement trial number Smax, the CPU 30 proceeds with the process to step 59. On the other hand, when the arrangement trial number S has not reached the maximum arrangement trial number Smax, the CPU 30 proceeds with the process to next step 64.
  • step 64 the CPU 30 determines whether or not the elapsed arrangement time period T is within the arrangement time limit Tmax.
  • the CPU 30 updates the arrangement state data D2 by adding one to the arrangement trial number S (step 65) and returns the process back to step 57 to repeat the process.
  • the CPU 30 determines that the time limit allowed for arranging objects is passed and proceeds with the process to step 66.
  • step 66 the CPU 30 displays, on the monitor 2, a plurality of objects OBJs whose arrangement is finalized in step 59 and whose data have been written into the arrangement object data D3, and the process of the flowchart is ended.
  • step 63 when it is determined as "Yes” in step 63, temporary arrangement for the object has been performed up to the maximum arrangement trial number Smax and yet the distance between the temporarily arranged object OBJ and an object whose arrangement is completed is smaller than the minimum arrangement distance Lmin (namely, objects OBJs are closer in distance than the minimum allowed distance) .
  • step 59 is executed subsequent to the determination of "Yes” in step 63, arrangement of the temporarily arranged object OBJ is finalized such that the distance between arranged objects is smaller than the minimum arrangement distance Lmin.
  • a plurality of objects OBJs are arranged in the arrangement area A, as shown in FIG. 10 .
  • random arrangement of an object OBJ is repeated within the scheduled arrangement number Nmax
  • the random arrangement of objects is repeated within the arrangement time limit Tmax
  • objects OBJs are randomly arranged with the distances therebetween being basically equal to or greater than the minimum arrangement distance Lmin.
  • objects OBJs in some cases are arranged such that the distances therebetween are smaller than the minimum arrangement distance Lmin, as described above; however, a probability of such an occurrence is low. Accordingly, while a space between arranged objects OBJs is controlled to some extent, the set number of objects OBJs can be arranged to random positions.
  • the minimum arrangement distance Lmin is set to a large value when a space between objects OBJs is desired to be large, and, the minimum arrangement distance Lmin is set to a small value when a space between objects OBJs is desired to be small so that overlapping each other is allowed.
  • the maximum arrangement trial number data D1d the maximum arrangement trial number Smax is set to a small value when it is desired to increase the number of objects OBJs whose distance to another object is smaller than the minimum arrangement distance Lmin, and the maximum arrangement trial number Smax is set to a large value when it is desired to decrease the number of objects OBJs whose distance to another object is smaller than the minimum arrangement distance Lmin.
  • the scheduled arrangement number Nmax is set to a large value when a large number of objects OBJs are desired to be arranged in the arrangement area A, and the scheduled arrangement number Nmax is set to a small value when a small number of objects OBJs are desired to be arranged in the arrangement area A.
  • the objects are arranged in a well-balanced, random manner, whereby natural representation of the plurality of objects can be possible.
  • a plurality of matters e.g., floating weeds growing in crowds
  • a value of the minimum arrangement distance Lmin is set such that overlapping of the objects OBJs is not allowed
  • the maximum arrangement trial number Smax is set to a large value.
  • a value of the minimum arrangement distance Lmin is set such that overlapping the objects OBJs is allowed, and the maximum arrangement trial number Smax is set to a small value.
  • a plurality of objects are randomly arranged in a predetermined area whenever the objects are rearranged, whereby, while following a rule that each of the objects is arranged in the predetermined area, an image suitable for a game can be generated such that the objects arranged in the predetermined area appear natural.
  • an arrangement area A is set on a two dimensional surface such as the ground or a water surface and a plurality of objects OBJs are arranged therein, but it is not limited thereto, and a three dimensional space may be used.
  • a three dimensional space may be used.
  • an arrangement space is set in a virtual three dimensional space and objects OBJs are arranged therein in a similar manner as described above, the present invention is similarly applicable.
  • an arrangement area A which is a circle area whose center is a reference point P
  • an arrangement area of another shape may be used.
  • an arrangement area A may be an area whose center is a reference point P and shape is a rectangle, polygon, ellipse, or a frame having an empty enclosed area. These shapes of the arrangement area A may be appropriately set in accordance with a state of a virtual game world to which arrangement is desired.
  • the storage medium having a game program stored therein, and the game apparatus and game processing method therefor according to the present invention can be used to arrange a plurality of objects in a virtual game world such that the objects appear natural, and are useful in representing various objects or the like appearing in a game.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Multimedia (AREA)
  • Architecture (AREA)
  • Computer Graphics (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Processing Or Creating Images (AREA)
EP06017537.9A 2005-10-26 2006-08-23 Storage medium having game program stored therin, and game apparatus and game processing method therefor Active EP1788500B1 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2005311024A JP5025940B2 (ja) 2005-10-26 2005-10-26 情報処理プログラム、情報処理装置、情報処理システムおよび情報処理方法

Publications (3)

Publication Number Publication Date
EP1788500A2 EP1788500A2 (en) 2007-05-23
EP1788500A3 EP1788500A3 (en) 2014-12-31
EP1788500B1 true EP1788500B1 (en) 2019-05-01

Family

ID=37983864

Family Applications (1)

Application Number Title Priority Date Filing Date
EP06017537.9A Active EP1788500B1 (en) 2005-10-26 2006-08-23 Storage medium having game program stored therin, and game apparatus and game processing method therefor

Country Status (3)

Country Link
US (1) US7576739B2 (ja)
EP (1) EP1788500B1 (ja)
JP (1) JP5025940B2 (ja)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2451996B (en) * 2006-05-09 2011-11-30 Disney Entpr Inc Interactive animation
JP6121647B2 (ja) 2011-11-11 2017-04-26 ソニー株式会社 情報処理装置、情報処理方法およびプログラム
CN109146898B (zh) 2018-09-07 2020-07-24 百度在线网络技术（北京）有限公司 一种仿真数据量增强方法、装置以及终端
CN109215136B (zh) * 2018-09-07 2020-03-20 百度在线网络技术（北京）有限公司 一种真实数据增强方法、装置以及终端

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0367225U (ja) * 1989-10-24 1991-07-01
US5848926A (en) * 1995-06-05 1998-12-15 Jardetzky; Alexander M. Removably adherable construction elements
JP3519216B2 (ja) 1996-07-16 2004-04-12 株式会社ナムコ ３次元シミュレータ装置及び情報記憶媒体
JP3747449B2 (ja) * 1996-07-25 2006-02-22 株式会社セガ ゲームの処理方法、ゲーム装置、画像処理装置及び画像処理方法並びに記録媒体
JP3163496B2 (ja) * 1999-08-20 2001-05-08 株式会社光栄 集団キャラクタ移動方法、記録媒体及びゲーム装置
JP3707770B2 (ja) * 2000-02-14 2005-10-19 松下電器産業株式会社 地図情報修正装置および地図情報修正方法
JP2001351125A (ja) * 2000-03-30 2001-12-21 Sega Corp 画像表示方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
US7576739B2 (en) 2009-08-18
EP1788500A3 (en) 2014-12-31
JP5025940B2 (ja) 2012-09-12
EP1788500A2 (en) 2007-05-23
US20070091083A1 (en) 2007-04-26
JP2007117260A (ja) 2007-05-17

Similar Documents

Publication Publication Date Title
EP0844587B1 (en) Image processor, image processing method, game machine and recording medium
KR100584706B1 (ko) 화상 처리 시스템 및 화상 처리 방법
US6676518B1 (en) Image generating device, an image generating method, a readable storage medium storing an image generating program and a video game system
US6256040B1 (en) Three-dimensional game machine and information storage medium
US7084876B1 (en) Method for presenting a virtual reality environment for an interaction
US11704868B2 (en) Spatial partitioning for graphics rendering
US20090186693A1 (en) Interactive video game display method, apparatus, and/or system for object interaction
Linowes Unity 2020 virtual reality projects: Learn VR development by building immersive applications and games with Unity 2019.4 and later versions
JP2001273517A (ja) ゲームシステム及びゲーム用プログラムを記録したコンピュータ読み取り可能な記録媒体
US6756984B1 (en) Object displaying method, a recording medium and game apparatus
EP1788500B1 (en) Storage medium having game program stored therin, and game apparatus and game processing method therefor
US6646642B1 (en) Method of creating image frames, storage medium and apparatus for executing program
US6579183B1 (en) Video game system, a video game display method and a readable storage medium storing a video game display program
JP5237312B2 (ja) ゲームプログラム、ゲーム装置、ゲーム制御方法
JP2009129167A (ja) プログラム、情報記憶媒体、及び画像生成システム
Vince Handbook of computer animation
JP2000268193A (ja) 画像作成装置、画像作成方法、画像作成プログラムが記録された可読記録媒体およびビデオゲーム装置
JP2005007069A (ja) ゲーム装置およびゲームプログラム
JP2001276414A (ja) ゲーム装置、および、情報記憶媒体
JP3943097B2 (ja) 草オブジェクトの自動配置機能を有するゲームソフトウエア及びゲーム装置
JP3494974B2 (ja) 仮想物体表示プログラムを記録したコンピュータ読み取り可能な記録媒体、ならびに、表示制御装置および方法
JP4688405B2 (ja) プログラム、情報記憶媒体及びゲーム装置
JP2006289118A (ja) 画像処理方法及び画像処理装置並びに記録媒体
JP4782631B2 (ja) プログラム、情報記憶媒体及び画像生成システム
WO2020261341A1 (ja) グラフィックゲームプログラム

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK YU

RIC1 Information provided on ipc code assigned before grant

Ipc: G06F 19/00 20060101AFI20070419BHEP

Ipc: A63F 13/10 20060101ALI20070613BHEP

RTI1 Title (correction)

Free format text: STORAGE MEDIUM HAVING GAME PROGRAM STORED THERIN, AND GAME APPARATUS AND GAME PROCESSING METHOD THEREFOR

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NINTENDO CO., LTD.

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

17P Request for examination filed

Effective date: 20150513

RBV Designated contracting states (corrected)

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AKX Designation fees paid

Designated state(s): DE FR GB

AXX Extension fees paid

Extension state: MK

Extension state: AL

Extension state: RS

Extension state: BA

Extension state: HR

17Q First examination report despatched

Effective date: 20171206

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602006057856

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: G06F0019000000

Ipc: A63F0013570000

RIC1 Information provided on ipc code assigned before grant

Ipc: A63F 13/57 20140101AFI20180508BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20181123

RIC1 Information provided on ipc code assigned before grant

Ipc: A63F 13/57 20140101AFI20180508BHEP

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602006057856

Country of ref document: DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602006057856

Country of ref document: DE

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20200204

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230428

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230629

Year of fee payment: 18

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20230703

Year of fee payment: 18

Ref country code: DE

Payment date: 20230627

Year of fee payment: 18