Related papers: Spherical friezes
Discrete ordinate ($S_N$) and filtered spherical harmonics ($FP_N$) based schemes have been proven to be robust and accurate in solving the Boltzmann transport equation but they have their own strengths and weaknesses in different physical…
Given a set of N points, we have discovered an algorithm that can separate these points from one another by n-dimensional planes. Each point is chosen at random and put into a set S and planes which separate them are determined and put into…
We summarise the construction of exact axisymmetric scale-discretised wavelets on the sphere and on the ball. The wavelet transform on the ball relies on a novel 3D harmonic transform called the Fourier-Laguerre transform which combines the…
The notion of a $(k,n)$-frieze pattern was introduced by the author as a generalisation of the classical frieze patterns. In this article we describe connections between classes of $(3,n)$-frieze patterns and classes of…
Computing spherical harmonic decompositions is a ubiquitous technique that arises in a wide variety of disciplines and a large number of scientific codes. Because spherical harmonics are defined by integrals over spheres, however, one must…
When matching parts of a surface to its whole, a fundamental question arises: Which points should be included in the matching process? The issue is intensified when using isometry to measure similarity, as it requires the validation of…
For a distribution function $F$ on $\mathbb{R}^d$ and a point $q\in \mathbb{R}^d$, the \emph{spherical depth} $\SphD(q;F)$ is defined to be the probability that a point $q$ is contained inside a random closed hyper-ball obtained from a pair…
The discrete ordinates method with angular parameters is discussed in light of the recent extension of its underlying hypothesis. The analysis shows that the method, although it compares very well with the trajectory of photons model, it…
Spherical symmetry for f(R)-gravity is discussed by searching for Noether symmetries. The method consists in selecting conserved quantities in form of currents that reduce dynamics of f(R)-models compatible with symmetries. In this way we…
We introduce a technique to solve numerically the relativistic Euler's equations in scenarios with spherical symmetry using the standard Smoothed Particles Hydrodynamics method in cartesian coordinates. This implementation allow us to…
In this paper we establish a multiscale approximation for random fields on the sphere using spherical needlets --- a class of spherical wavelets. We prove that the semidiscrete needlet decomposition converges in mean and pointwise senses…
The paper presents a discrete variation of the Frechet distance between closed curves, which can be seen as an approximation of the continuous measure. A rather straightforward approach to compute the discrete Frechet distance between two…
We consider the homogenized linear feasibility problem, to find an $x$ on the unit sphere, satisfying $n$ line ar inequalities $a_i^Tx\ge 0$. To solve this problem we consider the centers of the insphere of spherical simpl ices, whose…
In this paper we develop a new geometric approach to subtractive continued fraction algorithms in high dimensions. We adapt a version of Farey summation to the geometric techniques proposed by F. Klein in 1895. More specifically we…
The Fr\'echet distance is a commonly used distance measure for curves. Computing the Fr\'echet distance between two polygonal curves of $n$ vertices takes roughly quadratic time, and conditional lower bounds suggest that approximating to…
In this paper, we introduce a moving object detection algorithm for fisheye cameras used in autonomous driving. We reformulate the three commonly used constraints in rectilinear images (epipolar, positive depth and positive height…
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existence and uniqueness result for an optimal algorithm for…
Given two simplicial complexes in R^d, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Fr\'echet distance between these curves is minimized. As a polygonal…
This work presents a novel framework for spherical mesh parameterization. An efficient angle-preserving spherical parameterization algorithm is introduced, which is based on dynamic Yamabe flow and the conformal welding method with solid…
As the spherical object can be seen everywhere, we should extract the ellipse image accurately and fit it by implicit algebraic curve in order to finish the 3D reconstruction. In this paper, we propose a new ellipse fitting algorithm which…