Related papers: Flat Map of a Sphere via Stress Minimization
An analogue of the total variation prior for the normal vector field along the boundary of piecewise flat shapes in 3D is introduced. A major class of examples are triangulated surfaces as they occur for instance in finite element…
For a geodesic ball with non-negative Ricci curvature and almost maximal volume, without using compactness argument, we construct an $\epsilon$-splitting map on a concentric geodesic ball with uniformly small radius. There are two new…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
In this paper we present a new algorithmic realization of a projection-based scheme for general convex constrained optimization problem. The general idea is to transform the original optimization problem to a sequence of feasibility…
We propose a formulation of gravity theory in the form of a field theory in a flat space-time with a number of dimensions greater than four. Configurations of the field under consideration describe the splitting of this space-time into a…
We give linear-time quasiconvex programming algorithms for finding a Moebius transformation of a set of spheres in a unit ball or on the surface of a unit sphere that maximizes the minimum size of a transformed sphere. We can also use…
A projection-based formulation is presented for non-linear model reduction of problems with extreme scale disparity. The approach allows for the selection of an arbitrary, but complete, set of solution variables while preserving the…
We present an algorithm for creating contiguous cartograms using meshes. We use numerical optimization to minimize cartographic error and distortion by transforming the mesh vertices. The vertices can either be optimized in the plane or…
A partition $\mathcal{P}$ of a weighted graph $G$ is $(\sigma,\tau,\Delta)$-sparse if every cluster has diameter at most $\Delta$, and every ball of radius $\Delta/\sigma$ intersects at most $\tau$ clusters. Similarly, $\mathcal{P}$ is…
The scalar-tensor theory of gravity with the Higgs field as scalar field is presented. For central symmetry it reproduces the empirically measured flat rotation curves of galaxies. We approximate the galaxy by a polytropic gas sphere with…
A new formula for the gravitational potential of flattened systems is proposed. It is a modification of the Miyamoto-Nagai potential and should be applied to very flattened systems, exponential discs as a typical example. The resulting…
Reconstructing 3D assets from images, known as inverse rendering (IR), remains a challenging task due to its ill-posed nature. 3D Gaussian Splatting (3DGS) has demonstrated impressive capabilities for novel view synthesis (NVS) tasks.…
In this work, we develop new optimization algorithms that use approximate second-order information combined with the gradient regularization technique to achieve fast global convergence rates for both convex and non-convex objectives. The…
In this article we introduce a new type of cyclic contraction mapping on a pair of subsets of a metric space with a graph and prove best proximity points results for the same. Also, we demonstrate that the number of such points is same with…
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.…
We propose a new exact approach to the generalized graph layering problem that is based on a particular quadratic assignment formulation. It expresses, in a natural way, the associated layout restrictions and several possible objectives,…
We consider a PDE approach to numerically solving the optimal transportation problem on the sphere. We focus on both the traditional squared geodesic cost and a logarithmic cost, which arises in the reflector antenna design problem. At each…
A Graph of Convex Sets (GCS) is a graph in which vertices are associated with convex programs and edges couple pairs of programs through additional convex costs and constraints. Any optimization problem over an ordinary weighted graph…
A knotted surface in the 4-sphere may be described by means of a hyperbolic diagram that captures the 0-section of a special Morse function, called a hyperbolic decomposition. We show that every hyperbolic decomposition of a knotted surface…
We outline a new approach for solving optimization problems which enforce triangle inequalities on output variables. We refer to this as metric-constrained optimization, and give several examples where problems of this form arise in machine…