Delaunay triangulations of lens spaces
classification
🧮 math.GT
keywords
mathbbarbitrarycombinatoricscomputecontinuedconvexdelaunaydictated
read the original abstract
We compute the convex hull in $\mathbb{C}^2$ of an arbitrary finite subgroup of ${\mathbb{C}^*}^2$. The combinatorics are dictated by continued fractions in a natural way. This reproves a theorem of Smilansky, with a slightly stronger intermediary step.
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.