Keenan CraneMathieu DesbrunPeter Schroeder2015-02-232015-02-232010https://diglib.eg.org/handle/10.2312/CGF.v29i5pp1525-1533https://diglib.eg.org/handle/10.2312/CGF.v29i5pp1525-1533This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities with given index. We compute these connections by solving a single linear system built from standard operators. The solution can be used to design rotationally symmetric direction fields with user-specified singularities and directional constraints.Trivial Connections on Discrete Surfaces10.1111/j.1467-8659.2010.01761.x1525-1533