[{"article_type":"original","article_number":"e15269","day":"01","scopus_import":"1","author":[{"full_name":"Bhargava, Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","first_name":"Manas","last_name":"Bhargava","orcid":"0009-0007-6138-6890"},{"last_name":"Schreck","first_name":"Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87","full_name":"Schreck, Camille"},{"full_name":"Freire, M.","last_name":"Freire","first_name":"M."},{"last_name":"Hugron","first_name":"P. A.","full_name":"Hugron, P. A."},{"full_name":"Lefebvre, S.","last_name":"Lefebvre","first_name":"S."},{"full_name":"Sellán, S.","last_name":"Sellán","first_name":"S."},{"first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"year":"2025","doi":"10.1111/cgf.15269","title":"Mesh simplification for unfolding","month":"02","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20276"}]},"ddc":["006"],"type":"journal_article","keyword":["fabrication","single patch unfolding","mesh simplification"],"oa":1,"file":[{"success":1,"file_name":"Mesh_Simplification_For_Unfolding_cgf_submission_supplemental_video.mp4","content_type":"video/mp4","date_created":"2024-11-19T09:23:20Z","file_id":"18567","checksum":"34acdd9bfbe43f00eb6c7656afef3ac6","file_size":36999751,"creator":"mbhargav","access_level":"open_access","date_updated":"2024-11-19T09:23:20Z","relation":"main_file"},{"success":1,"content_type":"application/pdf","date_created":"2025-04-16T09:06:45Z","file_name":"2025_CompGraphicsForum_Bhargava.pdf","file_id":"19576","file_size":5188265,"checksum":"efb06b01bae37f470954601bc004374d","date_updated":"2025-04-16T09:06:45Z","access_level":"open_access","creator":"dernst","relation":"main_file"}],"date_created":"2024-11-19T09:14:32Z","abstract":[{"text":"We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing for map distortions or multiple patches. Instead, we propose a geometric relaxation of the problem: We modify the input shape until it admits an overlap‐free unfolding. We achieve this by locally displacing vertices and collapsing edges, guided by the unfolding process. We validate our algorithm quantitatively and qualitatively on a large dataset of complex shapes and show its proficiency by fabricating real shapes from paper.","lang":"eng"}],"status":"public","arxiv":1,"quality_controlled":"1","corr_author":"1","OA_place":"publisher","language":[{"iso":"eng"}],"OA_type":"hybrid","has_accepted_license":"1","citation":{"apa":"Bhargava, M., Schreck, C., Freire, M., Hugron, P. A., Lefebvre, S., Sellán, S., &#38; Bickel, B. (2025). Mesh simplification for unfolding. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.15269\">https://doi.org/10.1111/cgf.15269</a>","mla":"Bhargava, Manas, et al. “Mesh Simplification for Unfolding.” <i>Computer Graphics Forum</i>, vol. 44, no. 1, e15269, Wiley, 2025, doi:<a href=\"https://doi.org/10.1111/cgf.15269\">10.1111/cgf.15269</a>.","ama":"Bhargava M, Schreck C, Freire M, et al. Mesh simplification for unfolding. <i>Computer Graphics Forum</i>. 2025;44(1). doi:<a href=\"https://doi.org/10.1111/cgf.15269\">10.1111/cgf.15269</a>","short":"M. Bhargava, C. Schreck, M. Freire, P.A. Hugron, S. Lefebvre, S. Sellán, B. Bickel, Computer Graphics Forum 44 (2025).","ista":"Bhargava M, Schreck C, Freire M, Hugron PA, Lefebvre S, Sellán S, Bickel B. 2025. Mesh simplification for unfolding. Computer Graphics Forum. 44(1), e15269.","chicago":"Bhargava, Manas, Camille Schreck, M. Freire, P. A. Hugron, S. Lefebvre, S. Sellán, and Bernd Bickel. “Mesh Simplification for Unfolding.” <i>Computer Graphics Forum</i>. Wiley, 2025. <a href=\"https://doi.org/10.1111/cgf.15269\">https://doi.org/10.1111/cgf.15269</a>.","ieee":"M. Bhargava <i>et al.</i>, “Mesh simplification for unfolding,” <i>Computer Graphics Forum</i>, vol. 44, no. 1. Wiley, 2025."},"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"department":[{"_id":"GradSch"},{"_id":"BeBi"}],"external_id":{"arxiv":["2408.06944"],"isi":["001357046100001"]},"_id":"18565","date_updated":"2026-04-07T11:50:09Z","article_processing_charge":"Yes (via OA deal)","issue":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"acknowledgement":"Researchers from INRIA received support from the DORNELL Inria Challenge. Silvia Sellán acknowledges support from NSERC Vanier Doctoral Scholarship and an MIT SoE Postdoctoral Fellowship for Engineering Excellence.","isi":1,"file_date_updated":"2025-04-16T09:06:45Z","intvolume":"        44","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Computer Graphics Forum","license":"https://creativecommons.org/licenses/by-nc/4.0/","volume":44,"date_published":"2025-02-01T00:00:00Z","oa_version":"Published Version","publication_status":"published","publisher":"Wiley"}]