Spectral Conformal Parameterization

Simple item page
dc.contributor.authorMullen, Patricken_US
dc.contributor.authorTong, Yiyingen_US
dc.contributor.authorAlliez, Pierreen_US
dc.contributor.authorDesbrun, Mathieuen_US
dc.date.accessioned2015-02-21T17:32:32Z
dc.date.available2015-02-21T17:32:32Z
dc.date.issued2008en_US
dc.description.abstractWe present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts due to positional constraints on vertices and without undue bias introduced by sampling irregularity. High-quality parameterizations are computed through a constrained minimization of a discrete weighted conformal energy by finding the largest eigenvalue/eigenvector of a generalized eigenvalue problem involving sparse, symmetric matrices. We demonstrate that this novel and robust approach improves on previous linear techniques both quantitatively and qualitatively.en_US
dc.description.number5en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume27en_US
dc.identifier.doi10.1111/j.1467-8659.2008.01289.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages1487-1494en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2008.01289.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleSpectral Conformal Parameterizationen_US
Files
Collections
27-Issue 5
SGP08: Eurographics Symposium on Geometry Processing