| dc.contributor.author | Keenan Crane | en_US |
| dc.contributor.author | Mathieu Desbrun | en_US |
| dc.contributor.author | Peter Schroeder | en_US |
| dc.date.accessioned | 2015-02-23T17:15:31Z | |
| dc.date.available | 2015-02-23T17:15:31Z | |
| dc.date.issued | 2010 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10.2312/CGF.v29i5pp1525-1533 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10.2312/CGF.v29i5pp1525-1533 | |
| dc.description.abstract | 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. | en_US |
| dc.title | Trivial Connections on Discrete Surfaces | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 29 | en_US |
| dc.description.number | 5 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2010.01761.x | en_US |
| dc.identifier.pages | 1525-1533 | en_US |
