Trivial Connections on Discrete Surfaces

Simple item page
dc.contributor.authorKeenan Craneen_US
dc.contributor.authorMathieu Desbrunen_US
dc.contributor.authorPeter Schroederen_US
dc.date.accessioned2015-02-23T17:15:31Z
dc.date.available2015-02-23T17:15:31Z
dc.date.issued2010en_US
dc.description.abstractThis 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.en_US
dc.description.number5en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2010.01761.xen_US
dc.identifier.pages1525-1533en_US
dc.identifier.urihttps://diglib.eg.org/handle/10.2312/CGF.v29i5pp1525-1533en_US
dc.identifier.urihttps://diglib.eg.org/handle/10.2312/CGF.v29i5pp1525-1533
dc.titleTrivial Connections on Discrete Surfacesen_US
Files
Collections
29-Issue 5
SGP10: Eurographics Symposium on Geometry Processing