Search

In this paper, we study a geometrical inequality conjecture which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is 4 + 4 2 , the best configuration is a regular square inscribed to the equator, and for any five points, the largest sum is 5 5 + 2 5 and the best configuration is the regular pentagon inscribed to the equator. We prove that the conjectured configurations are local optimal, and construct a rectangular neighborhood of the local maximum point in the related feasible set, whose size is explicitly determined, and prove that (1): the objective function is bounded by a quadratic polynomial which takes the local maximum point as the unique critical point in the neighborhood, and (2): the remaining part of the feasible set can be partitioned into a finite union of a large number of very small cubes so that on each small cube, the conjecture can be verified by estimating the objective function with exact numerical computation. We also explain the method for constructing the neighborhoods and upper-bound quadratic polynomials in detail and describe the computation process outside the constructed neighborhoods briefly. [ABSTRACT FROM AUTHOR]

In this paper we present a method of applying the GPGPU technology to compute the approximate optimal solution to the Heilbronn problem for nine points in the unit square, namely, points $$P_1,P_2,\ldots ,P_9$$ in $$[0,1]\times [0,1]$$ so that the minimal area of triangles $$P_iP_jP_k\,(1\le i