Trivial Connections on Discrete Surfaces
Keenan Crane, Mathieu Desbrun, Peter Schroder
In Computer Graphics Forum, 29(5), 2010.
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.
Keyword(s): I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation
Article URL: http://dx.doi.org/10.1111/j.1467-8659.2010.01761.x
BibTeX format:
@article{CGF:CGF1761,
  author = {Keenan Crane and Mathieu Desbrun and Peter Schroder},
  title = {Trivial Connections on Discrete Surfaces},
  journal = {Computer Graphics Forum},
  volume = {29},
  number = {5},
  pages = {1525--1533},
  year = {2010},
}
Search for more articles by Keenan Crane.
Search for more articles by Mathieu Desbrun.
Search for more articles by Peter Schroder.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."