Related papers: Geometric approximation of the sphere by triangula…
We discuss methods to construct a polynomial parametrization of some interesting knotted surfaces (knotted spheres, knotted tori and knotted planes) and provide examples.
A geometric inequality among three triangles, originating in circle packing problems, is introduced. In order to prove it, we reduce the original formulation to the nonnegativity of a particular polynomial in four real indeterminates.…
Approximation using Fourier features is a popular technique for scaling kernel methods to large-scale problems, with myriad applications in machine learning and statistics. This method replaces the integral representation of a…
We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.
This work introduces and analyzes B-spline approximation spaces defined on general geometric domains obtained through a mapping from a parameter domain. These spaces are constructed as sparse-grid tensor products of univariate spaces in the…
For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special…
The geometric approach presented in this paper concerns the degree of polarization (DoP) of a random 3D statistical electromagnetic field. We use that a 3*3 coherency matrix can always be decomposed into an incoherent superposition of three…
This article is concerned with the problem of placing seven or eight points on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$ so that the surface area of the convex hull of the points is maximized. In each case, the solution is given for…
Blending schemes based on circles provide smooth `fair' interpolations between series of points. Here we demonstrate a simple, robust set of algorithms for performing circle blends for a range of cases. An arbitrary level of G-continuity…
Approximation by polynomials on a triangle is studied in the Sobolev space $W_2^r$ that consists of functions whose derivatives of up to $r$-th order have bounded $L^2$ norm. The first part aims at understanding the orthogonal structure in…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
In the present paper we study approximation of discs by octagons on the pixel plane. To decide which octagon approximates better the given disc we use Jaccard's distance. The table of Jaccard's distances (calculated by a software created…
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…
We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…
This paper demonstrates that the space of piecewise smooth functions can be well approximated by the space of functions defined by a set of simple (non-linear) operations on smooth uniform splines. The examples include bivariate functions…
We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…
In this paper, Hermite interpolation by parametric spline surfaces on triangulations is considered. The splines interpolate points, the corresponding tangent planes and normal curvature forms at domain vertices and approximate tangent…
The spherical grasshopper problem is a geometric optimization problem that arises in the context of Bell inequalities and can be interpreted as identifying the best local hidden variable approximation to quantum singlet correlations for…
This article treats the question of fundamentality of the translates of a polyharmonic spline kernel (also known as a surface spline) in the space of continuous functions on a compact set $\Omega\subset \RR^d$ when the translates are…
In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…