#GeodesicTriangulation

2024-09-08

Here's a math puzzle: I have a two-dimensional sphere, the unit sphere. I want to form a geodesic triangulation such that there are at least N vertices, and the edge length connecting vertex \(i\) with vertex \(j\) is denoted \(\ell_{ij}=|e_{ij}|\) but specifically satisfies \(|\ell_{ij}-\ell|<\varepsilon\) where \(\varepsilon\) is a given tolerance (we can assume \(0<\varepsilon\ll\ell\)).

Puzzle: is there a relation or equation expressing the number of vertices \(N\) with the maximum deviation from equilateral triangles \(\varepsilon\)?

I'm curious about the cases where \(5810\leq N<10^{4}\) and \(\varepsilon\lesssim 10^{-4}\), if this helps any.

#Math #Puzzle #Triangulation #Sphere #Geodesic #Geometry #GeodesicTriangulation #Mathematics

Client Info

Server: https://mastodon.social
Version: 2025.04
Repository: https://github.com/cyevgeniy/lmst