PROGRAM, RECORDING MEDIUM, INFORMATION PROCESSING METHOD, AND DEVICE

PROBLEM TO BE SOLVED: To easily calculate a minimum convex polygon or a minimum convex polyhedron including arbitrary points. SOLUTION: A first calculating part acquires a portion of convex closure vertex candidates to prepare initial convex closure in a step S51, and a second calculating part registers points present beyond the boundary of the initial convex closure in each boundary area in a step S52. A third calculating part decides whether or not the boundary area where the points are registered is present in a step S53. When it is decided that the boundary area where the points are registered is present, a fourth calculating part acquires points being the vertexes of the convex closure from the boundary area in a step S54, and a fifth calculating part adds the vertexes to the convex closure in a step S55, and re-registers the affected points of the boundary, and returns the processing to the step S53, and the following processing is repeated until any boundary area where the points are registered is not present any more. This invention can be applied to computer graphics. COPYRIGHT: (C)2005,JPO&NCIPI