Regularizations of non-euclidean polygons

2013/11/27 by Dimitris Vartziotis, Vartziotis, Dimitris, Doris Bohnet +1
Mathematics · #51F99 #68R01 #FOS: Mathematics #Metric Geometry (math.MG) #math.MG #msc:51F99 #msc:68R01

paper · pdf · doi:10.48550/arxiv.1312.2500

18 pages, 5 figures

arxiv created 2013/11/27 · arxiv updated 2013/12/10

Abstract

We are interested in easy geometric transformations which regularize n-polygons in the non-euclidean plane. A transformation is called easy if it can be easily implemented into an algorithm. This article is motivated by preceding work on geometric transformations on euclidean polygons and possible applications for non-euclidean meshes.

Related

• Polygons in hyperbolic geometry 1: Rigidity and inversion of the n-inequality
• Geodesic-Preserving Polygon Simplification
• Some contributions to Regular Polygons
• Detecting all regular polygons in a point set
• An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles