{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:56:19Z","timestamp":1770339379376,"version":"3.49.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T00:00:00Z","timestamp":1543881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Amazon Research Award"},{"name":"Skoltech--MIT Next Generation Program"},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-12-R-0011"],"award-info":[{"award-number":["W911NF-12-R-0011"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MIT Research Support Committee"},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MIT--IBM Watson AI Laboratory"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2018,12,31]]},"abstract":"<jats:p>\n            Low-distortion mapping of three-dimensional surfaces to the plane is a critical problem in geometry processing. The intrinsic distortion introduced by these UV mappings is highly dependent on the choice of surface cuts that form seamlines which break mapping continuity. Parameterization applications typically require UV maps with an application-specific upper bound on distortion to avoid mapping artifacts; at the same time they seek to reduce cut lengths to minimize discontinuity artifacts. We propose\n            <jats:italic>OptCuts<\/jats:italic>\n            , an algorithm that jointly optimizes the parameterization and cutting of a three-dimensional mesh. OptCuts starts from an arbitrary initial embedding and a user-requested distortion bound. It requires no parameter setting and automatically seeks to minimize seam lengths subject to satisfying the distortion bound of the mapping computed using these seams. OptCuts alternates between topology and geometry update steps that consistently decrease distortion and seam length, producing a UV map with compact boundaries that strictly satisfies the distortion bound. OptCuts automatically produces high-quality, globally bijective UV maps without user intervention. While OptCuts can thus be a highly effective tool to create new mappings from scratch, we also show how it can be employed to improve pre-existing embeddings. Additionally, when semantic or other priors on seam placement are desired, OptCuts can be extended to respect these user preferences as constraints during optimization of the parameterization. We demonstrate the scalable performance of OptCuts on a wide range of challenging benchmark parameterization examples, as well as in comparisons with state-of-the-art UV methods and commercial tools.\n          <\/jats:p>","DOI":"10.1145\/3272127.3275042","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T19:16:10Z","timestamp":1543432570000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["OptCuts"],"prefix":"10.1145","volume":"37","author":[{"given":"Minchen","family":"Li","sequence":"first","affiliation":[{"name":"University of British Columbia &amp; Adobe Research"}]},{"given":"Danny M.","family":"Kaufman","sequence":"additional","affiliation":[{"name":"Adobe Research"}]},{"given":"Vladimir G.","family":"Kim","sequence":"additional","affiliation":[{"name":"Adobe Research"}]},{"given":"Justin","family":"Solomon","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Alla","family":"Sheffer","sequence":"additional","affiliation":[{"name":"University of British Columbia"}]}],"member":"320","published-online":{"date-parts":[[2018,12,4]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-037-2"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818099"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766921"},{"key":"e_1_2_2_4_1","volume-title":"Minimization of functions having Lipschitz continuous first partial derivatives. Pacific Journal of mathematics 16, 1","author":"Armijo Larry","year":"1966","unstructured":"Larry Armijo . 1966. Minimization of functions having Lipschitz continuous first partial derivatives. Pacific Journal of mathematics 16, 1 ( 1966 ), 1--3. Larry Armijo. 1966. Minimization of functions having Lipschitz continuous first partial derivatives. Pacific Journal of mathematics 16, 1 (1966), 1--3."},{"key":"e_1_2_2_5_1","volume-title":"Nonlinear Programming","author":"Bertsekas Dimitri P.","unstructured":"Dimitri P. Bertsekas . 2016. Nonlinear Programming . Athena Scientific . Dimitri P. Bertsekas. 2016. Nonlinear Programming. Athena Scientific."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13243"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/775492.775496"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566589"},{"key":"e_1_2_2_9_1","volume-title":"MIPS: An efficient global parametrization method. Technical Report.","author":"Hormann Kai","year":"2000","unstructured":"Kai Hormann and G\u00fcnther Greiner . 2000 . MIPS: An efficient global parametrization method. Technical Report. Kai Hormann and G\u00fcnther Greiner. 2000. MIPS: An efficient global parametrization method. Technical Report."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281500.1281510"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Alec Jacobson Daniele Panozzo and others. 2017. libigl: A simple C++ geometry processing library. (2017). http:\/\/libigl.github.io\/libigl\/.  Alec Jacobson Daniele Panozzo and others. 2017. libigl: A simple C++ geometry processing library. (2017). http:\/\/libigl.github.io\/libigl\/.","DOI":"10.1145\/3134472.3134497"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130800.3130895"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2005.00883.x"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138450.1138461"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566590"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130800.3130897"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461970"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2014.53"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/130908737"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130800.3130845"},{"key":"e_1_2_2_21_1","volume-title":"On Search Directions for Minimization Algorithms. Mathematical Programming 4","author":"Powell M.J.D.","year":"1973","unstructured":"M.J.D. Powell . 1973. On Search Directions for Minimization Algorithms. Mathematical Programming 4 ( 1973 ). M.J.D. Powell. 1973. On Search Directions for Minimization Algorithms. Mathematical Programming 4 (1973)."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983621"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183287.1183297"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2010.01746.x"},{"key":"e_1_2_2_25_1","volume-title":"Intel threading building blocks: outfitting C++ for multi-core processor parallelism. \" O'Reilly Media","author":"Reinders James","unstructured":"James Reinders . 2007. Intel threading building blocks: outfitting C++ for multi-core processor parallelism. \" O'Reilly Media , Inc .\". James Reinders. 2007. Intel threading building blocks: outfitting C++ for multi-core processor parallelism. \" O'Reilly Media, Inc.\"."},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383307"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132705"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/602099.602144"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061347.1061354"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1561\/0600000011"},{"key":"e_1_2_2_31_1","volume-title":"Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied computational geometry towards geometric engineering","author":"Shewchuk Jonathan Richard","year":"1996","unstructured":"Jonathan Richard Shewchuk . 1996 . Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied computational geometry towards geometric engineering . Springer , 203--222. Jonathan Richard Shewchuk. 1996. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied computational geometry towards geometric engineering. Springer, 203--222."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3072959.3073618"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766947"},{"key":"e_1_2_2_34_1","unstructured":"John Snyder Pedro V Sander Zoe J Wood Steven Gortler and Hugues Hoppe. 2003. Multi-chart geometry images. (2003).  John Snyder Pedro V Sander Zoe J Wood Steven Gortler and Hugues Hoppe. 2003. Multi-chart geometry images. (2003)."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/602099.602154"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073368.1073394"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-13.1.743"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3272127.3275042","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3272127.3275042","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3272127.3275042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:04Z","timestamp":1750207444000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3272127.3275042"}},"subtitle":["joint optimization of surface cuts and parameterization"],"short-title":[],"issued":{"date-parts":[[2018,12,4]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12,31]]}},"alternative-id":["10.1145\/3272127.3275042"],"URL":"https:\/\/doi.org\/10.1145\/3272127.3275042","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,4]]},"assertion":[{"value":"2018-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}