Method for searching a triangle corresponding to a location of an object moving on trigonometric grids
First Claim
1. A method for searching a triangle on which an object lies while the object moves on a trigonometric grid, wherein the triangle is one of the constituents of the trigonometric grid approximately representing a terrain, the method comprising the steps of:
- (a) retrieving information on a present triangle, the present triangle referring to a triangle on which the object lies at a present time;
(b) predicting a next location after a predetermined time interval from the present time;
(c) finding a nearest vertex, the nearest vertex referring to a vertex of the present triangle being nearest to a present location of the object;
(d) selecting candidate triangles sharing the nearest vertex; and
(e) deciding whether or not the next location lies on said each candidate triangle.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for searching a triangle on which an object lies while the object moves on a trigonometric grid, wherein the triangle is one of the constituents of the trigonometric grid approximately representing a terrain, is provided. For the search, first, the inventive method retrieves information on a present triangle and predicts a next location after a predetermined time interval from the present time. Then, a nearest vertex is found, the nearest vertex referring to a vertex of the present triangle being nearest to a present location of the object and candidate triangles sharing the nearest vertex are selected. Finally, it is determined whether or not the next location lies on each candidate triangle.
-
Citations
5 Claims
-
1. A method for searching a triangle on which an object lies while the object moves on a trigonometric grid, wherein the triangle is one of the constituents of the trigonometric grid approximately representing a terrain, the method comprising the steps of:
-
(a) retrieving information on a present triangle, the present triangle referring to a triangle on which the object lies at a present time; (b) predicting a next location after a predetermined time interval from the present time; (c) finding a nearest vertex, the nearest vertex referring to a vertex of the present triangle being nearest to a present location of the object; (d) selecting candidate triangles sharing the nearest vertex; and (e) deciding whether or not the next location lies on said each candidate triangle. - View Dependent Claims (2, 3, 4, 5)
-
Specification