×

Game apparatus, game method, and program

  • US 7,601,055 B2
  • Filed: 03/29/2004
  • Issued: 10/13/2009
  • Est. Priority Date: 03/31/2003
  • Status: Expired due to Fees
First Claim
Patent Images

1. A game apparatus for moving a moving object on a road in a virtual world, wherein line segments extend between the edges of the road and each of the line segments is divided into line segment regions, and for each neighboring pair of the line segments, the end points of the regions of the first line segment of the pair and the end points of the regions of the second line segment of the pair are connected sequentially from both the edges of the pair and the quadrilateral areas or triangular areas are formed, said game apparatus comprising:

  • an input reception unit which receives an operational input from a player;

    a storage unit which stores a position and a velocity of the moving object and passage numbers, each of which represents a number of times the moving object passed through each of the regions;

    a calculation unit which checks in which quadrilateral area or triangular area the moving object is included, estimates a passage number representing a number of times the moving object passed at the stored position of the moving object from the stored passage numbers of the one or two regions of the area including the moving object, and calculates an influence on the moving object based on the received operational input from the player, the stored position of the moving object, and the estimated passage number; and

    an update unit which updates the stored position and the stored velocity of the moving object in accordance with the calculated influence, and increments the passage number that was stored of the region which is intersected by a line connecting the previous position and the updated position of the moving object, andwherein, said calculation unit;

    (a) estimates the passage number for each triangular area having one line segment region for which passage number L has been stored, as L; and

    (b) divides each quadrilateral area bounded by two line segment regions for one of which passage number M has been stored and for the other of which passage number N (where M is less than N) has been stored so that N−

    M+1 number of small quadrilateral areas are arrayed in a row and one end of the row is defined by the line segment region with the stored passage number M and other end of the row is defined by the line segment region with the stored passage number N, and estimates respective passage numbers of the arrayed small quadrilateral areas, ranging from the stored passage number M to the stored passage number N, incrementing by 1, respectively in order from one small quadrilateral area at said one end of the row to another small quadrilateral area at the other end of the row.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×