Trivial Connections on Discrete Surfaces
Journal Article, Computer Graphics Forum, Vol. 29, No. 5, July, 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.
Notes
SGP Best Paper Award
SGP Best Paper Award
BibTeX
@article{Crane-2010-17086,author = {Keenan Crane and Mathieu Desbrun and Peter Schroder},
title = {Trivial Connections on Discrete Surfaces},
journal = {Computer Graphics Forum},
year = {2010},
month = {July},
volume = {29},
number = {5},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.