Trivial Connections on Discrete Surfaces
Article first published online: 21 SEP 2010
© 2010 The Author(s) Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd.
Computer Graphics Forum
Volume 29, Issue 5, pages 1525–1533, July 2010
How to Cite
Crane, K., Desbrun, M. and Schröder, P. (2010), Trivial Connections on Discrete Surfaces. Computer Graphics Forum, 29: 1525–1533. doi: 10.1111/j.1467-8659.2010.01761.x
- Issue published online: 21 SEP 2010
- Article first published online: 21 SEP 2010
- I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation
This 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.