Add to ORKGThe Tammes problem asks to find the arrangement of N points on a unit sphere that maximizes the minimum distance between any two points. This problem is presently solved only for several values of N: for N = 3, 4, 6, 12 by L. Fejes Tóth (1943); fo
A center hyperplane in the d-dimensional space minimizes the maximum of its distances from a finite ...
We present a solution to the problem of computing a point in the plane minimizing the distance to n ...
Let T denote a finite set of points in a unit isoscele right triangle (i.e., the right sides are bot...
A table is given of putative solutions to the Fejes problem: to find the maximum value of the smalle...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
AbstractThe problem of finding a point on the sphere S2 = {x̄ = (x, y, z)¦x2 + y2 + z2 = 1} which mi...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
Abstract. The “thirteen spheres problem, ” also know as the “Gregory-Newton problem” is to determine...
The product of all N(N-1)/2 possible distances for a collection of N points on the circle is maximiz...
How should we place $n$ great circles on a sphere to minimize the furthest distance between a point...
An n-town, n ∈ N, is a group of n buildings, each oc-cupying a distinct position on a 2-dimensional ...
Includes bibliographical references (pages 38-39).This thesis studies optimal distribution of N poin...
In this work we discuss mathematical programming formulations for satisfying themaximum number of di...
Special issue of selected papers from the 21st Annual Canadian Conference on Computational GeometryA...
AbstractSuppose that K ⊂ ℝd is either the unit ball, the unit sphere or the standard simplex. We sho...
A center hyperplane in the d-dimensional space minimizes the maximum of its distances from a finite ...
We present a solution to the problem of computing a point in the plane minimizing the distance to n ...
Let T denote a finite set of points in a unit isoscele right triangle (i.e., the right sides are bot...
A table is given of putative solutions to the Fejes problem: to find the maximum value of the smalle...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
AbstractThe problem of finding a point on the sphere S2 = {x̄ = (x, y, z)¦x2 + y2 + z2 = 1} which mi...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
Abstract. The “thirteen spheres problem, ” also know as the “Gregory-Newton problem” is to determine...
The product of all N(N-1)/2 possible distances for a collection of N points on the circle is maximiz...
How should we place $n$ great circles on a sphere to minimize the furthest distance between a point...
An n-town, n ∈ N, is a group of n buildings, each oc-cupying a distinct position on a 2-dimensional ...
Includes bibliographical references (pages 38-39).This thesis studies optimal distribution of N poin...
In this work we discuss mathematical programming formulations for satisfying themaximum number of di...
Special issue of selected papers from the 21st Annual Canadian Conference on Computational GeometryA...
AbstractSuppose that K ⊂ ℝd is either the unit ball, the unit sphere or the standard simplex. We sho...
A center hyperplane in the d-dimensional space minimizes the maximum of its distances from a finite ...
We present a solution to the problem of computing a point in the plane minimizing the distance to n ...
Let T denote a finite set of points in a unit isoscele right triangle (i.e., the right sides are bot...