How should we place $n$ great circles on a sphere to minimize the furthest distance between a point on the sphere and its nearest great circle? Fejes T\'oth conjectured that the optimum is attained by placing $n$ circles evenly spaced all passing through the north and south poles. This conjecture was recently proved by Jiang and Polyanskii. We present a short simplification of Ortega-Moreno's alternate proof of this conjecture
1. Why space needs supervenience Consider a straight line on a flat surface running from point A to ...
Let P be a simple polygon with n vertices. For any two points in P, the geodesic distance between th...
An algorithm is presented to calculate the point on the surface of a sphere maximising the great-cir...
A table is given of putative solutions to the Fejes problem: to find the maximum value of the smalle...
The shortest path between two points on the surface of a sphere is an arc of a great circle (great c...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
AbstractThe problem of finding a point on the sphere S2 = {x̄ = (x, y, z)¦x2 + y2 + z2 = 1} which mi...
AbstractA finite subset of the union of the polar axis and the equator of a sphere is called a suspe...
The Tammes problem asks to find the arrangement of N points on a unit sphere that maximizes the mini...
In this paper the regularity of optimal transportation potentials defined on round spheres is invest...
The problem of equally spacing n points on a sphere is impossible in general, but there are methods ...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
[FIRST PARAGRAPH] Consider a straight line on a flat surface running from point A to C and passin...
Abstract-Given a set 9 of n points on the plane, a symmerric_furfhesr-neighbor (SFN) pair of points ...
The product of all N(N-1)/2 possible distances for a collection of N points on the circle is maximiz...
1. Why space needs supervenience Consider a straight line on a flat surface running from point A to ...
Let P be a simple polygon with n vertices. For any two points in P, the geodesic distance between th...
An algorithm is presented to calculate the point on the surface of a sphere maximising the great-cir...
A table is given of putative solutions to the Fejes problem: to find the maximum value of the smalle...
The shortest path between two points on the surface of a sphere is an arc of a great circle (great c...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
AbstractThe problem of finding a point on the sphere S2 = {x̄ = (x, y, z)¦x2 + y2 + z2 = 1} which mi...
AbstractA finite subset of the union of the polar axis and the equator of a sphere is called a suspe...
The Tammes problem asks to find the arrangement of N points on a unit sphere that maximizes the mini...
In this paper the regularity of optimal transportation potentials defined on round spheres is invest...
The problem of equally spacing n points on a sphere is impossible in general, but there are methods ...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
[FIRST PARAGRAPH] Consider a straight line on a flat surface running from point A to C and passin...
Abstract-Given a set 9 of n points on the plane, a symmerric_furfhesr-neighbor (SFN) pair of points ...
The product of all N(N-1)/2 possible distances for a collection of N points on the circle is maximiz...
1. Why space needs supervenience Consider a straight line on a flat surface running from point A to ...
Let P be a simple polygon with n vertices. For any two points in P, the geodesic distance between th...
An algorithm is presented to calculate the point on the surface of a sphere maximising the great-cir...
DOI
Add to ORKG