Sciweavers

Share
CGF
2010

Trivial Connections on Discrete Surfaces

8 years 6 months ago
Trivial Connections on Discrete Surfaces
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. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Picture/Image Generation-Line and curve generation
Keenan Crane, Mathieu Desbrun, Peter Schröder
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CGF
Authors Keenan Crane, Mathieu Desbrun, Peter Schröder
Comments (0)
books