Trivial Connections on Discrete Surfaces
Keenan Crane, Mathieu Desbrun, Peter Schröder
Eurographics Symposium on Geometry Processing, 2010, pp. 1525--1533.
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.
Article URL: http://diglib.eg.org/EG/CGF/volume29/issue5/v29i5pp1525-1533.pdf
BibTeX format:
@inproceedings{Crane:2010:TCO,
  author = {Keenan Crane and Mathieu Desbrun and Peter Schröder},
  title = {Trivial Connections on Discrete Surfaces},
  booktitle = {Eurographics Symposium on Geometry Processing},
  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 Schröder.

Return to the search page.


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