Related papers: Regularizations of non-euclidean polygons
In this article, we found all simple closed geodesics on regular spherical octahedra and spherical cubes. In addition, we estimate the number of simple closed geodesics on regular spherical tetrahedra.
Non-Euclidean plates are a subset of the class of elastic bodies having no stress-free configuration. Such bodies exhibit residual stress when relaxed from all external constraints, and may assume complicated equilibrium shapes even in the…
This work contributes to the analysis of linear geometric polygon transformations with the aim to force a desired shape by an iterative procedure.
In this article, we introduce a new object, a virtual quadratic space, and its group of isometries. They are presented as natural generalizations of quadratic spaces and orthogonal groups. It is then shown that by replacing quadratic spaces…
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
The purpose of this article is to present a new regularization technique of quasi-plurisubharmoinc functions on a compact Kaehler manifold. The idea is to regularize the function on local coordinate balls first, and then glue each piece…
In the era of foundation models and Large Language Models (LLMs), Euclidean space is the de facto geometric setting of our machine learning architectures. However, recent literature has demonstrated that this choice comes with fundamental…
This paper describes a node relocation algorithm based on nonlinear optimization which delivers excellent results for both unstructured and structured plane triangle meshes over convex as well as non-convex domains with high curvature. The…
The main objective of the present paper is to investigate a sufficient condition for which a rectifying curve on a smooth surface remains invariant under isometry of surfaces, and also it is shown that under such an isometry the component…
Simplification is one of the fundamental operations used in geoinformation science (GIS) to reduce size or representation complexity of geometric objects. Although different simplification methods can be applied depending on one's purpose,…
We show that the problem of tiling the Euclidean plane with a finite set of polygons (up to translation) boils down to prove the existence of zeros of a non-negative convex function defined on a finite-dimensional simplex. This function is…
It is shown that the generalized geometries may be obtained as a deformation of the proper Euclidean geometry. Algorithm of construction of any proposition S of the proper Euclidean geometry E may be described in terms of the Euclidean…
We discover suprising connections between three seemingly different problems: finding right triangles with rational sides in a non-Euclidean geometry, finding three integers such that the difference of the squares of any two is a square,…
It is known that the space of convex polygons in the Euclidean plane with fixed normals, up to homotheties and translations, endowed with the area form, is isometric to a hyperbolic polyhedron. In this note we show a class of convex…
For a polygon in Euclidean space we consider a transformation T which is obtained by applying the midpoints polygon construction twice and using an index shift. For a closed polygon this is a curve shortening process. A polygon is called…
We describe a procedure, called regularisation, that allows us to study geometric structures on Lie algebroids via foliated geometric structures on a manifold of higher dimension. This procedure applies to various classes of Lie algebroids;…
This paper deals with various topics in analysis on hyperbolic spaces. It surveys some recent progress in non-Euclidean Fourier Analysis and proves some new results for the geodesic Radon transform on hyperbolic spaces.
This paper describes a general-purpose programming technique, called the Simulation of Simplicity, which can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer from the task to provide a…
We propose a new approach to the theory of normal forms for Hamiltonian systems near a non-resonant elliptic singular point. We consider the space of all Hamiltonian functions with such an equilibrium position at the origin and construct a…