Related papers: Efficient Spherical Designs with Good Geometric Pr…
A finite set $X \seq \RR^n$ with a weight function $w : X \longrightarrow \RR_{>0}$ is called \emph{Euclidean $t$-design} in $\RR^n$ (supported by $p$ concentric spheres) if the following condition holds: \[ \sum_{i=1}^p…
Geometric integration theory can be employed when numerically solving ODEs or PDEs with constraints. In this paper, we present several one-step algorithms of various orders for ODEs on a collection of spheres. To demonstrate the versatility…
Semantic segmentation for spherical data is a challenging problem in machine learning since conventional planar approaches require projecting the spherical image to the Euclidean plane. Representing the signal on a fundamentally different…
Optimal packing of spheres in $\mathbb R^d$ is studied by optimization of the energy $E$ (effective conductivity) of composites with ideally conducting spherical inclusions. It is demonstrated that the minimum of $E$ over locations of…
This survey discusses recent developments in the context of spherical designs and minimal energy point configurations on spheres. The recent solution of the long standing problem of the existence of spherical $t$-designs on $\mathbb{S}^d$…
We have studied the packing of congruent disks on a spherical cap, for caps of different size and number of disks, $N$. This problem has been considered before only in the limit cases of circle packing inside a circle and on a sphere…
Let $\mathcal{T}$ be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles,…
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packings are in fact optimal. When applied to the previously…
A Euclidean $t$-design, as introduced by Neumaier and Seidel (1988), is a finite set ${\cal X} \subset \mathbb{R}^n$ with a weight function $w: {\cal X} \rightarrow \mathbb{R}^+$ for which $$\sum_{r \in R} W_r \overline{f}_{S_{r}} =…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
The problem of packing equal spheres in a spherical container is a classic global optimization problem, which has attracted enormous studies in academia and found various applications in industry. This problem is computationally…
Spherical coverings on the S2 sphere and their algebraic numbers are given for the putatively optimal global solutions for some n-congruent spherical caps with minimal radius to completely cover the S2 sphere. A few locally optimal…
We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given…
We have identified some necessary conditions for the existence of rigid sphere designs. In particular, we have successfully resolved the conjecture proposed by [Ban87]; Given fixed positive integers t and d, we show that there exist only…
Spherical or omni-directional images offer an immersive visual format appealing to a wide range of computer vision applications. However, geometric properties of spherical images pose a major challenge for models and metrics designed for…
This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the {\it generalized corner-vector method}. First we establish a uniform upper bound for the degree…
We present a computational scheme that derives a global polynomial level set parametrisation for smooth closed surfaces from a regular surface-point set and prove its uniqueness. This enables us to approximate a broad class of smooth…
T-SNE is a well-known approach to embedding high-dimensional data and has been widely used in data visualization. The basic assumption of t-SNE is that the data are non-constrained in the Euclidean space and the local proximity can be…
Delsarte-Goethals-Seidel showed that if $X$ is a spherical $t$-design with degree $s$ satisfying $t\geq 2s-2$, $X$ carries the structure of an association scheme. Also Bannai-Bannai showed that the same conclusion holds if $X$ is an…
We develop an efficient numerical scheme for the 3D mean-field spherical dynamo equation. The scheme is based on a semi-implicit discretization in time and a spectral method in space based on the divergence-free spherical harmonic…