English
Related papers

Related papers: Regularizations of non-euclidean polygons

200 papers

An isometry is a geometric transformation that preserves distances between pairs of points. We present methods to classify isometries in the Euclidean plane, and extend these methods to spherical, single elliptical, and hyperbolic geometry.…

Metric Geometry · Mathematics 2023-06-28 Lillian MacArthur , Honglin Zhu

A new renormalization scheme for theories with nontrivial internal symmetry is proposed. The scheme is regularization independent and respects the symmetry requirements.

High Energy Physics - Theory · Physics 2016-11-23 A. A. Slavnov

How can we convince students, who have mainly learned to follow given mathematical rules, that mathematics can also be fascinating, creative, and beautiful? In this paper I discuss different ways of introducing non-Euclidean geometry to…

History and Overview · Mathematics 2021-06-01 Hanne Kekkonen

Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters…

Data Structures and Algorithms · Computer Science 2017-06-21 Michael Jünger , Petra Mutzel , Christiane Spisla

In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…

Algebraic Geometry · Mathematics 2020-05-05 Davide Antonio Nello Maran

Let $P=A_1\ldots A_n$ be a generic polygon in three-dimensional space and let $v_1,v_2,\ldots,v_n$ be vectors $\overline{A_1A_2},\overline{A_2A_3},\ldots,\overline{A_nA_1}$, respectively. $P$ will be called \emph{regular}, if there exist…

Metric Geometry · Mathematics 2020-04-28 Yury Kochetkov

This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…

History and Overview · Mathematics 2026-03-03 James M Parks

A method of ``blocking'' triangulations that rests on the self-similarity feature of dynamically triangulated random manifolds is proposed. The method is used to define the renormalization group for random geometries. As an illustration,…

High Energy Physics - Lattice · Physics 2009-10-22 D. Johnston , J-P. Kownacki , A. Krzywicki

Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…

Methodology · Statistics 2018-09-26 Vincent Runge

We introduce an elementary transformation called flips on tilings by squares and triangles and conjecture that it connects any two tilings of the same region of the Euclidean plane.

Discrete Mathematics · Computer Science 2024-06-25 Thomas Fernique , Olga Mikhailovna Sizova

We present a family of non-local variational regularization methods for solving tomographic problems, where the solutions are functions with range in a closed subset of the Euclidean space, for example if the solution only attains values in…

Optimization and Control · Mathematics 2019-11-18 Melanie Melching , Otmar Scherzer

Hyperbolic geometry has emerged as a powerful tool for modeling complex, structured data, particularly where hierarchical or tree-like relationships are present. By enabling embeddings with lower distortion, hyperbolic neural networks offer…

Machine Learning · Computer Science 2025-06-18 Pol Arévalo , Alexis Molina , Álvaro Ciudad

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…

General Relativity and Quantum Cosmology · Physics 2015-06-23 Wolfgang Tichy , Jonathan R. McDonald , Warner A. Miller

We introduce a smoothing algorithm for triangle, quadrilateral, tetrahedral and hexahedral meshes whose centerpiece is a simple geometric triangle transformation. The first part focuses on the mathematical properties of the element…

Numerical Analysis · Mathematics 2017-08-29 Dimitris Vartziotis , Doris Bohnet

We consider practical aspects of reconstructing planar curves with prescribed Euclidean or affine curvatures. These curvatures are invariant under the special Euclidean group and the equi-affine groups, respectively, and play an important…

Differential Geometry · Mathematics 2024-04-02 Jose Agudelo , Brooke Dippold , Ian Klein , Alex Kokot , Eric Geiger , Irina Kogan

Quadratic surfaces gain more and more attention among the Geometric Algebra community and some frameworks were proposed in order to represent, transform, and intersect these quadratic surfaces. As far as the authors know, none of these…

Computational Geometry · Computer Science 2019-03-07 Stéphane Breuils , Vincent Nozick , Laurent Fuchs , Akihiro Sugimoto

We introduce an elliptic regularization of the PDE system representing the isometric immersion of a surface in $\mathbb R^{3}$. The regularization is geometric, and has a natural variational interpretation.

Differential Geometry · Mathematics 2017-02-22 Michael T. Anderson

Manifold optimization is ubiquitous in computational and applied mathematics, statistics, engineering, machine learning, physics, chemistry and etc. One of the main challenges usually is the non-convexity of the manifold constraints. By…

Optimization and Control · Mathematics 2019-06-14 Jiang Hu , Xin Liu , Zaiwen Wen , Yaxiang Yuan

Classical (Euclidean) Laguerre geometry studies oriented hyperplanes, oriented hyperspheres, and their oriented contact in Euclidean space. We describe how this can be generalized to arbitrary Cayley-Klein spaces, in particular hyperbolic…

Metric Geometry · Mathematics 2020-09-03 Alexander I. Bobenko , Carl O. R. Lutz , Helmut Pottmann , Jan Techter

We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…

Computational Geometry · Computer Science 2020-11-03 Alon Efrat , Radoslav Fulek , Stephen Kobourov , Csaba D. Tóth