TY - JOUR
T1 - Autocuts
T2 - ACM SIGGRAPH Asia Conference, SA 2017
AU - Poranne, Roi
AU - Tarini, Marco
AU - Huber, Sandro
AU - Panozzo, Daniele
AU - Sorkine-Hornung, Olga
N1 - Funding Information:
This work is partially supported by the European Research Council under Grant No.: StG-2012-306877 (ERC Starting Grant iModel), NSF CAREER award (1652515), PRIN project “DSURF” (2015B8TRFM), and a gift from Adobe Research. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. © 2017 Association for Computing Machinery. 0730-0301/2017/11-ART215 $15.00 https://doi.org/10.1145/3130800.3130845
Funding Information:
This work is partially supported by the European Research Council under Grant No.: StG-2012-306877 (ERC Starting Grant iModel), NSF CAREER award (1652515), PRIN project “DSURF” (2015B8TRFM), and a gift from Adobe Research. We would like to thank Mario Botsch, Francis Williams, and the anonymous reviewers for their helpful comments and suggestions.
Publisher Copyright:
© 2017 Association for Computing Machinery.
PY - 2017/11/20
Y1 - 2017/11/20
N2 - We propose a UV mapping algorithm that jointly optimizes for cuts and distortion, sidestepping heuristics for placing the cuts. The energy we minimize is a state-of-the-art geometric distortion measure, generalized to take seams into account. Our algorithm is designed to support an interactive workflow: it optimizes UV maps on the fly, while the user can interactively move vertices, cut mesh parts, join seams, separate overlapping regions, and control the placement of the parameterization patches in the UV space. Our UV maps are of high quality in terms of both geometric distortion and cut placement, and compare favorably to those designed with traditional modeling tools. The UV maps can be created in a fraction of the time as existing methods, since our algorithm drastically alleviates the trial-and-error, iterative procedures that plague traditional UV mapping approaches.
AB - We propose a UV mapping algorithm that jointly optimizes for cuts and distortion, sidestepping heuristics for placing the cuts. The energy we minimize is a state-of-the-art geometric distortion measure, generalized to take seams into account. Our algorithm is designed to support an interactive workflow: it optimizes UV maps on the fly, while the user can interactively move vertices, cut mesh parts, join seams, separate overlapping regions, and control the placement of the parameterization patches in the UV space. Our UV maps are of high quality in terms of both geometric distortion and cut placement, and compare favorably to those designed with traditional modeling tools. The UV maps can be created in a fraction of the time as existing methods, since our algorithm drastically alleviates the trial-and-error, iterative procedures that plague traditional UV mapping approaches.
KW - Cuts
KW - Distortion minimization
KW - Parameterization
KW - UV mapping
UR - http://www.scopus.com/inward/record.url?scp=85038924678&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85038924678&partnerID=8YFLogxK
U2 - 10.1145/3130800.3130845
DO - 10.1145/3130800.3130845
M3 - Conference article
AN - SCOPUS:85038924678
SN - 0730-0301
VL - 36
JO - ACM Transactions on Graphics
JF - ACM Transactions on Graphics
IS - 6
M1 - a215
Y2 - 27 November 2017 through 30 November 2017
ER -