{"citation":{"ieee":"M. Campen, C. T. Silva, and D. Zorin, “Bijective maps from simplicial foliations,” ACM Transactions on Graphics, vol. 35, no. 4, pp. 1–15, 2016, doi: 10.1145/2897824.2925890.","bibtex":"@article{Campen_Silva_Zorin_2016, title={Bijective maps from simplicial foliations}, volume={35}, DOI={10.1145/2897824.2925890}, number={4}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Campen, Marcel and Silva, Cláudio T. and Zorin, Denis}, year={2016}, pages={1–15} }","chicago":"Campen, Marcel, Cláudio T. Silva, and Denis Zorin. “Bijective Maps from Simplicial Foliations.” ACM Transactions on Graphics 35, no. 4 (2016): 1–15. https://doi.org/10.1145/2897824.2925890.","ama":"Campen M, Silva CT, Zorin D. Bijective maps from simplicial foliations. ACM Transactions on Graphics. 2016;35(4):1-15. doi:10.1145/2897824.2925890","short":"M. Campen, C.T. Silva, D. Zorin, ACM Transactions on Graphics 35 (2016) 1–15.","apa":"Campen, M., Silva, C. T., & Zorin, D. (2016). Bijective maps from simplicial foliations. ACM Transactions on Graphics, 35(4), 1–15. https://doi.org/10.1145/2897824.2925890","mla":"Campen, Marcel, et al. “Bijective Maps from Simplicial Foliations.” ACM Transactions on Graphics, vol. 35, no. 4, Association for Computing Machinery (ACM), 2016, pp. 1–15, doi:10.1145/2897824.2925890."},"issue":"4","publication_identifier":{"issn":["0730-0301","1557-7368"]},"abstract":[{"text":"This paper presents a method for bijective parametrization of 2D and 3D objects over canonical domains. While a range of solutions for the two-dimensional case are well-known, our method guarantees bijectivity of mappings also for a large, combinatorially-defined class of tetrahedral meshes (shellable meshes). The key concept in our method is the piecewise-linear (PL) foliation, decomposing the mesh into one-dimensional submanifolds and reducing the mapping problem to parametrization of a lower-dimensional manifold (a foliation section). The maps resulting from these foliations are proved to be bijective and continuous, and shown to have provably bijective PL approximations. We describe exact, numerically robust evaluation methods and demonstrate our implementation's capabilities on a large variety of meshes.","lang":"eng"}],"doi":"10.1145/2897824.2925890","extern":"1","date_created":"2025-06-27T07:52:32Z","department":[{"_id":"969"}],"author":[{"first_name":"Marcel","full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","id":"114904","last_name":"Campen"},{"last_name":"Silva","full_name":"Silva, Cláudio T.","first_name":"Cláudio T."},{"last_name":"Zorin","first_name":"Denis","full_name":"Zorin, Denis"}],"language":[{"iso":"eng"}],"date_updated":"2025-07-14T12:41:57Z","year":"2016","title":"Bijective maps from simplicial foliations","type":"journal_article","status":"public","_id":"60436","volume":35,"page":"1-15","intvolume":" 35","user_id":"117512","publication_status":"published","publication":"ACM Transactions on Graphics","publisher":"Association for Computing Machinery (ACM)"}