| http://www.w3.org/ns/prov#value | - With the Gilbert method, however, there is a problem in that in order to execute processing for searching for points of closest approach that takes into consideration all lattice points in the continuous search problem, the computational load O(M1 +M2), which is dependent upon the total numbers M1, M2 of lattice points of the convex polyhedrons, is impressed whenever there is a search for a point
|
