{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:57:33Z","timestamp":1771700253185,"version":"3.50.1"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2014,11,19]],"date-time":"2014-11-19T00:00:00Z","timestamp":1416355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2014,11,19]]},"abstract":"<jats:p>We introduce the idea of<jats:italic>strict minimizers<\/jats:italic>for geometric distortion measures used in shape interpolation, deformation, parametrization, and other applications involving geometric mappings. The<jats:italic>L<\/jats:italic><jats:sub>\u221e<\/jats:sub>-norm ensures the tightest possible control on the worst-case distortion. Unfortunately, it does not yield a unique solution and does not distinguish between solutions with high or low distortion below the maximum. The strict minimizer is a minimal<jats:italic>L<\/jats:italic><jats:sub>\u221e<\/jats:sub>-norm solution, which always prioritizes higher distortion reduction. We propose practical algorithms for computing strict minimizers. We also offer an efficient algorithm for<jats:italic>L<\/jats:italic><jats:sub>\u221e<\/jats:sub>optimization based on the ARAP energy. This algorithm can be used on its own or as a building block for an ARAP strict minimizer. We demonstrate that these algorithms lead to significant improvements in quality.<\/jats:p>","DOI":"10.1145\/2661229.2661258","type":"journal-article","created":{"date-parts":[[2014,11,18]],"date-time":"2014-11-18T14:21:03Z","timestamp":1416320463000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Strict minimizers for geometric optimization"],"prefix":"10.1145","volume":"33","author":[{"given":"Zohar","family":"Levi","sequence":"first","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Zorin","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,11,19]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Abdelmalek N. N. 1977. Computing the strict Chebyshev solution of overdetermined linear equations. Mathematics of Computation 31 140 974--983. Abdelmalek N. N. 1977. Computing the strict Chebyshev solution of overdetermined linear equations. Mathematics of Computation 31 140 974--983.","DOI":"10.1090\/S0025-5718-1977-0445803-8"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461931"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344859"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0349-3"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(81)90349-0"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2008.01142.x"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531383"},{"key":"e_1_2_2_8_1","unstructured":"Bommes D. L\u00e9vy B. Pietroni N. Puppo E. Silva C. Tarini M. and Zorin D. 2012. State of the art in quad meshing. In Eurographics STARS. Bommes D. L\u00e9vy B. Pietroni N. Puppo E. Silva C. Tarini M. and Zorin D. 2012. State of the art in quad meshing. In Eurographics STARS ."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2462014"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778775"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461983"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00580"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0111074"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/14.3.276"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-012-4574-y"},{"key":"e_1_2_2_16_1","first-page":"153","article-title":"MIPS: An efficient global parameterization method","volume":"2000","author":"Hormann K.","year":"1999","journal-title":"Curve and Surface Design: Saint-Malo"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01060.x"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138450.1138461"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90093-3"},{"key":"e_1_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Levi Z. and Gotsman C. 2015. Smooth rotation enhanced as-rigid-as-possible mesh animation. TVCG. Levi Z. and Gotsman C. 2015. Smooth rotation enhanced as-rigid-as-possible mesh animation. TVCG .","DOI":"10.1109\/TVCG.2014.2359463"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566590"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185604"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1731309.1731336"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(86)90012-X"},{"key":"e_1_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Marano M. 1990. Strict approximation on closed convex sets. Approximation Theory and its Applications 6 1 99--109. Marano M. 1990. Strict approximation on closed convex sets. Approximation Theory and its Applications 6 1 99--109.","DOI":"10.1007\/BF02836199"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90347-C"},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"M\u00e9moli F. Sapiro G. and Thompson P. 2006. Geometric surface and brain warping via geodesic minimizing lipschitz extensions. In MFCA 58--67. M\u00e9moli F. Sapiro G. and Thompson P. 2006. Geometric surface and brain warping via geodesic minimizing lipschitz extensions. In MFCA 58--67.","DOI":"10.21236\/ADA478383"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185605"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461970"},{"key":"e_1_2_2_30_1","volume-title":"International Network Optimization Conference (INOC).","author":"Ogryczak W."},{"key":"e_1_2_2_31_1","first-page":"840","article-title":"Sur un algorithme toujours convergent pour obtenir les polyn\u00f4mes de meilleure approximation de tchebycheff pour une function continue quelconque. CR","volume":"157","author":"P\u00f3lya G.","year":"1913","journal-title":"Acad. Sci. Par\u00eds"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183287.1183297"},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Rice J. R. and Usow K. H. 1968. The lawson algorithm and extensions. Mathematics of Computation 22 101 118--127. Rice J. R. and Usow K. H. 1968. The lawson algorithm and extensions. Mathematics of Computation 22 101 118--127.","DOI":"10.1090\/S0025-5718-1968-0232137-4"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1962-10822-2"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1963-0157165-0"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12179"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00013391"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.02028.x"},{"key":"e_1_2_2_39_1","volume-title":"Symposium on Geometry processing","volume":"4","author":"Sorkine O."},{"key":"e_1_2_2_40_1","volume-title":"Proc. IEEE Visualization '02","author":"Sorkine O."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360676"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03173.x"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2661229.2661258","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2661229.2661258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:05Z","timestamp":1750227185000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2661229.2661258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,19]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,11,19]]}},"alternative-id":["10.1145\/2661229.2661258"],"URL":"https:\/\/doi.org\/10.1145\/2661229.2661258","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,19]]},"assertion":[{"value":"2014-11-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}