Trivial Connections on Discrete Surfaces
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.
BibTeX
@article {,
journal = {Computer Graphics Forum},
title = {{Trivial Connections on Discrete Surfaces}},
author = {Keenan Crane and Mathieu Desbrun and Peter Schroeder},
year = {2010},
DOI = {}
}
journal = {Computer Graphics Forum},
title = {{Trivial Connections on Discrete Surfaces}},
author = {Keenan Crane and Mathieu Desbrun and Peter Schroeder},
year = {2010},
DOI = {}
}