Trivial connections on discrete surfaces

Keenan Crane; Mathieu Desbrun; Peter Schröder

doi:10.1111/j.1467-8659.2010.01761.x

Trivial connections on discrete surfaces

Keenan Crane
, Mathieu Desbrun
, Peter Schröder

Research output: Contribution to journal › Article › peer-review

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. Journal compilation

Original language	English
Pages (from-to)	1525-1533
Number of pages	9
Journal	Computer Graphics Forum
Volume	29
Issue number	5
DOIs	https://doi.org/10.1111/j.1467-8659.2010.01761.x
Publication status	Published - 1 Jan 2010
Externally published	Yes

Access to Document

10.1111/j.1467-8659.2010.01761.x

Cite this

@article{5711e22d5cb548c192ccfcd5b9a0e8d9,

title = "Trivial connections on discrete surfaces",

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. Journal compilation",

author = "Keenan Crane and Mathieu Desbrun and Peter Schr{\"o}der",

year = "2010",

month = jan,

day = "1",

doi = "10.1111/j.1467-8659.2010.01761.x",

language = "English",

volume = "29",

pages = "1525--1533",

journal = "Computer Graphics Forum",

issn = "0167-7055",

number = "5",

}

TY - JOUR

T1 - Trivial connections on discrete surfaces

AU - Crane, Keenan

AU - Desbrun, Mathieu

AU - Schröder, Peter

PY - 2010/1/1

Y1 - 2010/1/1

N2 - 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. Journal compilation

AB - 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. Journal compilation

UR - https://www.scopus.com/pages/publications/77957233900

U2 - 10.1111/j.1467-8659.2010.01761.x

DO - 10.1111/j.1467-8659.2010.01761.x

M3 - Article

AN - SCOPUS:77957233900

SN - 0167-7055

VL - 29

SP - 1525

EP - 1533

JO - Computer Graphics Forum

JF - Computer Graphics Forum

IS - 5

ER -

Trivial connections on discrete surfaces

Abstract

Access to Document

Other files and links

Fingerprint

Cite this