Degree-regular triangulations of surfaces
Basudeb Datta, Subhojoy Gupta

TL;DR
This paper proves that degree-regular triangulations of surfaces are geometric and classifies their possibilities, showing that for the plane, such triangulations are unique for degrees greater than 6.
Contribution
It establishes the geometric nature of degree-regular triangulations on surfaces and proves the uniqueness of such triangulations of the plane for degrees above 6.
Findings
Degree-regular triangulations are geometric with constant curvature.
Uniqueness of $d$-regular triangulations of the plane for $d>6$.
Classification of possible degree-regular triangulations on surfaces.
Abstract
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface is geometric, that is, it is combinatorially equivalent to a geodesic triangulation with respect to a constant curvature metric on , and we list the possibilities. A key ingredient of the proof is to show that any two -regular triangulations of the plane for are combinatorially equivalent. The proof of this uniqueness result, which is of independent interest, is based on an inductive argument involving some combinatorial topology.
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 · Digital Image Processing Techniques · Advanced Numerical Analysis Techniques
