Regularizations of non-euclidean polygons
classification
🧮 math.MG
keywords
non-euclideaneasygeometricpolygonstransformationsalgorithmapplicationsarticle
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.