Trivial Connections on Discrete Surfaces
Identifieur interne : 000061 ( Main/Corpus ); précédent : 000060; suivant : 000062Trivial Connections on Discrete Surfaces
Auteurs : Keenan Crane ; Mathieu Desbrun ; Peter SchröderSource :
- Computer Graphics Forum [ 0167-7055 ] ; 2010-07.
English descriptors
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.
Url:
DOI: 10.1111/j.1467-8659.2010.01761.x
Links to Exploration step
ISTEX:F88526A5D965503FA1EC2EB5561D659E96DEDB24Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Trivial Connections on Discrete Surfaces</title><author><name sortKey="Crane, Keenan" sort="Crane, Keenan" uniqKey="Crane K" first="Keenan" last="Crane">Keenan Crane</name><affiliation><mods:affiliation>Computing and Mathematical Sciences, Caltech</mods:affiliation></affiliation></author><author><name sortKey="Desbrun, Mathieu" sort="Desbrun, Mathieu" uniqKey="Desbrun M" first="Mathieu" last="Desbrun">Mathieu Desbrun</name><affiliation><mods:affiliation>Computing and Mathematical Sciences, Caltech</mods:affiliation></affiliation></author><author><name sortKey="Schroder, Peter" sort="Schroder, Peter" uniqKey="Schroder P" first="Peter" last="Schröder">Peter Schröder</name><affiliation><mods:affiliation>Computing and Mathematical Sciences, Caltech</mods:affiliation></affiliation><affiliation><mods:affiliation>Institute for Advanced Study, TU München</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F88526A5D965503FA1EC2EB5561D659E96DEDB24</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1111/j.1467-8659.2010.01761.x</idno><idno type="url">https://api.istex.fr/document/F88526A5D965503FA1EC2EB5561D659E96DEDB24/fulltext/pdf</idno><idno type="wicri:Area/Main/Corpus">000061</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Trivial Connections on Discrete Surfaces</title><author><name sortKey="Crane, Keenan" sort="Crane, Keenan" uniqKey="Crane K" first="Keenan" last="Crane">Keenan Crane</name><affiliation><mods:affiliation>Computing and Mathematical Sciences, Caltech</mods:affiliation></affiliation></author><author><name sortKey="Desbrun, Mathieu" sort="Desbrun, Mathieu" uniqKey="Desbrun M" first="Mathieu" last="Desbrun">Mathieu Desbrun</name><affiliation><mods:affiliation>Computing and Mathematical Sciences, Caltech</mods:affiliation></affiliation></author><author><name sortKey="Schroder, Peter" sort="Schroder, Peter" uniqKey="Schroder P" first="Peter" last="Schröder">Peter Schröder</name><affiliation><mods:affiliation>Computing and Mathematical Sciences, Caltech</mods:affiliation></affiliation><affiliation><mods:affiliation>Institute for Advanced Study, TU München</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Computer Graphics Forum</title><idno type="ISSN">0167-7055</idno><idno type="eISSN">1467-8659</idno><imprint><publisher>Blackwell Publishing Ltd</publisher><pubPlace>Oxford, UK</pubPlace><date type="published" when="2010-07">2010-07</date><biblScope unit="volume">29</biblScope><biblScope unit="issue">5</biblScope><biblScope unit="page" from="1525">1525</biblScope><biblScope unit="page" to="1533">1533</biblScope></imprint><idno type="ISSN">0167-7055</idno></series><idno type="istex">F88526A5D965503FA1EC2EB5561D659E96DEDB24</idno><idno type="DOI">10.1111/j.1467-8659.2010.01761.x</idno><idno type="ArticleID">CGF1761</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0167-7055</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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.</div></front></TEI><istex><corpusName>wiley</corpusName><author><json:item><name>Keenan Crane</name><affiliations><json:string>Computing and Mathematical Sciences, Caltech</json:string></affiliations></json:item><json:item><name>Mathieu Desbrun</name><affiliations><json:string>Computing and Mathematical Sciences, Caltech</json:string></affiliations></json:item><json:item><name>Peter Schröder</name><affiliations><json:string>Computing and Mathematical Sciences, Caltech</json:string><json:string>Institute for Advanced Study, TU München</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation</value></json:item></subject><articleId><json:string>CGF1761</json:string></articleId><language><json:string>eng</json:string></language><originalGenre><json:string>article</json:string></originalGenre><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.</abstract><qualityIndicators><score>7.22</score><pdfVersion>1.6</pdfVersion><pdfPageSize>541.417 x 741.26 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>1</keywordCount><abstractCharCount>428</abstractCharCount><pdfWordCount>5687</pdfWordCount><pdfCharCount>32099</pdfCharCount><pdfPageCount>9</pdfPageCount><abstractWordCount>60</abstractWordCount></qualityIndicators><title>Trivial Connections on Discrete Surfaces</title><genre><json:string>article</json:string></genre><host><volume>29</volume><publisherId><json:string>CGF</json:string></publisherId><pages><total>9</total><last>1533</last><first>1525</first></pages><issn><json:string>0167-7055</json:string></issn><issue>5</issue><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1467-8659</json:string></eissn><title>Computer Graphics Forum</title><doi><json:string>10.1111/(ISSN)1467-8659</json:string></doi></host><publicationDate>2010</publicationDate><copyrightDate>2010</copyrightDate><doi><json:string>10.1111/j.1467-8659.2010.01761.x</json:string></doi><id>F88526A5D965503FA1EC2EB5561D659E96DEDB24</id><score>3.4858575</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/F88526A5D965503FA1EC2EB5561D659E96DEDB24/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/F88526A5D965503FA1EC2EB5561D659E96DEDB24/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/F88526A5D965503FA1EC2EB5561D659E96DEDB24/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Trivial Connections on Discrete Surfaces</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Blackwell Publishing Ltd</publisher><pubPlace>Oxford, UK</pubPlace><availability><p>© 2010 The Author(s) Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd.</p></availability><date>2010</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Trivial Connections on Discrete Surfaces</title><author xml:id="author-1"><persName><forename type="first">Keenan</forename><surname>Crane</surname></persName><affiliation>Computing and Mathematical Sciences, Caltech</affiliation></author><author xml:id="author-2"><persName><forename type="first">Mathieu</forename><surname>Desbrun</surname></persName><affiliation>Computing and Mathematical Sciences, Caltech</affiliation></author><author xml:id="author-3"><persName><forename type="first">Peter</forename><surname>Schröder</surname></persName><affiliation>Computing and Mathematical Sciences, Caltech</affiliation><affiliation>Institute for Advanced Study, TU München</affiliation></author></analytic><monogr><title level="j">Computer Graphics Forum</title><idno type="pISSN">0167-7055</idno><idno type="eISSN">1467-8659</idno><idno type="DOI">10.1111/(ISSN)1467-8659</idno><imprint><publisher>Blackwell Publishing Ltd</publisher><pubPlace>Oxford, UK</pubPlace><date type="published" when="2010-07"></date><biblScope unit="volume">29</biblScope><biblScope unit="issue">5</biblScope><biblScope unit="page" from="1525">1525</biblScope><biblScope unit="page" to="1533">1533</biblScope></imprint></monogr><idno type="istex">F88526A5D965503FA1EC2EB5561D659E96DEDB24</idno><idno type="DOI">10.1111/j.1467-8659.2010.01761.x</idno><idno type="ArticleID">CGF1761</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2010</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>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.</p></abstract><textClass xml:lang="en"><keywords scheme="keyword"><list><head>keywords</head><item><term>I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2010-07">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/F88526A5D965503FA1EC2EB5561D659E96DEDB24/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Wiley, elements deleted: body"><istex:xmlDeclaration>version="1.0" encoding="UTF-8" standalone="yes"</istex:xmlDeclaration><istex:document><component version="2.0" type="serialArticle" xml:lang="en"><header><publicationMeta level="product"><publisherInfo><publisherName>Blackwell Publishing Ltd</publisherName><publisherLoc>Oxford, UK</publisherLoc></publisherInfo><doi origin="wiley" registered="yes">10.1111/(ISSN)1467-8659</doi><issn type="print">0167-7055</issn><issn type="electronic">1467-8659</issn><idGroup><id type="product" value="CGF"></id><id type="publisherDivision" value="ST"></id></idGroup><titleGroup><title type="main" sort="COMPUTER GRAPHICS FORUM">Computer Graphics Forum</title></titleGroup></publicationMeta><publicationMeta level="part" position="07105"><doi origin="wiley">10.1111/cgf.2010.29.issue-5</doi><numberingGroup><numbering type="journalVolume" number="29">29</numbering><numbering type="journalIssue" number="5">5</numbering></numberingGroup><coverDate startDate="2010-07">July 2010</coverDate></publicationMeta><publicationMeta level="unit" type="article" position="3" status="forIssue"><doi origin="wiley">10.1111/j.1467-8659.2010.01761.x</doi><idGroup><id type="unit" value="CGF1761"></id></idGroup><countGroup><count type="pageTotal" number="9"></count></countGroup><titleGroup><title type="tocHeading1">Differential Geometry</title></titleGroup><copyright>© 2010 The Author(s) Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd.</copyright><eventGroup><event type="xmlConverted" agent="Converter:BPG_TO_WML3G version:2.3.20 mode:FullText" date="2010-09-21"></event><event type="firstOnline" date="2010-09-21"></event><event type="publishedOnlineFinalForm" date="2010-09-21"></event><event type="xmlConverted" agent="Converter:WILEY_ML3G_TO_WILEY_ML3GV2 version:4.0.1" date="2014-03-15"></event><event type="xmlConverted" agent="Converter:WML3G_To_WML3G version:4.1.7 mode:FullText,remove_FC" date="2014-10-16"></event></eventGroup><numberingGroup><numbering type="pageFirst" number="1525">1525</numbering><numbering type="pageLast" number="1533">1533</numbering></numberingGroup><linkGroup><link type="toTypesetVersion" href="file:CGF.CGF1761.pdf"></link></linkGroup></publicationMeta><contentMeta><countGroup><count type="figureTotal" number="21"></count><count type="tableTotal" number="0"></count><count type="formulaTotal" number="3"></count><count type="referenceTotal" number="22"></count><count type="linksCrossRef" number="82"></count></countGroup><titleGroup><title type="main">Trivial Connections on Discrete Surfaces</title></titleGroup><creators><creator creatorRole="author" xml:id="cr1" affiliationRef="#a1"><personName><givenNames>Keenan</givenNames><familyName>Crane</familyName></personName></creator><creator creatorRole="author" xml:id="cr2" affiliationRef="#a1"><personName><givenNames>Mathieu</givenNames><familyName>Desbrun</familyName></personName></creator><creator creatorRole="author" xml:id="cr3" affiliationRef="#a1 #a2"><personName><givenNames>Peter</givenNames><familyName>Schröder</familyName></personName></creator></creators><affiliationGroup><affiliation xml:id="a1"><unparsedAffiliation>Computing and Mathematical Sciences, Caltech</unparsedAffiliation></affiliation><affiliation xml:id="a2"><unparsedAffiliation>Institute for Advanced Study, TU München</unparsedAffiliation></affiliation></affiliationGroup><keywordGroup xml:lang="en"><keyword xml:id="k1">I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation</keyword></keywordGroup><supportingInformation><p>Please note: Blackwell Publishing are not responsible for the content or functionality of any supplementary materials supplied by the authors. Any queries (other than missing material) should be directed to the corresponding author for the article.</p><supportingInfoItem><mediaResource alt="supporting info item" href="urn-x:wiley:01677055:media:cgf1761:CGF_1761_sm_flatconnections_editing"></mediaResource><caption>Supporting info item</caption></supportingInfoItem></supportingInformation><abstractGroup><abstract type="main" xml:lang="en"><title type="main">Abstract</title><p>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.</p></abstract></abstractGroup></contentMeta></header></component></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Trivial Connections on Discrete Surfaces</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Trivial Connections on Discrete Surfaces</title></titleInfo><name type="personal"><namePart type="given">Keenan</namePart><namePart type="family">Crane</namePart><affiliation>Computing and Mathematical Sciences, Caltech</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Mathieu</namePart><namePart type="family">Desbrun</namePart><affiliation>Computing and Mathematical Sciences, Caltech</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Peter</namePart><namePart type="family">Schröder</namePart><affiliation>Computing and Mathematical Sciences, Caltech</affiliation><affiliation>Institute for Advanced Study, TU München</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="article" displayLabel="article"></genre><originInfo><publisher>Blackwell Publishing Ltd</publisher><place><placeTerm type="text">Oxford, UK</placeTerm></place><dateIssued encoding="w3cdtf">2010-07</dateIssued><copyrightDate encoding="w3cdtf">2010</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType><extent unit="figures">21</extent><extent unit="formulas">3</extent><extent unit="references">22</extent></physicalDescription><abstract lang="en">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.</abstract><subject lang="en"><genre>keywords</genre><topic>I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation</topic></subject><relatedItem type="host"><titleInfo><title>Computer Graphics Forum</title></titleInfo><genre type="journal">journal</genre><note type="content"> Please note: Blackwell Publishing are not responsible for the content or functionality of any supplementary materials supplied by the authors. Any queries (other than missing material) should be directed to the corresponding author for the article.Supporting Info Item: Supporting info item - </note><identifier type="ISSN">0167-7055</identifier><identifier type="eISSN">1467-8659</identifier><identifier type="DOI">10.1111/(ISSN)1467-8659</identifier><identifier type="PublisherID">CGF</identifier><part><date>2010</date><detail type="volume"><caption>vol.</caption><number>29</number></detail><detail type="issue"><caption>no.</caption><number>5</number></detail><extent unit="pages"><start>1525</start><end>1533</end><total>9</total></extent></part></relatedItem><identifier type="istex">F88526A5D965503FA1EC2EB5561D659E96DEDB24</identifier><identifier type="DOI">10.1111/j.1467-8659.2010.01761.x</identifier><identifier type="ArticleID">CGF1761</identifier><accessCondition type="use and reproduction" contentType="copyright">© 2010 The Author(s) Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd.</accessCondition><recordInfo><recordContentSource>WILEY</recordContentSource><recordOrigin>Blackwell Publishing Ltd</recordOrigin></recordInfo></mods></metadata><enrichments><json:item><type>multicat</type><uri>https://api.istex.fr/document/F88526A5D965503FA1EC2EB5561D659E96DEDB24/enrichments/multicat</uri></json:item></enrichments><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Amerique/explor/CaltechV1/Data/Main/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000061 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Corpus/biblio.hfd -nk 000061 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Amerique
|area= CaltechV1
|flux= Main
|étape= Corpus
|type= RBID
|clé= ISTEX:F88526A5D965503FA1EC2EB5561D659E96DEDB24
|texte= Trivial Connections on Discrete Surfaces
}}
| This area was generated with Dilib version V0.6.32. |  |