Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorVintescu, Ana Maria
dc.contributor.authorDupont, Florent
dc.contributor.authorLavoué, Guillaume
dc.contributor.editorSkala, Václav
dc.date.accessioned2017-08-31T08:29:42Z
dc.date.available2017-08-31T08:29:42Z
dc.date.issued2017
dc.identifier.citationJournal of WSCG. 2017, vol. 25, no. 1, p. 21-30.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (on-line)
dc.identifier.uriwscg.zcu.cz/WSCG2017/!_2017_Journal_WSCG-No-1.pdf
dc.identifier.urihttp://hdl.handle.net/11025/26277
dc.format10 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.subjectpovrchová parametrizacecs
dc.subjectzpracování geometriecs
dc.subjecttrojúhelníkové sítěcs
dc.subjectroztahování okacs
dc.titleLeast squares affine transitions for global parameterizationen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedThis paper presents an efficient algorithm for a global parameterization of triangular surface meshes. In contrast to previous techniques which achieve global parameterization through the optimization of non-linear systems of equations, our algorithm is solely based on solving at most two linear equation systems, in the least square sense. Therefore, in terms of running time the unfolding procedure is highly efficient. Our approach is direct – it solves for the planar UV coordinates of each vertex directly – hence avoiding any numerically challenging planar reconstruction in a post-process. This results in a robust unfolding algorithm. Curvature prescription for user-provided cone singularities can either be specified manually, or suggested automatically by our approach. Experiments on a variety of surface meshes demonstrate the runtime efficiency of our algorithm and the quality of its unfolding. To demonstrate the utility and versatility of our approach, we apply it to seamless texturing. The proposed algorithm is computationally efficient, robust and results in a parameterization with acceptable metric distortion.en
dc.subject.translatedsurface parameterizationen
dc.subject.translatedgeometry processingen
dc.subject.translatedtriangular meshen
dc.subject.translatedmesh unfoldingen
dc.type.statusPeer-revieweden
Vyskytuje se v kolekcích:Volume 25, Number 1 (2017)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Vintescu.pdfPlný text8,25 MBAdobe PDFZobrazit/otevřít
Zobrazit minimální záznam Zobrazit statistiky


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/26277

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.

hledání
navigace
  1. DSpace at University of West Bohemia
  2. Publikace ZČU / UWB Publications
  3. Časopisy ZČU / UWB Journals
  4. Journal of WSCG
  5. Volume 25 (2017)
  6. Volume 25, Number 1 (2017)