Related papers: On the Reduction of the Spherical Point-in-Polygon…
Considering two-body integral equations we show how they can be dimensionally reduced by integrating exactly over the azimuthal angle of the intermediate momentum. Numerical solution of the resulting equation is feasible without employing a…
Let $S$ be a set of $2n$ points on a circle such that for each point $p \in S$ also its antipodal (mirrored with respect to the circle center) point $p'$ belongs to $S$. A polygon $P$ of size $n$ is called \emph{antipodal} if it consists of…
Spline functions are smooth piecewise polynomials widely used for interpolation and smoothing, and nonnegative spline smoothing is also studied for nonnegative data. Previous research used sufficient conditions for the nonnegativity of…
Abstract. The Set Intersection Problem (SIP) is the problem of finding a point in the intersection of convex sets. This problem is typically solved by the method of alternating projections. To accelerate the convergence, the idea of using…
For scattering problems of time-harmonic waves, the boundary integral equation (BIE) methods are highly competitive, since they are formulated on lower-dimension boundaries or interfaces, and can automatically satisfy outgoing radiation…
Modern medical image segmentation methods primarily use discrete representations in the form of rasterized masks to learn features and generate predictions. Although effective, this paradigm is spatially inflexible, scales poorly to…
A new gridding technique for the solution of partial differential equations in cubical geometry is presented. The method is based on volume penalization, allowing for the imposition of a cubical geometry inside of its circumscribing sphere.…
The manuscript presents a theoretical proof in conglomeration with new definitions on Inaccessibility and Inside for a point S related to a simple or self intersecting polygon P. The proposed analytical solution depicts a novel way of…
Smoothed particle hydrodynamics (SPH) discretization techniques are generalized to develop a method, smoothed particle interpolation (SPI), for solving initial value problems of systems of non-hydrodynamical nature. Under this approach, SPH…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
In this work, we propose a SPH interpolating Kernel reformulation suitable also to treat free edge boundaries in the computational domain. Application to both inviscid and viscous stationary low compressibility accretion disc models in…
We consider embedded ring-type surfaces (that is, compact, connected, orientable surfaces with two boundary components and Euler-Poincar\'{e} characteristic zero) in ${\bold R}^3$ of constant mean curvature which meet planes $\Pi_1$ and…
We analyze the well posedness of certain field-only boundary integral equations (BIE) for frequency domain electromagnetic scattering from perfectly conducting spheres. Starting from the observations that (1) the three components of the…
Satellites mapping the spatial variations of the gravitational or magnetic fields of the Earth or other planets ideally fly on polar orbits, uniformly covering the entire globe. Thus, potential fields on the sphere are usually expressed in…
This paper introduces a novel boundary integral equation (BIE) method for the numerical solution of problems of planewave scattering by periodic line arrays of two-dimensional penetrable obstacles. Our approach is built upon a direct BIE…
The present paper aims to solve some problems proposed by Lassak about the reduced spherical polygons. The main result is to show that the regular spherical n-gon has the minimal perimeter among all reduced spherical polygons of fixed…
Depth estimation is a fundamental problem in light field processing. Epipolar-plane image (EPI)-based methods often encounter challenges such as low accuracy in slope computation due to discretization errors and limited angular resolution.…
Motivated by the $k$-center problem in location analysis, we consider the \emph{polygon burning} (PB) problem: Given a polygonal domain $P$ with $h$ holes and $n$ vertices, find a set $S$ of $k$ vertices of $P$ that minimizes the maximum…
For every $p,q\geq 1$, we construct minimal embeddings of $\mathbb{S}^p \times \mathbb{S}^q \times \mathbb{S}^1$ in $\mathbb{S}^{p + q + 2}$ by doubling the links of free-boundary minimal cones in $\mathbb{R}^{p+q+3}$ with bi-orthogonal…
We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…