Related papers: Flat Map of a Sphere via Stress Minimization
We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…
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 paper presents a solution for efficiently and accurately solving separable least squares problems with multiple datasets. These problems involve determining linear parameters that are specific to each dataset while ensuring that the…
Given a smooth curve $\gamma$ in some $m$-dimensional surface $M$ in $\mathbb{R}^{m+1}$, we study existence and uniqueness of a flat surface $H$ having the same field of normal vectors as $M$ along $\gamma$, which we call a flat…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
The convex feasibility problem (CFP) is at the core of the modeling of many problems in various areas of science. Subgradient projection methods are important tools for solving the CFP because they enable the use of subgradient calculations…
We suggest a new explanation of flatness of galaxies rotation curves without invoking dark matter. For this purpose a new gravitational tensor field is introduced in addition to the metric tensor.
3D Gaussian Splatting (3DGS) has demonstrated superior quality in modeling 3D objects and scenes. However, generating 3DGS remains challenging due to their discrete, unstructured, and permutation-invariant nature. In this work, we present a…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
The extended-BMS algebra of asymptotically flat spacetime contains an SO(3,1) subgroup that acts by conformal transformations on the celestial sphere. It is of interest to study the representations of this subgroup associated with…
A new method is developed which permits the reconstruction of the surface-density distribution in the galactic disk of finite radius from an arbitrary smooth distribution of the angular velocity via two simple quadratures. The existence of…
This paper considers a multivariate spatial random field, with each component having univariate marginal distributions of the skew-Gaussian type. We assume that the field is defined spatially on the unit sphere embedded in $\mathbb{R}^3$,…
We show that the following variant of labeling rotating maps is NP-hard, and present a polynomial approximation scheme for solving it. The input is a set of feature points on a map, to each of which a vertical bar of zero width is assigned.…
In this paper, we extend and investigate the properties of the semi-smooth Newton method when applied to a general projection equation in finite dimensional spaces. We first present results concerning Clarke's generalized Jacobian of the…
The Mercator projection is sometimes confused with another mapping technique, specifically the central cylindrical projection, which projects the Earth's surface onto a cylinder tangent to the equator, as if a light source is at the Earth's…
Motivated by emerging applications from imaging processing, the heat flow of a generalized $p$-harmonic map into spheres is studied for the whole spectrum, $1\leq p<\infty$, in a unified framework. The existence of global weak solutions is…
Smooth convex minimization over the unit trace-norm ball is an important optimization problem in machine learning, signal processing, statistics and other fields, that underlies many tasks in which one wishes to recover a low-rank matrix…
We propose a novel method to fit and segment multi-structural data via convex relaxation. Unlike greedy methods --which maximise the number of inliers-- this approach efficiently searches for a soft assignment of points to models by…
We present a novel approach for studying the global dynamics of a vibro-impact pair, that is, a ball moving in a harmonically forced capsule. Motivated by a specific context of vibro-impact energy harvesting, we develop the method with…
Gaussian Splatting demonstrates impressive results in multi-view reconstruction based on Gaussian explicit representations. However, the current Gaussian primitives only have a single view-dependent color and an opacity to represent the…