Delaunay triangulations of lens spaces
Francois Gueritaud

TL;DR
This paper studies the geometric structure of lens spaces by analyzing the convex hulls of finite subgroups in complex space, revealing combinatorial patterns linked to continued fractions and providing a new proof of a known theorem.
Contribution
It offers a new proof of Smilansky's theorem on convex hulls of finite subgroups in complex space, with enhanced intermediate results and combinatorial insights.
Findings
Convex hulls are characterized by continued fraction patterns.
Provides a stronger intermediate step in the proof of Smilansky's theorem.
Connects geometric structures of lens spaces with combinatorial continued fraction data.
Abstract
We compute the convex hull in of an arbitrary finite subgroup of . The combinatorics are dictated by continued fractions in a natural way. This reproves a theorem of Smilansky, with a slightly stronger intermediary step.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Geometric and Algebraic Topology · Advanced Combinatorial Mathematics
