Related papers: Solving Euclidean Problems by Isotropic Initializa…

We present alternative postulates for Euclidean geometry whose merit is that they lead to a new class of invariants and associated geometries for real finite-dimensional unital associative algebras.

The isometric embedding of surfaces in three-dimensional space is fundamental to various physical systems, from elastic sheets to programmable materials. While continuous surfaces typically admit unique solutions under suitable boundary…

The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…

We establish a new algorithm that generates a new solution to the Einstein field equations, with an anisotropic matter distribution, from a seed isotropic solution. The new solution is expressed in terms of integrals of an isotropic…

The Euclidean space notion of convex sets (and functions) generalizes to Riemannian manifolds in a natural sense and is called geodesic convexity. Extensively studied computational problems such as convex optimization and sampling in convex…

After having investigated the real conic sections and their isoptic curves in the hyperbolic plane $\bH^2$ we consider the problem of the isoptic curves of generalized conic sections in the extended hyperbolic plane. This topic is widely…

Entropic regularization is a method for large-scale linear programming. Geometrically, one traces intersections of the feasible polytope with scaled toric varieties, starting at the Birch point. We compare this to log-barrier methods, with…

We investigate the following problem: Given two embeddings G_1 and G_2 of the same abstract graph G on an orientable surface S, decide whether G_1 and G_2 are isotopic; in other words, whether there exists a continuous family of embeddings…

Consider the problem of minimizing a quadratic objective subject to quadratic equations. We study the semialgebraic region of objective functions for which this problem is solved by its semidefinite relaxation. For the Euclidean distance…

We show that if a cusped hyperbolic manifold is Platonic, i.e., can be decomposed into isometric Platonic solids, it can also be decomposed into geodesic ideal tetrahedra.

Level set-based immersed boundary techniques operate on nonconforming meshes while providing a crisp definition of interface and external boundaries. In such techniques, an isocontour of a level set field interpolated from nodal level set…

In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…

The Euclidean scattering transform was introduced nearly a decade ago to improve the mathematical understanding of convolutional neural networks. Inspired by recent interest in geometric deep learning, which aims to generalize convolutional…

Solving the inverse kinematics problem is a fundamental challenge in motion planning, control, and calibration for articulated robots. Kinematic models for these robots are typically parametrized by joint angles, generating a complicated…

In this paper, we present an immersed weak Galerkin method for solving second-order elliptic interface problems. The proposed method does not require the meshes to be aligned with the interface. Consequently, uniform Cartesian meshes can be…

We consider the problem of reconstructing an embedding of a compact connected Riemannian manifold in a Euclidean space up to an almost isometry, given the information on intrinsic distances between points from its ``sufficiently large''…

We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…

Inspired by the introduction of Volumetric Modeling via volumetric representations (V-reps) by Massarwi and Elber in 2016, in this paper we present a novel approach for the construction of isogeometric numerical methods for elliptic PDEs on…

This article presents a new and efficient alternative to well established algorithms for molecular geometry optimization. The new approach exploits the approximate decoupling of molecular energetics in a curvilinear internal coordinate…

In this paper, we present a geometric multigrid methodology for the solution of matrix systems associated with isogeometric compatible discretizations of the generalized Stokes and Oseen problems. The methodology provably yields a pointwise…