{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T10:00:03Z","timestamp":1790676003813,"version":"4.1.0"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T00:00:00Z","timestamp":1478822400000},"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":[[2016,11,11]]},"abstract":"<jats:p>\n            We present a novel method, called\n            <jats:italic>Simplex Assembly<\/jats:italic>\n            , to compute inversion-free mappings with low or bounded distortion on simplicial meshes. Our method involves two steps: simplex disassembly and simplex assembly. Given a simplicial mesh and its initial piecewise affine mapping, we project the affine transformation associated with each simplex into the inversion-free and distortion-bounded space. The projection disassembles the input mesh into disjoint simplices. The disjoint simplices are then assembled to recover the original connectivity by minimizing the mapping distortion and the difference of the disjoint vertices with respect to the piecewise affine transformations, while the piecewise affine mapping is restricted inside the feasible space. Due to the use of affine transformations as variables, our method explicitly guarantees that no inverted simplex occurs, and that the mapping distortion is below the bound during the optimization. Compared with existing methods, our method is robust to an initialization with many inverted elements and positional constraints. We demonstrate the efficiency and robustness of our method through a variety of geometric processing tasks.\n          <\/jats:p>","DOI":"10.1145\/2980179.2980231","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T17:02:54Z","timestamp":1478883774000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":66,"title":["Computing inversion-free mappings by simplex assembly"],"prefix":"10.1145","volume":"35","author":[{"given":"Xiao-Ming","family":"Fu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China and Microsoft Research Asia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,12,5]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461931"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2008.01142.x"},{"key":"e_1_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Botsch M. Kobbelt L. Pauly M. Alliez P. and L\u00e9vy B. 2010. Polygon Mesh Processing. A K Peters\/CRC Press.  Botsch M. Kobbelt L. Pauly M. Alliez P. and L\u00e9vy B. 2010. Polygon Mesh Processing. A K Peters\/CRC Press.","DOI":"10.1201\/b10688"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778775"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766989"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964999"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461986"},{"key":"e_1_2_2_8_1","unstructured":"Degener P. Meseth J. and Klein R. 2003. An adaptable surface parameterization method. In Int. Meshing Roundtable 201--213.  Degener P. Meseth J. and Klein R. 2003. An adaptable surface parameterization method. In Int. Meshing Roundtable 201--213."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766906"},{"key":"e_1_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Floater M. S. and Hormann K. 2005. Surface parameterization: a tutorial and survey. In In Advances in Multiresolution for Geometric Modelling Springer 157--186.  Floater M. S. and Hormann K. 2005. Surface parameterization: a tutorial and survey. In In Advances in Multiresolution for Geometric Modelling Springer 157--186.","DOI":"10.1007\/3-540-26808-1_9"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-02-01466-7"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766938"},{"key":"e_1_2_2_13_1","unstructured":"Guennebaud G. Jacob B. etal 2010. Eigen v3. http:\/\/eigen.tuxfamily.org.  Guennebaud G. Jacob B. et al. 2010. Eigen v3. http:\/\/eigen.tuxfamily.org."},{"key":"e_1_2_2_14_1","volume-title":"MIPS: An efficient global parametrization method. In Curve and Surface Design: Saint-Malo","author":"Hormann K.","year":"2000","unstructured":"Hormann , K. , and Greiner , G . 2000 . MIPS: An efficient global parametrization method. In Curve and Surface Design: Saint-Malo 1999. Vanderbilt University Press , 153--162. Hormann, K., and Greiner, G. 2000. MIPS: An efficient global parametrization method. In Curve and Surface Design: Saint-Malo 1999. Vanderbilt University Press, 153--162."},{"key":"e_1_2_2_15_1","volume-title":"Minimal Networks: The Steiner Problem and Its Generalizations","author":"Ivanov A. O.","year":"1994","unstructured":"Ivanov , A. O. , and Tuzhilin , A. A . 1994 . Minimal Networks: The Steiner Problem and Its Generalizations . CRC Press . Ivanov, A. O., and Tuzhilin, A. A. 1994. Minimal Networks: The Steiner Problem and Its Generalizations. CRC Press."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12452"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601142"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818098"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661229.2661258"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566590"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185604"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/130939754"},{"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.1111\/cgf.12806"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601154"},{"key":"e_1_2_2_26_1","unstructured":"Nocedal J. and Wright S. 2006. Numerical Optimization 2nd ed. Springer.  Nocedal J. and Wright S. 2006. Numerical Optimization 2nd ed. Springer."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766900"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601123"},{"key":"e_1_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Rabinovich M. Poranne R. Panozzo D. and Sorkine-Hornung O. 2016. Scalable locally injective maps. Tech. rep. ETH.  Rabinovich M. Poranne R. Panozzo D. and Sorkine-Hornung O. 2016. Scalable locally injective maps. Tech. rep. ETH.","DOI":"10.1145\/3072959.3126782"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12179"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00013391"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061347.1061354"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766947"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360676"},{"key":"e_1_2_2_35_1","first-page":"747","article-title":"How to draw a graph","volume":"13","author":"Tutte W. T.","year":"1963","unstructured":"Tutte , W. T. 1963 . How to draw a graph . In Proceedings of the London Mathematical Society , vol. 13 , 747 -- 767 . Tutte, W. T. 1963. How to draw a graph. In Proceedings of the London Mathematical Society, vol. 13, 747--767.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601227"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03173.x"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2011.07.001"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015774"},{"key":"e_1_2_2_40_1","volume-title":"Proc., 135--141","author":"Zayer R.","unstructured":"Zayer , R. , L\u00e9vy , B. , and Seidel , H . -P. 2007. Linear angle based parameterization. In Symp. Geom . Proc., 135--141 . Zayer, R., L\u00e9vy, B., and Seidel, H.-P. 2007. Linear angle based parameterization. In Symp. Geom. Proc., 135--141."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2980179.2980231","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2980179.2980231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:49:57Z","timestamp":1750218597000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2980179.2980231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,11]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11,11]]}},"alternative-id":["10.1145\/2980179.2980231"],"URL":"https:\/\/doi.org\/10.1145\/2980179.2980231","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,11]]},"assertion":[{"value":"2016-12-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}