Related papers: Adiabatic Isometric Mapping Algorithm for Embeddin…

Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a…

The geometry of a two-dimensional surface in a curved space can be most easily visualized by using an isometric embedding in flat three-dimensional space. Here we present a new method for embedding surfaces with spherical topology in flat…

We present a new numerical method for the isometric embedding of 2-geometries specified by their 2-metrics in three dimensional Euclidean space. Our approach is to directly solve the fundamental embedding equation supplemented by six…

A classical Theorem of Alexandrov states that the map associating its boundary to a convex polyhdedron of the 3-dimensional Euclidean space is a bijection from the set of convex polyhdedron up to congruence to the set of isometry classes of…

We prove that any metric of non-positive curvature in the sense of Alexandrov on a compact surface can be isometrically embedded as a convex spacelike Cauchy surface in a flat spacetime of dimension (2+1). The proof follows from polyhedral…

We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in…

We prove that the isometric embedding of any metric of differentiability class C1 in E3 exists. We use simplified notation for the given metric, namely geodesic parameters, and level parameters for the embedded surface in E3. Central to our…

We propose a new self-adaptive, double-loop smoothing algorithm to solve composite, nonsmooth, and constrained convex optimization problems. Our algorithm is based on Nesterov's smoothing technique via general Bregman distance functions. It…

We prove uniform convergence of metrics $g_k$ on a closed surface with bounded integral curvature (measure) in the sense of A.D. Alexandrov, under the assumption that the curvature measures $\mathbb{K}_{g_k}=\mu^1_k-\mu^2_k$, where…

We show that 3-dimensional polyhedral manifolds with nonnegative curvature in the sense of Alexandrov can be approximated by nonnegatively curved 3-dimensional Riemannian manifolds.

In this article we use the combinatorial and geometric structure of manifolds with embedded cylinders in order to develop an adiabatic decomposition of the Hodge cohomology of these manifolds. We will on the one hand describe the adiabatic…

This paper is devoted to prove that if an Alexandrov space of curvature not less than $\kappa$ with a codimension one extremal subset which admits an isometric involution with respect to the induced length metric, then the metric space…

We give a new proof for the local existence of a smooth isometric embedding of a smooth $3$-dimensional Riemannian manifold with nonzero Riemannian curvature tensor into $6$-dimensional Euclidean space. Our proof avoids the sophisticated…

We study the problem of construction of explicit isometric embeddings of (pseudo)-Riemannian manifolds. We discuss the method which is based in the idea that the exterior symmetry of the embedded surface and the interior symmetry of the…

We present a numerical method for solving Weyl's embedding problem which consists of finding a global isometric embedding of a positively curved and positive-definite spherical 2-metric into the Euclidean three space. The method is based on…

The Gauss curvature measure of a pointed Euclidean convex body is a measure on the unit sphere which extends the notion of Gauss curvature to non-smooth bodies. Alexandrov's problem consists in finding a convex body with given curvature…

Nontrivial isometric embeddings for flat metrics (i.e., those which are not just planes in the ambient space) can serve as useful tools in the description of gravity in the embedding gravity approach. Such embeddings can additionally be…

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present…

The asymptotic iteration method (AIM) is applied to obtain highly accurate eigenvalues of the radial Schroedinger equation with the singular potential V(r)=r^2+\lambda/r^\alpha (\alpha,\lambda> 0) in arbitrary dimensions. Certain…

Celebrated work of Alexandrov and Pogorelov determines exactly which metrics on the sphere are induced on the boundary of a compact convex subset of hyperbolic three-space. As a step toward a generalization for unbounded convex subsets, we…