[{"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"publication_status":"inpress","day":"01","doi":"10.1145/3811353","corr_author":"1","month":"07","language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Accepted Version","acknowledged_ssus":[{"_id":"ScienComp"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"citation":{"ama":"Kalinov A, Ly M, Hafner C, Wojtan C. Physics-inspired procedural texturing of extremely deformable surfaces. <i>ACM Transactions on Graphics</i>. 45(4). doi:<a href=\"https://doi.org/10.1145/3811353\">10.1145/3811353</a>","apa":"Kalinov, A., Ly, M., Hafner, C., &#38; Wojtan, C. (n.d.). Physics-inspired procedural texturing of extremely deformable surfaces. <i>ACM Transactions on Graphics</i>. Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3811353\">https://doi.org/10.1145/3811353</a>","ieee":"A. Kalinov, M. Ly, C. Hafner, and C. Wojtan, “Physics-inspired procedural texturing of extremely deformable surfaces,” <i>ACM Transactions on Graphics</i>, vol. 45, no. 4. ACM.","ista":"Kalinov A, Ly M, Hafner C, Wojtan C. Physics-inspired procedural texturing of extremely deformable surfaces. ACM Transactions on Graphics. 45(4), 154.","chicago":"Kalinov, Aleksei, Mickaël Ly, Christian Hafner, and Chris Wojtan. “Physics-Inspired Procedural Texturing of Extremely Deformable Surfaces.” <i>ACM Transactions on Graphics</i>. ACM, n.d. <a href=\"https://doi.org/10.1145/3811353\">https://doi.org/10.1145/3811353</a>.","mla":"Kalinov, Aleksei, et al. “Physics-Inspired Procedural Texturing of Extremely Deformable Surfaces.” <i>ACM Transactions on Graphics</i>, vol. 45, no. 4, 154, ACM, doi:<a href=\"https://doi.org/10.1145/3811353\">10.1145/3811353</a>.","short":"A. Kalinov, M. Ly, C. Hafner, C. Wojtan, ACM Transactions on Graphics 45 (n.d.)."},"file":[{"access_level":"open_access","success":1,"content_type":"video/mp4","checksum":"ea165bf731ddd3045f83878dcb833672","relation":"main_file","date_created":"2026-05-29T13:19:33Z","file_id":"21924","file_name":"tog454-article154-supplemental.mp4","date_updated":"2026-05-29T13:19:33Z","creator":"akalinov","file_size":77337231},{"date_updated":"2026-05-29T13:19:37Z","file_size":226633977,"creator":"akalinov","date_created":"2026-05-29T13:19:37Z","file_id":"21925","file_name":"tog454-article154-video.mp4","content_type":"video/mp4","relation":"main_file","checksum":"6274cfb15ea5ba7324b74afc7b0d9629","success":1,"access_level":"open_access"},{"file_id":"21926","date_created":"2026-05-29T13:19:33Z","file_name":"tog454-article154-supplemental.pdf","date_updated":"2026-05-29T13:19:33Z","file_size":6793867,"creator":"akalinov","success":1,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"9d41b322a7876be9a3311017b9973183"},{"date_created":"2026-05-29T13:19:36Z","file_id":"21927","file_name":"tog454-article154-main-1.pdf","date_updated":"2026-05-29T13:19:36Z","creator":"akalinov","file_size":84173392,"access_level":"open_access","success":1,"content_type":"application/pdf","checksum":"51bc60d2de867fbfa570652dec7993b4","relation":"main_file"}],"status":"public","acknowledgement":"We thank the anonymous reviewers for their helpful comments, the members of the Visual Computing Group at ISTA for their feedback. We also thank Jonathan Gagnon for their help with running the Lapped Textures codes and SideFX for the Houdini Education software licenses.\r\nImages in Fig. 2 by Kisoulou and Vultured on Unsplash, Michal Jarmoluk and Public Domain Pictures from Pixabay and Hawai‘i Volcanoes NPS on flickr. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing and was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Physics-inspired procedural texturing of extremely deformable surfaces","OA_type":"hybrid","article_type":"original","OA_place":"publisher","has_accepted_license":"1","oa":1,"keyword":["Procedural animation"],"conference":{"start_date":"2026-07-19","name":"SIGGRAPH: International Conference and Exhibition on Computer Graphics and Interactive Techniques","end_date":"2026-07-23","location":"Los Angeles, CA, United States"},"publication":"ACM Transactions on Graphics","date_created":"2026-05-29T13:25:16Z","publication_identifier":{"issn":["0730-0301"]},"abstract":[{"text":"The appearance of simulated natural phenomena heavily depends on the way surfaces are textured. However, applying texture maps to dynamic deformable surfaces presents a significant challenge, due to ever-shifting differences in length scales involved. When these surfaces move and advect the texture along with them, their final appearance degrades as deformed regions dramatically distort their texture map. Modifications to the texture directly at the pixel level in response to the deformation may introduce ghosting artifacts and look unnatural. In the real world, the appearance of surface details on a deforming material changes through the interplay of physical processes such as rupturing, exposure of internal structure, or wrinkling. Motivated by these behaviors, in this work we explore how physical principles can guide the texturing methods based on the measure of surface deformation.\r\nWe present two novel wave-based procedural texturing algorithms which reproduce common physical properties like advection and self-similarity, enabling the plausible animation of deforming objects with extreme texture map distortions. Our algorithms are fully procedural, require no actual physics simulation, and store no state or history of deformation besides the input UV map, making them highly parallelizable on the GPU and efficient enough for real-time applications. We show the versatility of the method by animating physical phenomena with extreme deformations such as flowing lava, stretching putty and outpouring sludge.","lang":"eng"}],"type":"journal_article","date_updated":"2026-06-02T08:56:50Z","file_date_updated":"2026-05-29T13:19:37Z","date_published":"2026-07-01T00:00:00Z","article_processing_charge":"Yes","ddc":["006"],"project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"}],"publisher":"ACM","year":"2026","article_number":"154","_id":"21923","issue":"4","author":[{"full_name":"Kalinov, Aleksei","id":"44b7120e-eb97-11eb-a6c2-e1557aa81d02","last_name":"Kalinov","orcid":"0000-0003-2189-3904","first_name":"Aleksei"},{"id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","full_name":"Ly, Mickaël","last_name":"Ly","first_name":"Mickaël"},{"last_name":"Hafner","full_name":"Hafner, Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        45","volume":45},{"file_date_updated":"2025-11-10T14:10:53Z","license":"https://creativecommons.org/licenses/by-nd/4.0/","type":"journal_article","date_updated":"2025-12-09T14:53:32Z","abstract":[{"lang":"eng","text":"The realistic simulation of sand, soil, powders, rubble piles, and large collections of rigid bodies is a common and important problem in the fields of computer graphics, computational physics, and engineering. Direct simulation of these individual bodies quickly becomes expensive, so we often approximate the entire group as a continuum material that can be more easily computed using tools for solving partial differential equations, like the material point method (MPM). In this paper, we present a method for automatically extracting continuum material properties from a collection of rigid\r\nbodies. We use numerical homogenization with periodic boundary conditions to simulate an effectively infinite number of rigid bodies in contact. We then record the effective stress-strain relationships from these simulations and convert them into elastic properties and yield criteria for the continuum simulations. Our experiments validate existing theoretical models like the Mohr-Coulomb yield surface by extracting material behaviors from a collection of spheres in contact. We further generalize these existing models to more exotic materials derived from diverse and non-convex shapes. We\r\nobserve complicated jamming behaviors from non-convex grains, and we introduce a new material model for materials with extremely high levels of internal friction and cohesion. We simulate these new continuum models using MPM with an improved return mapping technique. The end result is a complete system for turning an input rigid body simulation into an efficient continuum simulation with the same effective mechanical properties."}],"date_created":"2025-11-10T14:12:06Z","publication":"ACM Transactions on Graphics","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"conference":{"start_date":"2025-12-15","name":"SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia","end_date":"2025-12-18","location":"Hong Kong, China"},"has_accepted_license":"1","oa":1,"article_type":"original","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Numerical homogenization of sand from grain-level simulations","OA_type":"hybrid","acknowledgement":"We thank the anonymous reviewers for their helpful comments, the members of the Visual Computing Group at ISTA for their feedback and Gauthier Rousseau for the insightful discussions. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing and was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA). ","scopus_import":"1","status":"public","tmp":{"image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"file":[{"date_updated":"2025-11-10T14:10:12Z","file_size":61708650,"creator":"yichen","file_id":"20629","date_created":"2025-11-10T14:10:12Z","file_name":"main_paper.pdf","content_type":"application/pdf","relation":"main_file","checksum":"4d30ff82314e76fe411c8f8195bb6040","success":1,"access_level":"open_access"},{"date_created":"2025-11-10T14:10:27Z","file_id":"20630","file_name":"paper_supplemental.pdf","date_updated":"2025-11-10T14:10:27Z","file_size":6862285,"creator":"yichen","access_level":"open_access","content_type":"application/pdf","relation":"supplementary_material","checksum":"f1b6df39487866044ca7ca899d044be7"},{"relation":"supplementary_material","checksum":"04ec2a4866774673479cafe5b93d26bd","content_type":"video/mp4","access_level":"open_access","file_size":164079303,"creator":"yichen","date_updated":"2025-11-10T14:10:44Z","file_name":"main_video.mp4","date_created":"2025-11-10T14:10:44Z","file_id":"20631"},{"checksum":"7495e8cbcf94eb49276b4730c5886914","relation":"supplementary_material","content_type":"video/mp4","access_level":"open_access","creator":"yichen","file_size":72234678,"date_updated":"2025-11-10T14:10:53Z","file_name":"extra_video.mp4","date_created":"2025-11-10T14:10:53Z","file_id":"20632"}],"citation":{"chicago":"Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. “Numerical Homogenization of Sand from Grain-Level Simulations.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3763344\">https://doi.org/10.1145/3763344</a>.","mla":"Chen, Yi-Lu, et al. “Numerical Homogenization of Sand from Grain-Level Simulations.” <i>ACM Transactions on Graphics</i>, vol. 44, no. 6, 220, Association for Computing Machinery, 2025, doi:<a href=\"https://doi.org/10.1145/3763344\">10.1145/3763344</a>.","short":"Y.-L. Chen, M. Ly, C. Wojtan, ACM Transactions on Graphics 44 (2025).","ista":"Chen Y-L, Ly M, Wojtan C. 2025. Numerical homogenization of sand from grain-level simulations. ACM Transactions on Graphics. 44(6), 220.","ieee":"Y.-L. Chen, M. Ly, and C. Wojtan, “Numerical homogenization of sand from grain-level simulations,” <i>ACM Transactions on Graphics</i>, vol. 44, no. 6. Association for Computing Machinery, 2025.","apa":"Chen, Y.-L., Ly, M., &#38; Wojtan, C. (2025). Numerical homogenization of sand from grain-level simulations. <i>ACM Transactions on Graphics</i>. Hong Kong, China: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3763344\">https://doi.org/10.1145/3763344</a>","ama":"Chen Y-L, Ly M, Wojtan C. Numerical homogenization of sand from grain-level simulations. <i>ACM Transactions on Graphics</i>. 2025;44(6). doi:<a href=\"https://doi.org/10.1145/3763344\">10.1145/3763344</a>"},"language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Published Version","corr_author":"1","month":"12","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"publication_status":"published","day":"04","doi":"10.1145/3763344","volume":44,"intvolume":"        44","author":[{"orcid":"0009-0005-0723-0655","first_name":"Yi-Lu","full_name":"Chen, Yi-Lu","id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","last_name":"Chen"},{"first_name":"Mickaël","full_name":"Ly, Mickaël","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","last_name":"Ly"},{"orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"issue":"6","_id":"20628","year":"2025","article_number":"220","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"publisher":"Association for Computing Machinery","ddc":["531","006","621"],"article_processing_charge":"Yes (via OA deal)","date_published":"2025-12-04T00:00:00Z"},{"type":"journal_article","date_updated":"2025-09-08T08:29:09Z","file_date_updated":"2024-07-17T09:29:13Z","date_created":"2024-07-05T12:08:57Z","publication":"Transactions on Graphics","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"abstract":[{"lang":"eng","text":"The behavior of a rigid body primarily depends on its mass moments, which consist of the mass, center of mass, and moments of inertia. It is possible to manipulate these quantities without altering the geometric appearance of an object by introducing cavities in its interior. Algorithms that find cavities of suitable shapes and sizes have enabled the computational design of spinning tops, yo-yos, wheels, buoys, and statically balanced objects. Previous work is based, for example, on topology optimization on voxel grids, which introduces a large number of optimization variables and box constraints, or offset surface computation, which cannot guarantee that solutions to a feasible problem will always be found.\r\n\r\nIn this work, we provide a mathematical analysis of constrained topology optimization problems that depend only on mass moments. This class of problems covers, among others, all applications mentioned above. Our main result is to show that no matter the outer shape of the rigid body to be optimized or the optimization objective and constraints considered, the optimal solution always features a quadric-shaped interface between material and cavities. This proves that optimal interfaces are always ellipsoids, hyperboloids, paraboloids, or one of a few degenerate cases, such as planes.\r\n\r\nThis insight lets us replace a difficult topology optimization problem with a provably equivalent non-linear equation system in a small number (<10) of variables, which represent the coefficients of the quadric. This system can be solved in a few seconds for most examples, provides insights into the geometric structure of many specific applications, and lets us describe their solution properties. Finally, our method integrates seamlessly into modern fabrication workflows because our solutions are analytical surfaces that are native to the CAD domain."}],"has_accepted_license":"1","oa":1,"keyword":["Topology Optimization","Mass Moments","Computational Geometry"],"conference":{"start_date":"2024-07-28","location":"Denver, Colorado","end_date":"2024-08-01"},"title":"Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","scopus_import":"1","acknowledgement":"We thank Gianmarco Cherchi for his help in tailoring the Mesh Booleans code for this project, Stefan Jeschke for his help with the photographs, Malina Strugaru and Aleksei Kalinov for their help with the samples, and the anonymous reviewers as well as the members of the ISTA Visual Computing Group for their feedback. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).","citation":{"chicago":"Hafner, Christian, Mickaël Ly, and Chris Wojtan. “Spin-It Faster: Quadrics Solve All Topology Optimization Problems That Depend Only on Mass Moments.” <i>Transactions on Graphics</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3658194\">https://doi.org/10.1145/3658194</a>.","short":"C. Hafner, M. Ly, C. Wojtan, Transactions on Graphics 43 (2024).","mla":"Hafner, Christian, et al. “Spin-It Faster: Quadrics Solve All Topology Optimization Problems That Depend Only on Mass Moments.” <i>Transactions on Graphics</i>, vol. 43, no. 4, 78, Association for Computing Machinery, 2024, doi:<a href=\"https://doi.org/10.1145/3658194\">10.1145/3658194</a>.","ista":"Hafner C, Ly M, Wojtan C. 2024. Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments. Transactions on Graphics. 43(4), 78.","ieee":"C. Hafner, M. Ly, and C. Wojtan, “Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments,” <i>Transactions on Graphics</i>, vol. 43, no. 4. Association for Computing Machinery, 2024.","ama":"Hafner C, Ly M, Wojtan C. Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments. <i>Transactions on Graphics</i>. 2024;43(4). doi:<a href=\"https://doi.org/10.1145/3658194\">10.1145/3658194</a>","apa":"Hafner, C., Ly, M., &#38; Wojtan, C. (2024). Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments. <i>Transactions on Graphics</i>. Denver, Colorado: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3658194\">https://doi.org/10.1145/3658194</a>"},"file":[{"file_name":"sif-final.pdf","date_created":"2024-07-05T12:05:17Z","file_id":"17204","creator":"chafner","file_size":7225150,"date_updated":"2024-07-05T12:05:17Z","access_level":"open_access","success":1,"checksum":"0dc9f5a6422b8a49a79026900f349ee5","relation":"main_file","content_type":"application/pdf"},{"checksum":"cde433c6a40688d5f1187fb5721f6f94","relation":"supplementary_material","content_type":"application/pdf","access_level":"open_access","creator":"chafner","file_size":397262,"date_updated":"2024-07-05T12:06:03Z","file_name":"sif-supp-final.pdf","file_id":"17205","date_created":"2024-07-05T12:06:03Z"},{"date_updated":"2024-07-17T09:29:13Z","creator":"chafner","file_size":170001305,"date_created":"2024-07-17T09:29:13Z","file_id":"17276","file_name":"sif-video-final.mp4","content_type":"video/mp4","checksum":"c0457a09c2ab9a1c2935c995dcc84907","relation":"supplementary_material","access_level":"open_access","title":"Submission Video"}],"status":"public","oa_version":"Published Version","quality_controlled":"1","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"ChWo"}],"day":"01","doi":"10.1145/3658194","corr_author":"1","month":"07","volume":43,"intvolume":"        43","isi":1,"author":[{"first_name":"Christian","last_name":"Hafner","full_name":"Hafner, Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ly","full_name":"Ly, Mickaël","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","first_name":"Mickaël"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","orcid":"0000-0001-6646-5546","first_name":"Christopher J"}],"issue":"4","_id":"17203","external_id":{"isi":["001289270900045"]},"year":"2024","article_number":"78","ddc":["516"],"project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"}],"publisher":"Association for Computing Machinery","article_processing_charge":"Yes (via OA deal)","date_published":"2024-07-01T00:00:00Z"},{"volume":43,"intvolume":"        43","isi":1,"author":[{"first_name":"Peter","last_name":"Synak","full_name":"Synak, Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kalinov","id":"44b7120e-eb97-11eb-a6c2-e1557aa81d02","full_name":"Kalinov, Aleksei","first_name":"Aleksei","orcid":"0000-0003-2189-3904"},{"full_name":"Strugaru, Irina-Malina","id":"2afc607f-f128-11eb-9611-8f2a0dfcf074","last_name":"Strugaru","first_name":"Irina-Malina"},{"first_name":"Arian","last_name":"Etemadihaghighi","full_name":"Etemadihaghighi, Arian","id":"36cea3aa-f38e-11ec-8ae0-c65ae6f6098f"},{"first_name":"Huidong","last_name":"Yang","full_name":"Yang, Huidong"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546"}],"_id":"17219","issue":"4","external_id":{"isi":["001289270900021"]},"article_number":"54","year":"2024","ddc":["004"],"publisher":"Association for Computing Machinery","project":[{"grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"article_processing_charge":"Yes (via OA deal)","date_published":"2024-07-01T00:00:00Z","date_updated":"2026-04-07T13:02:36Z","type":"journal_article","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","file_date_updated":"2025-11-11T09:50:52Z","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"date_created":"2024-07-10T12:24:00Z","publication":"ACM Transactions on Graphics","abstract":[{"lang":"eng","text":"We introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts self-intersections into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations with thousands of interacting bubbles, and boolean unions of non-manifold meshes consisting of millions of triangles."}],"has_accepted_license":"1","oa":1,"keyword":["surface tracking","topology change","non- manifold meshes","multi-material flows","solid modeling"],"OA_type":"hybrid","title":"Multi-material mesh-based surface tracking with implicit topology changes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","article_type":"original","scopus_import":"1","acknowledgement":"Peter Heiss-Synak helped conceive the project, helped formulate the algorithm structure, contributed ideas and code to Sections 6 & 8, the mesh data structure, algorithm robustness and benchmarks, helped write the paper, and provided supervision and conceptual solutions throughout the project. Aleksei Kalinov contributed ideas and code to Sections 7, 8.5, and 5, the sparse grid data structure, algorithm robustness and benchmarks, optimized the performance, produced all results, most figures, and the supplementary video, helped write the text, and provided conceptual solutions throughout the project. Malina Strugaru helped implement the mesh data structure and designed re-meshing operations for non-manifold triangle meshes. Arian Etemadi developed early prototypes for ideas in Sections 8.1 and 8.3 and helped write the paper. Huidong Yang developed early prototypes for isosurface extraction and visualization. Chris Wojtan helped conceive the project, helped write the paper, and provided supervision, prototype grid data structure code, and conceptual solutions throughout the project. We thank the anonymous reviewers for their helpful comments, the members of the Visual Computing Group at ISTA for their feedback, Christopher Batty for discussions about LosTopos, and SideFX for the Houdini Education software licenses.  This research was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","file":[{"content_type":"application/pdf","relation":"main_file","checksum":"1917067d4b52d7729019b03560004e43","success":1,"access_level":"open_access","date_updated":"2024-07-23T06:35:15Z","file_size":48763368,"creator":"dernst","file_id":"17317","date_created":"2024-07-23T06:35:15Z","file_name":"2024_ACMToG_HeissSynak.pdf"},{"file_id":"17221","date_created":"2024-07-10T12:23:44Z","file_name":"sdtopofixer_final.mp4","date_updated":"2024-07-10T12:23:44Z","creator":"akalinov","file_size":48021463,"access_level":"open_access","success":1,"content_type":"video/mp4","checksum":"a4f0e293184bfa034c0c585848806b17","relation":"main_file"},{"access_level":"open_access","title":"Authors' version of the text","content_type":"application/pdf","checksum":"18fc310a78ec91651148c45a8b89fa44","relation":"preprint","file_id":"20633","date_created":"2025-11-11T09:50:52Z","file_name":"SuperDuperTopoFixer.pdf","date_updated":"2025-11-11T09:50:52Z","creator":"akalinov","file_size":48639581}],"citation":{"apa":"Synak, P., Kalinov, A., Strugaru, I.-M., Etemadi, A., Yang, H., &#38; Wojtan, C. (2024). Multi-material mesh-based surface tracking with implicit topology changes. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3658223\">https://doi.org/10.1145/3658223</a>","ama":"Synak P, Kalinov A, Strugaru I-M, Etemadi A, Yang H, Wojtan C. Multi-material mesh-based surface tracking with implicit topology changes. <i>ACM Transactions on Graphics</i>. 2024;43(4). doi:<a href=\"https://doi.org/10.1145/3658223\">10.1145/3658223</a>","ieee":"P. Synak, A. Kalinov, I.-M. Strugaru, A. Etemadi, H. Yang, and C. Wojtan, “Multi-material mesh-based surface tracking with implicit topology changes,” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4. Association for Computing Machinery, 2024.","ista":"Synak P, Kalinov A, Strugaru I-M, Etemadi A, Yang H, Wojtan C. 2024. Multi-material mesh-based surface tracking with implicit topology changes. ACM Transactions on Graphics. 43(4), 54.","chicago":"Synak, Peter, Aleksei Kalinov, Irina-Malina Strugaru, Arian Etemadi, Huidong Yang, and Chris Wojtan. “Multi-Material Mesh-Based Surface Tracking with Implicit Topology Changes.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3658223\">https://doi.org/10.1145/3658223</a>.","mla":"Synak, Peter, et al. “Multi-Material Mesh-Based Surface Tracking with Implicit Topology Changes.” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4, 54, Association for Computing Machinery, 2024, doi:<a href=\"https://doi.org/10.1145/3658223\">10.1145/3658223</a>.","short":"P. Synak, A. Kalinov, I.-M. Strugaru, A. Etemadi, H. Yang, C. Wojtan, ACM Transactions on Graphics 43 (2024)."},"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Published Version","doi":"10.1145/3658223","day":"01","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"corr_author":"1","month":"07","related_material":{"record":[{"status":"public","id":"19630","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"18301"}]}},{"author":[{"last_name":"Ren","full_name":"Ren, Yingying","id":"93d68d10-3540-11ef-a265-f748a50dba3d","first_name":"Yingying"},{"first_name":"Julian","last_name":"Panetta","full_name":"Panetta, Julian"},{"first_name":"Seiichi","full_name":"Suzuki, Seiichi","last_name":"Suzuki"},{"last_name":"Kusupati","full_name":"Kusupati, Uday","first_name":"Uday"},{"first_name":"Florin","full_name":"Isvoranu, Florin","last_name":"Isvoranu"},{"full_name":"Pauly, Mark","last_name":"Pauly","first_name":"Mark"}],"_id":"17424","extern":"1","issue":"4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Computational homogenization for inverse design of surface-based inflatables","article_type":"original","date_updated":"2024-08-12T10:08:13Z","type":"journal_article","volume":43,"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"publication":"ACM Transactions on Graphics","date_created":"2024-08-12T10:03:38Z","abstract":[{"text":"Surface-based inflatables are composed of two thin layers of nearly inextensible sheet material joined together along carefully selected fusing curves. During inflation, pressure forces separate the two sheets to maximize the enclosed volume. The fusing curves restrict this expansion, leading to a spatially varying in-plane contraction and hence metric frustration. The inflated structure settles into a 3D equilibrium that balances pressure forces with the internal elastic forces of the sheets.\r\nWe present a computational framework for analyzing and designing surface-based inflatable structures with arbitrary fusing patterns. Our approach employs numerical homogenization to characterize the behavior of parametric families of periodic inflatable patch geometries, which can then be combined to tessellate the sheet with smoothly varying patterns. We propose a novel parametrization of the underlying deformation space that allows accurate, efficient, and systematical analysis of the stretching and bending behavior of inflated patches with potentially open boundaries.\r\nWe apply our homogenization algorithm to create a database of geometrically diverse fusing patterns spanning a wide range of material properties and deformation characteristics. This database is employed in an inverse design algorithm that solves for fusing curves to best approximate a given input target surface. Local patches are selected and blended to form a global network of curves based on a geometric flattening algorithm. These fusing curves are then further optimized to minimize the distance of the deployed structure to target surface. We show that this approach offers greater flexibility to approximate given target geometries compared to previous work while significantly improving structural performance.","lang":"eng"}],"intvolume":"        43","quality_controlled":"1","oa_version":"None","language":[{"iso":"eng"}],"article_processing_charge":"No","doi":"10.1145/3658125","day":"19","publication_status":"published","month":"07","date_published":"2024-07-19T00:00:00Z","article_number":"87","scopus_import":"1","year":"2024","citation":{"ista":"Ren Y, Panetta J, Suzuki S, Kusupati U, Isvoranu F, Pauly M. 2024. Computational homogenization for inverse design of surface-based inflatables. ACM Transactions on Graphics. 43(4), 87.","short":"Y. Ren, J. Panetta, S. Suzuki, U. Kusupati, F. Isvoranu, M. Pauly, ACM Transactions on Graphics 43 (2024).","mla":"Ren, Yingying, et al. “Computational Homogenization for Inverse Design of Surface-Based Inflatables.” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4, 87, Association for Computing Machinery, 2024, doi:<a href=\"https://doi.org/10.1145/3658125\">10.1145/3658125</a>.","chicago":"Ren, Yingying, Julian Panetta, Seiichi Suzuki, Uday Kusupati, Florin Isvoranu, and Mark Pauly. “Computational Homogenization for Inverse Design of Surface-Based Inflatables.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3658125\">https://doi.org/10.1145/3658125</a>.","ama":"Ren Y, Panetta J, Suzuki S, Kusupati U, Isvoranu F, Pauly M. Computational homogenization for inverse design of surface-based inflatables. <i>ACM Transactions on Graphics</i>. 2024;43(4). doi:<a href=\"https://doi.org/10.1145/3658125\">10.1145/3658125</a>","apa":"Ren, Y., Panetta, J., Suzuki, S., Kusupati, U., Isvoranu, F., &#38; Pauly, M. (2024). Computational homogenization for inverse design of surface-based inflatables. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3658125\">https://doi.org/10.1145/3658125</a>","ieee":"Y. Ren, J. Panetta, S. Suzuki, U. Kusupati, F. Isvoranu, and M. Pauly, “Computational homogenization for inverse design of surface-based inflatables,” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4. Association for Computing Machinery, 2024."},"publisher":"Association for Computing Machinery","status":"public"},{"abstract":[{"lang":"eng","text":"Tattoos are a highly popular medium, with both artistic and medical applications. Although the mechanical process of tattoo application has evolved historically, the results are reliant on the artisanal skill of the artist. This can be especially challenging for some skin tones, or in cases where artists lack experience. We provide the first systematic overview of tattooing as a computational fabrication technique. We built an automated tattooing rig and a recipe for the creation of silicone sheets mimicking realistic skin tones, which allowed us to create an accurate model predicting tattoo appearance. This enables several exciting applications including tattoo previewing, color retargeting, novel ink spectra optimization, color-accurate prosthetics, and more."}],"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"date_created":"2023-05-16T09:39:14Z","publication":"ACM Transactions on Graphics","file_date_updated":"2024-04-16T05:52:18Z","date_updated":"2025-04-15T07:43:53Z","type":"journal_article","article_type":"original","title":"Skin-Screen: A computational fabrication framework for color tattoos","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2023-08-10","location":"Los Angeles, CA, United States","start_date":"2023-08-06","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference"},"keyword":["appearance","modeling","reproduction","tattoo","skin color","gamut mapping","ink-optimization","prosthetic"],"oa":1,"has_accepted_license":"1","status":"public","citation":{"ista":"Piovarci M, Chapiro A, Bickel B. 2023. Skin-Screen: A computational fabrication framework for color tattoos. ACM Transactions on Graphics. 42(4), 67.","chicago":"Piovarci, Michael, Alexandre Chapiro, and Bernd Bickel. “Skin-Screen: A Computational Fabrication Framework for Color Tattoos.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3592432\">https://doi.org/10.1145/3592432</a>.","mla":"Piovarci, Michael, et al. “Skin-Screen: A Computational Fabrication Framework for Color Tattoos.” <i>ACM Transactions on Graphics</i>, vol. 42, no. 4, 67, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3592432\">10.1145/3592432</a>.","short":"M. Piovarci, A. Chapiro, B. Bickel, ACM Transactions on Graphics 42 (2023).","apa":"Piovarci, M., Chapiro, A., &#38; Bickel, B. (2023). Skin-Screen: A computational fabrication framework for color tattoos. <i>ACM Transactions on Graphics</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3592432\">https://doi.org/10.1145/3592432</a>","ama":"Piovarci M, Chapiro A, Bickel B. Skin-Screen: A computational fabrication framework for color tattoos. <i>ACM Transactions on Graphics</i>. 2023;42(4). doi:<a href=\"https://doi.org/10.1145/3592432\">10.1145/3592432</a>","ieee":"M. Piovarci, A. Chapiro, and B. Bickel, “Skin-Screen: A computational fabrication framework for color tattoos,” <i>ACM Transactions on Graphics</i>, vol. 42, no. 4. Association for Computing Machinery, 2023."},"file":[{"date_updated":"2023-05-16T09:38:25Z","file_size":30817343,"creator":"mpiovarc","file_id":"12985","date_created":"2023-05-16T09:38:25Z","file_name":"Piovarci2023.pdf","content_type":"application/pdf","relation":"main_file","checksum":"5f0a6867689e025a661bd0b4fd90b821","success":1,"access_level":"open_access"},{"creator":"dernst","file_size":30281676,"date_updated":"2024-04-16T05:52:18Z","file_name":"2023_ACM_Piovarci.pdf","file_id":"15324","date_created":"2024-04-16T05:52:18Z","checksum":"6dd371de5b517e5f184f9c2cbea4b8b3","relation":"main_file","content_type":"application/pdf","access_level":"open_access","success":1}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"scopus_import":"1","acknowledgement":"We thank Todor Asenov and the Miba Machine Shop for their help in assembling the tattoo machine and manufacturing the substrates. We thank Geysler Rodrigues for the insightful discussions on tattooing practices from a professional artist's perspective. We thank Maria Fernanda Portugal for sharing a doctor's perspective on medical applications of tattoos. This work is graciously supported by the FWF Lise Meitner (Grant M 3319).","month":"07","corr_author":"1","doi":"10.1145/3592432","day":"26","publication_status":"published","department":[{"_id":"BeBi"}],"acknowledged_ssus":[{"_id":"M-Shop"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        42","volume":42,"_id":"12984","issue":"4","external_id":{"isi":["001044671300033"]},"isi":1,"author":[{"last_name":"Piovarci","full_name":"Piovarci, Michael","id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","orcid":"0000-0002-5062-4474","first_name":"Michael"},{"first_name":"Alexandre","full_name":"Chapiro, Alexandre","last_name":"Chapiro"},{"last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd"}],"publisher":"Association for Computing Machinery","project":[{"name":"Perception-Aware Appearance Fabrication","grant_number":"M03319","_id":"eb901961-77a9-11ec-83b8-f5c883a62027"}],"ddc":["004"],"article_number":"67","year":"2023","date_published":"2023-07-26T00:00:00Z","article_processing_charge":"Yes (via OA deal)"},{"intvolume":"        42","volume":42,"issue":"4","_id":"13049","external_id":{"isi":["001044671300108"]},"isi":1,"author":[{"first_name":"Marco","last_name":"Freire","full_name":"Freire, Marco"},{"last_name":"Bhargava","full_name":"Bhargava, Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","orcid":"0009-0007-6138-6890","first_name":"Manas"},{"id":"2B14B676-F248-11E8-B48F-1D18A9856A87","full_name":"Schreck, Camille","last_name":"Schreck","first_name":"Camille"},{"full_name":"Hugron, Pierre-Alexandre","last_name":"Hugron","first_name":"Pierre-Alexandre"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd"},{"first_name":"Sylvain","full_name":"Lefebvre, Sylvain","last_name":"Lefebvre"}],"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020"}],"publisher":"Association for Computing Machinery","ddc":["006"],"year":"2023","article_number":"142","date_published":"2023-07-26T00:00:00Z","article_processing_charge":"No","abstract":[{"text":"We propose a computational design approach for covering a surface with individually addressable RGB LEDs, effectively forming a low-resolution surface screen. To achieve a low-cost and scalable approach, we propose creating designs from flat PCB panels bent in-place along the surface of a 3D printed core. Working with standard rigid PCBs enables the use of\r\nestablished PCB manufacturing services, allowing the fabrication of designs with several hundred LEDs. \r\nOur approach optimizes the PCB geometry for folding, and then jointly optimizes the LED packing, circuit and routing, solving a challenging layout problem under strict manufacturing requirements. Unlike paper, PCBs cannot bend beyond a certain point without breaking. Therefore, we introduce parametric cut patterns acting as hinges, designed to allow bending while remaining compact. To tackle the joint optimization of placement, circuit and routing, we propose a specialized algorithm that splits the global problem into one sub-problem per triangle, which is then individually solved.\r\nOur technique generates PCB blueprints in a completely automated way. After being fabricated by a PCB manufacturing service, the boards are bent and glued by the user onto the 3D printed support. We demonstrate our technique on a range of physical models and virtual examples, creating intricate surface light patterns from hundreds of LEDs.","lang":"eng"}],"date_created":"2023-05-22T08:37:04Z","publication":"Transactions on Graphics","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"file_date_updated":"2023-06-20T12:20:51Z","type":"journal_article","date_updated":"2026-05-04T12:41:52Z","article_type":"original","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"PCBend: Light up your 3D shapes with foldable circuit boards","keyword":["PCB design and layout","Mesh geometry models"],"conference":{"end_date":"2023-08-10","location":"Los Angeles, CA, United States","start_date":"2023-08-06","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference"},"has_accepted_license":"1","oa":1,"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"date_created":"2023-06-19T11:02:23Z","file_id":"13156","file_name":"2023_ACMToG_Freire.pdf","date_updated":"2023-06-19T11:02:23Z","file_size":78940724,"creator":"dernst","success":1,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"a0b0ba3b36f43a94388e8824613d812a"},{"date_updated":"2023-06-20T12:20:51Z","file_size":34345905,"creator":"dernst","file_id":"13157","date_created":"2023-06-20T12:20:51Z","file_name":"2023_ACMToG_SuppMaterial_Freire.pdf","content_type":"application/pdf","relation":"main_file","checksum":"b9206bbb67af82df49b7e7cdbde3410c","success":1,"access_level":"open_access"}],"citation":{"chicago":"Freire, Marco, Manas Bhargava, Camille Schreck, Pierre-Alexandre Hugron, Bernd Bickel, and Sylvain Lefebvre. “PCBend: Light up Your 3D Shapes with Foldable Circuit Boards.” <i>Transactions on Graphics</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3592411\">https://doi.org/10.1145/3592411</a>.","mla":"Freire, Marco, et al. “PCBend: Light up Your 3D Shapes with Foldable Circuit Boards.” <i>Transactions on Graphics</i>, vol. 42, no. 4, 142, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3592411\">10.1145/3592411</a>.","short":"M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, S. Lefebvre, Transactions on Graphics 42 (2023).","ista":"Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. 2023. PCBend: Light up your 3D shapes with foldable circuit boards. Transactions on Graphics. 42(4), 142.","ieee":"M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, and S. Lefebvre, “PCBend: Light up your 3D shapes with foldable circuit boards,” <i>Transactions on Graphics</i>, vol. 42, no. 4. Association for Computing Machinery, 2023.","apa":"Freire, M., Bhargava, M., Schreck, C., Hugron, P.-A., Bickel, B., &#38; Lefebvre, S. (2023). PCBend: Light up your 3D shapes with foldable circuit boards. <i>Transactions on Graphics</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3592411\">https://doi.org/10.1145/3592411</a>","ama":"Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. PCBend: Light up your 3D shapes with foldable circuit boards. <i>Transactions on Graphics</i>. 2023;42(4). doi:<a href=\"https://doi.org/10.1145/3592411\">10.1145/3592411</a>"},"scopus_import":"1","acknowledgement":"We thank the reviewers for the valuable feedback. We also thank the Miba Machine Shop at ISTA, PCBWay, and PragoBoard for helping us with fabrication and assembly. This project was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 715767 – MATERIALIZABLE).","related_material":{"record":[{"relation":"dissertation_contains","id":"20276","status":"public"}]},"corr_author":"1","month":"07","department":[{"_id":"GradSch"},{"_id":"BeBi"}],"publication_status":"published","doi":"10.1145/3592411","day":"26","ec_funded":1,"acknowledged_ssus":[{"_id":"M-Shop"}],"quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version"},{"scopus_import":"1","acknowledgement":"This work was supported in part by grants from the NSFC (61972232), Science and Technology Program of Shenzhen, China (CJGJZD20200617102202007). ","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2201.02374"}],"citation":{"ieee":"F. Zhong, Y. Xu, H. Zhao, and L. Lu, “As-Continuous-As-Possible extrusion-based fabrication of surface models,” <i>ACM Transactions on Graphics</i>, vol. 42, no. 3. Association for Computing Machinery, 2023.","ama":"Zhong F, Xu Y, Zhao H, Lu L. As-Continuous-As-Possible extrusion-based fabrication of surface models. <i>ACM Transactions on Graphics</i>. 2023;42(3). doi:<a href=\"https://doi.org/10.1145/3575859\">10.1145/3575859</a>","apa":"Zhong, F., Xu, Y., Zhao, H., &#38; Lu, L. (2023). As-Continuous-As-Possible extrusion-based fabrication of surface models. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3575859\">https://doi.org/10.1145/3575859</a>","mla":"Zhong, Fanchao, et al. “As-Continuous-As-Possible Extrusion-Based Fabrication of Surface Models.” <i>ACM Transactions on Graphics</i>, vol. 42, no. 3, 26, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3575859\">10.1145/3575859</a>.","chicago":"Zhong, Fanchao, Yonglai Xu, Haisen Zhao, and Lin Lu. “As-Continuous-As-Possible Extrusion-Based Fabrication of Surface Models.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3575859\">https://doi.org/10.1145/3575859</a>.","short":"F. Zhong, Y. Xu, H. Zhao, L. Lu, ACM Transactions on Graphics 42 (2023).","ista":"Zhong F, Xu Y, Zhao H, Lu L. 2023. As-Continuous-As-Possible extrusion-based fabrication of surface models. ACM Transactions on Graphics. 42(3), 26."},"arxiv":1,"quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"Preprint","month":"03","doi":"10.1145/3575859","day":"17","department":[{"_id":"BeBi"}],"publication_status":"published","date_updated":"2023-12-13T11:34:59Z","type":"journal_article","abstract":[{"text":"In this study, we propose a computational framework for optimizing the continuity of the toolpath in fabricating surface models on an extrusion-based 3D printer. Toolpath continuity is a critical issue that influences both the quality and the efficiency of extrusion-based fabrication. Transfer moves lead to rough and bumpy surfaces, where this phenomenon worsens for materials with large viscosity, like clay. The effects of continuity on the surface models are even more severe in terms of the quality of the surface and the stability of the model. We introduce a criterion called the one–path patch (OPP) to represent a patch on the surface of the shell that can be traversed along one path by considering the constraints on fabrication. We study the properties of the OPPs and their merging operations to propose a bottom-up OPP merging procedure to decompose the given shell surface into a minimal number of OPPs, and to generate the “as-continuous-as-possible” (ACAP) toolpath. Furthermore, we augment the path planning algorithm with a curved-layer printing scheme that reduces staircase defects and improves the continuity of the toolpath by connecting multiple segments. We evaluated the ACAP algorithm on ceramic and thermoplastic materials, and the results showed that it improves the fabrication of surface models in terms of both efficiency and surface quality.","lang":"eng"}],"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"date_created":"2023-07-23T22:01:13Z","publication":"ACM Transactions on Graphics","oa":1,"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"As-Continuous-As-Possible extrusion-based fabrication of surface models","article_number":"26","year":"2023","publisher":"Association for Computing Machinery","article_processing_charge":"No","date_published":"2023-03-17T00:00:00Z","volume":42,"intvolume":"        42","isi":1,"author":[{"first_name":"Fanchao","full_name":"Zhong, Fanchao","last_name":"Zhong"},{"last_name":"Xu","full_name":"Xu, Yonglai","first_name":"Yonglai"},{"first_name":"Haisen","orcid":"0000-0002-6389-1045","id":"fb7f793a-80d1-11eb-8869-d56e5b2a8ff4","full_name":"Zhao, Haisen","last_name":"Zhao"},{"first_name":"Lin","full_name":"Lu, Lin","last_name":"Lu"}],"_id":"13265","external_id":{"isi":["001018739600002"],"arxiv":["2201.02374"]},"issue":"3"},{"publisher":"Association for Computing Machinery","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"ddc":["000"],"article_number":"83","year":"2023","date_published":"2023-08-01T00:00:00Z","article_processing_charge":"Yes (in subscription journal)","intvolume":"        42","volume":42,"_id":"14240","issue":"4","external_id":{"isi":["001044671300049"]},"isi":1,"author":[{"first_name":"Stefan","last_name":"Jeschke","full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"status":"public","citation":{"apa":"Jeschke, S., &#38; Wojtan, C. (2023). Generalizing shallow water simulations with dispersive surface waves. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3592098\">https://doi.org/10.1145/3592098</a>","ama":"Jeschke S, Wojtan C. Generalizing shallow water simulations with dispersive surface waves. <i>ACM Transactions on Graphics</i>. 2023;42(4). doi:<a href=\"https://doi.org/10.1145/3592098\">10.1145/3592098</a>","ieee":"S. Jeschke and C. Wojtan, “Generalizing shallow water simulations with dispersive surface waves,” <i>ACM Transactions on Graphics</i>, vol. 42, no. 4. Association for Computing Machinery, 2023.","ista":"Jeschke S, Wojtan C. 2023. Generalizing shallow water simulations with dispersive surface waves. ACM Transactions on Graphics. 42(4), 83.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 42 (2023).","chicago":"Jeschke, Stefan, and Chris Wojtan. “Generalizing Shallow Water Simulations with Dispersive Surface Waves.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3592098\">https://doi.org/10.1145/3592098</a>.","mla":"Jeschke, Stefan, and Chris Wojtan. “Generalizing Shallow Water Simulations with Dispersive Surface Waves.” <i>ACM Transactions on Graphics</i>, vol. 42, no. 4, 83, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3592098\">10.1145/3592098</a>."},"file":[{"file_name":"PaperVideo_final.mp4","date_created":"2023-12-21T12:26:40Z","file_id":"14704","file_size":511572575,"creator":"sjeschke","date_updated":"2023-12-21T12:26:40Z","success":1,"access_level":"open_access","relation":"main_file","checksum":"1d178bb2f8011d9f5aedda6427e18c7a","content_type":"video/mp4"},{"success":1,"access_level":"open_access","relation":"main_file","checksum":"a49b2e744d5cd1276bb8b2e0ce6dc638","content_type":"application/pdf","file_name":"2023_ACMToG_Jeschke.pdf","file_id":"14725","date_created":"2024-01-02T09:34:27Z","file_size":7469177,"creator":"dernst","date_updated":"2024-01-02T09:34:27Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"scopus_import":"1","acknowledgement":"We thank Georg Sperl for helping with early research for this paper, Mickael Ly and Yi-Lu Chen for proofreading, and members of the ISTA Visual Computing Group for general feedback. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).\r\nThe motorboat and sailboat were modeled by Sergei and the palmtrees by YadroGames. The environment map was created by Emil Persson.","corr_author":"1","month":"08","day":"01","doi":"10.1145/3592098","department":[{"_id":"ChWo"}],"publication_status":"published","acknowledged_ssus":[{"_id":"ScienComp"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"quality_controlled":"1","abstract":[{"text":"This paper introduces a novel method for simulating large bodies of water as a height field. At the start of each time step, we partition the waves into a bulk flow (which approximately satisfies the assumptions of the shallow water equations) and surface waves (which approximately satisfy the assumptions of Airy wave theory). We then solve the two wave regimes separately using appropriate state-of-the-art techniques, and re-combine the resulting wave velocities at the end of each step. This strategy leads to the first heightfield wave model capable of simulating complex interactions between both deep and shallow water effects, like the waves from a boat wake sloshing up onto a beach, or a dam break producing wave interference patterns and eddies. We also analyze the numerical dispersion created by our method and derive an exact correction factor for waves at a constant water depth, giving us a numerically perfect re-creation of theoretical water wave dispersion patterns.","lang":"eng"}],"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"publication":"ACM Transactions on Graphics","date_created":"2023-08-27T22:01:17Z","file_date_updated":"2024-01-02T09:34:27Z","date_updated":"2025-04-14T08:01:13Z","type":"journal_article","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Generalizing shallow water simulations with dispersive surface waves","oa":1,"has_accepted_license":"1"},{"keyword":["Computer Graphics and Computer-Aided Design"],"oa":1,"has_accepted_license":"1","article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Procedural metamaterials: A unified procedural graph for metamaterial design","file_date_updated":"2023-12-04T08:04:14Z","type":"journal_article","date_updated":"2025-09-09T13:33:58Z","abstract":[{"lang":"eng","text":"We introduce a compact, intuitive procedural graph representation for cellular metamaterials, which are small-scale, tileable structures that can be architected to exhibit many useful material properties. Because the structures’ “architectures” vary widely—with elements such as beams, thin shells, and solid bulks—it is difficult to explore them using existing representations. Generic approaches like voxel grids are versatile, but it is cumbersome to represent and edit individual structures; architecture-specific approaches address these issues, but are incompatible with one another. By contrast, our procedural graph succinctly represents the construction process for any structure using a simple skeleton annotated with spatially varying thickness. To express the highly constrained triply periodic minimal surfaces (TPMS) in this manner, we present the first fully automated version of the conjugate surface construction method, which allows novices to create complex TPMS from intuitive input. We demonstrate our representation’s expressiveness, accuracy, and compactness by constructing a wide range of established structures and hundreds of novel structures with diverse architectures and material properties. We also conduct a user study to verify our representation’s ease-of-use and ability to expand engineers’ capacity for exploration."}],"publication":"ACM Transactions on Graphics","date_created":"2023-11-29T15:02:03Z","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"oa_version":"Published Version","language":[{"iso":"eng"}],"quality_controlled":"1","month":"10","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ChWo"},{"_id":"BeBi"}],"doi":"10.1145/3605389","day":"01","acknowledgement":"The authors thank Mina Konaković Luković and Michael Foshey for their early contributions to this project, David Palmer and Paul Zhang for their insightful discussions about minimal surfaces and the CSCM, Julian Panetta for providing the Elastic Textures code, and Hannes Hergeth for his feedback and support. We also thank our user study participants and anonymous reviewers.\r\nThis material is based upon work supported by the National Science Foundation\r\n(NSF) Graduate Research Fellowship under Grant No. 2141064; the MIT Morningside\r\nAcademy for Design Fellowship; the Defense Advanced Research Projects Agency\r\n(DARPA) Grant No. FA8750-20-C-0075; the ERC Consolidator Grant No. 101045083,\r\n“CoDiNA: Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena”; and the NewSat project, which is co-funded by the Operational Program for Competitiveness and Internationalisation (COMPETE2020), Portugal 2020, the European Regional Development Fund (ERDF), and the Portuguese Foundation for Science and Technology (FTC) under the MIT Portugal program.","scopus_import":"1","status":"public","file":[{"relation":"main_file","checksum":"0192f597d7a2ceaf89baddfd6190d4c8","content_type":"application/zip","success":1,"access_level":"open_access","file_size":95467870,"creator":"yichen","date_updated":"2023-11-29T15:16:01Z","file_name":"tog-22-0089-File004.zip","date_created":"2023-11-29T15:16:01Z","file_id":"14630"},{"access_level":"open_access","success":1,"checksum":"7fb024963be81933494f38de191e4710","relation":"main_file","content_type":"application/zip","file_name":"tog-22-0089-File005.zip","file_id":"14631","date_created":"2023-11-29T15:16:01Z","creator":"yichen","file_size":103731880,"date_updated":"2023-11-29T15:16:01Z"},{"success":1,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"b7d6829ce396e21cac9fae0ec7130a6b","file_id":"14638","date_created":"2023-12-04T08:04:14Z","file_name":"2023_ACMToG_Makatura.pdf","date_updated":"2023-12-04T08:04:14Z","file_size":57067476,"creator":"dernst"}],"citation":{"ista":"Makatura L, Wang B, Chen Y-L, Deng B, Wojtan C, Bickel B, Matusik W. 2023. Procedural metamaterials: A unified procedural graph for metamaterial design. ACM Transactions on Graphics. 42(5), 168.","chicago":"Makatura, Liane, Bohan Wang, Yi-Lu Chen, Bolei Deng, Chris Wojtan, Bernd Bickel, and Wojciech Matusik. “Procedural Metamaterials: A Unified Procedural Graph for Metamaterial Design.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3605389\">https://doi.org/10.1145/3605389</a>.","mla":"Makatura, Liane, et al. “Procedural Metamaterials: A Unified Procedural Graph for Metamaterial Design.” <i>ACM Transactions on Graphics</i>, vol. 42, no. 5, 168, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3605389\">10.1145/3605389</a>.","short":"L. Makatura, B. Wang, Y.-L. Chen, B. Deng, C. Wojtan, B. Bickel, W. Matusik, ACM Transactions on Graphics 42 (2023).","apa":"Makatura, L., Wang, B., Chen, Y.-L., Deng, B., Wojtan, C., Bickel, B., &#38; Matusik, W. (2023). Procedural metamaterials: A unified procedural graph for metamaterial design. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3605389\">https://doi.org/10.1145/3605389</a>","ama":"Makatura L, Wang B, Chen Y-L, et al. Procedural metamaterials: A unified procedural graph for metamaterial design. <i>ACM Transactions on Graphics</i>. 2023;42(5). doi:<a href=\"https://doi.org/10.1145/3605389\">10.1145/3605389</a>","ieee":"L. Makatura <i>et al.</i>, “Procedural metamaterials: A unified procedural graph for metamaterial design,” <i>ACM Transactions on Graphics</i>, vol. 42, no. 5. Association for Computing Machinery, 2023."},"author":[{"last_name":"Makatura","full_name":"Makatura, Liane","first_name":"Liane"},{"last_name":"Wang","full_name":"Wang, Bohan","first_name":"Bohan"},{"last_name":"Chen","id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","full_name":"Chen, Yi-Lu","first_name":"Yi-Lu"},{"first_name":"Bolei","full_name":"Deng, Bolei","last_name":"Deng"},{"orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"last_name":"Matusik","full_name":"Matusik, Wojciech","first_name":"Wojciech"}],"isi":1,"issue":"5","_id":"14628","external_id":{"isi":["001086833300007"]},"volume":42,"intvolume":"        42","article_processing_charge":"Yes (in subscription journal)","date_published":"2023-10-01T00:00:00Z","year":"2023","article_number":"168","project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"}],"publisher":"Association for Computing Machinery","ddc":["531","006"]},{"intvolume":"        42","abstract":[{"lang":"eng","text":"We introduce a computational pipeline for simulating and designing C-shells, a new class of planar-to-spatial deployable linkage structures. A C-shell is composed of curved flexible beams connected at rotational joints that can be assembled in a stress-free planar configuration. When actuated, the elastic beams deform and the assembly deploys towards the target 3D shape.\r\nWe propose two alternative computational design approaches for C-shells: (i) Forward exploration simulates the deployed shape from a planar beam layout provided by the user. Once a satisfactory overall shape is found, a subsequent design optimization adapts the beam geometry to reduce the elastic energy of the linkage while preserving the target shape. (ii) Inverse design is facilitated by a new geometric flattening method that takes a design surface as input and computes an initial layout of piecewise straight linkage beams. Our design optimization algorithm then calculates the smooth curved beams to best reproduce the target shape at minimal elastic energy.\r\nWe find that C-shells offer a rich space for design and show several studies that highlight new shape topologies that cannot be achieved with existing deployable linkage structures."}],"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"publication":"ACM Transactions on Graphics","date_created":"2024-08-05T06:15:06Z","volume":42,"date_updated":"2024-08-12T09:56:32Z","type":"journal_article","article_type":"original","issue":"6","_id":"17379","extern":"1","title":"C-shells: Deployable gridshells with curved beams","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Quentin","full_name":"Becker, Quentin","last_name":"Becker"},{"first_name":"Seiichi","last_name":"Suzuki","full_name":"Suzuki, Seiichi"},{"first_name":"Yingying","last_name":"Ren","full_name":"Ren, Yingying","id":"93d68d10-3540-11ef-a265-f748a50dba3d"},{"full_name":"Pellis, Davide","last_name":"Pellis","first_name":"Davide"},{"last_name":"Panetta","full_name":"Panetta, Julian","first_name":"Julian"},{"first_name":"Mark","full_name":"Pauly, Mark","last_name":"Pauly"}],"publisher":"Association for Computing Machinery","status":"public","citation":{"ieee":"Q. Becker, S. Suzuki, Y. Ren, D. Pellis, J. Panetta, and M. Pauly, “C-shells: Deployable gridshells with curved beams,” <i>ACM Transactions on Graphics</i>, vol. 42, no. 6. Association for Computing Machinery, 2023.","apa":"Becker, Q., Suzuki, S., Ren, Y., Pellis, D., Panetta, J., &#38; Pauly, M. (2023). C-shells: Deployable gridshells with curved beams. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3618366\">https://doi.org/10.1145/3618366</a>","ama":"Becker Q, Suzuki S, Ren Y, Pellis D, Panetta J, Pauly M. C-shells: Deployable gridshells with curved beams. <i>ACM Transactions on Graphics</i>. 2023;42(6). doi:<a href=\"https://doi.org/10.1145/3618366\">10.1145/3618366</a>","chicago":"Becker, Quentin, Seiichi Suzuki, Yingying Ren, Davide Pellis, Julian Panetta, and Mark Pauly. “C-Shells: Deployable Gridshells with Curved Beams.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3618366\">https://doi.org/10.1145/3618366</a>.","mla":"Becker, Quentin, et al. “C-Shells: Deployable Gridshells with Curved Beams.” <i>ACM Transactions on Graphics</i>, vol. 42, no. 6, 173, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3618366\">10.1145/3618366</a>.","short":"Q. Becker, S. Suzuki, Y. Ren, D. Pellis, J. Panetta, M. Pauly, ACM Transactions on Graphics 42 (2023).","ista":"Becker Q, Suzuki S, Ren Y, Pellis D, Panetta J, Pauly M. 2023. C-shells: Deployable gridshells with curved beams. ACM Transactions on Graphics. 42(6), 173."},"article_number":"173","year":"2023","scopus_import":"1","month":"12","date_published":"2023-12-05T00:00:00Z","day":"05","doi":"10.1145/3618366","publication_status":"published","article_processing_charge":"No","oa_version":"None","quality_controlled":"1","language":[{"iso":"eng"}]},{"article_type":"original","_id":"17381","extern":"1","issue":"4","title":"Computational exploration of multistable elastic knots","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Vidulis, Michele","last_name":"Vidulis","first_name":"Michele"},{"last_name":"Ren","id":"93d68d10-3540-11ef-a265-f748a50dba3d","full_name":"Ren, Yingying","first_name":"Yingying"},{"first_name":"Julian","last_name":"Panetta","full_name":"Panetta, Julian"},{"full_name":"Grinspun, Eitan","last_name":"Grinspun","first_name":"Eitan"},{"first_name":"Mark","full_name":"Pauly, Mark","last_name":"Pauly"}],"intvolume":"        42","abstract":[{"lang":"eng","text":"We present an algorithmic approach to discover, study, and design multistable elastic knots. Elastic knots are physical realizations of closed curves embedded in 3-space. When endowed with the material thickness and bending resistance of a physical wire, these knots settle into equilibrium states that balance the forces induced by elastic deformation and self-contacts of the wire. In general, elastic knots can have many distinct equilibrium states, i.e. they are multistable mechanical systems. We propose a computational pipeline that combines randomized spatial sampling and physics simulation to efficiently find stable equilibrium states of elastic knots. Leveraging results from knot theory, we run our pipeline on thousands of different topological knot types to create an extensive data set of multistable knots. By applying a series of filters to this data, we discover new transformable knots with interesting geometric and physical properties. A further analysis across knot types reveals geometric and topological patterns, yielding constructive principles that generalize beyond the currently tabulated knot types. We show how multistable elastic knots can be used to design novel deployable structures and engaging recreational puzzles. Several physical prototypes at different scales highlight these applications and validate our simulation."}],"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"date_created":"2024-08-05T06:29:22Z","publication":"ACM Transactions on Graphics","volume":42,"date_updated":"2024-08-12T09:48:36Z","type":"journal_article","month":"08","date_published":"2023-08-01T00:00:00Z","day":"01","doi":"10.1145/3592399","publication_status":"published","article_processing_charge":"No","quality_controlled":"1","oa_version":"None","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","status":"public","citation":{"ieee":"M. Vidulis, Y. Ren, J. Panetta, E. Grinspun, and M. Pauly, “Computational exploration of multistable elastic knots,” <i>ACM Transactions on Graphics</i>, vol. 42, no. 4. Association for Computing Machinery, 2023.","apa":"Vidulis, M., Ren, Y., Panetta, J., Grinspun, E., &#38; Pauly, M. (2023). Computational exploration of multistable elastic knots. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3592399\">https://doi.org/10.1145/3592399</a>","ama":"Vidulis M, Ren Y, Panetta J, Grinspun E, Pauly M. Computational exploration of multistable elastic knots. <i>ACM Transactions on Graphics</i>. 2023;42(4). doi:<a href=\"https://doi.org/10.1145/3592399\">10.1145/3592399</a>","chicago":"Vidulis, Michele, Yingying Ren, Julian Panetta, Eitan Grinspun, and Mark Pauly. “Computational Exploration of Multistable Elastic Knots.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3592399\">https://doi.org/10.1145/3592399</a>.","mla":"Vidulis, Michele, et al. “Computational Exploration of Multistable Elastic Knots.” <i>ACM Transactions on Graphics</i>, vol. 42, no. 4, 73, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3592399\">10.1145/3592399</a>.","short":"M. Vidulis, Y. Ren, J. Panetta, E. Grinspun, M. Pauly, ACM Transactions on Graphics 42 (2023).","ista":"Vidulis M, Ren Y, Panetta J, Grinspun E, Pauly M. 2023. Computational exploration of multistable elastic knots. ACM Transactions on Graphics. 42(4), 73."},"article_number":"73","scopus_import":"1","year":"2023"},{"abstract":[{"lang":"eng","text":"The Kirchhoff rod model describes the bending and twisting of slender elastic rods in three dimensions, and has been widely studied to enable the prediction of how a rod will deform, given its geometry and boundary conditions. In this work, we study a number of inverse problems with the goal of computing the geometry of a straight rod that will automatically deform to match a curved target shape after attaching its endpoints to a support structure. Our solution lets us finely control the static equilibrium state of a rod by varying the cross-sectional profiles along its length.\r\nWe also show that the set of physically realizable equilibrium states admits a concise geometric description in terms of linear line complexes, which leads to very efficient computational design algorithms. Implemented in an interactive software tool, they allow us to convert three-dimensional hand-drawn spline curves to elastic rods, and give feedback about the feasibility and practicality of a design in real time. We demonstrate the efficacy of our method by designing and manufacturing several physical prototypes with applications to interior design and soft robotics."}],"date_created":"2023-07-04T07:41:30Z","publication":"ACM Transactions on Graphics","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"file_date_updated":"2023-07-04T08:11:28Z","type":"journal_article","date_updated":"2026-06-24T22:30:13Z","article_type":"original","title":"The design space of Kirchhoff rods","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["Computer Graphics","Computational Design","Computational Geometry","Shape Modeling"],"oa":1,"has_accepted_license":"1","status":"public","citation":{"ama":"Hafner C, Bickel B. The design space of Kirchhoff rods. <i>ACM Transactions on Graphics</i>. 2023;42(5). doi:<a href=\"https://doi.org/10.1145/3606033\">10.1145/3606033</a>","apa":"Hafner, C., &#38; Bickel, B. (2023). The design space of Kirchhoff rods. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3606033\">https://doi.org/10.1145/3606033</a>","ieee":"C. Hafner and B. Bickel, “The design space of Kirchhoff rods,” <i>ACM Transactions on Graphics</i>, vol. 42, no. 5. Association for Computing Machinery, 2023.","ista":"Hafner C, Bickel B. 2023. The design space of Kirchhoff rods. ACM Transactions on Graphics. 42(5), 171.","chicago":"Hafner, Christian, and Bernd Bickel. “The Design Space of Kirchhoff Rods.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3606033\">https://doi.org/10.1145/3606033</a>.","mla":"Hafner, Christian, and Bernd Bickel. “The Design Space of Kirchhoff Rods.” <i>ACM Transactions on Graphics</i>, vol. 42, no. 5, 171, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3606033\">10.1145/3606033</a>.","short":"C. Hafner, B. Bickel, ACM Transactions on Graphics 42 (2023)."},"file":[{"success":1,"access_level":"open_access","relation":"main_file","checksum":"4954c1cfa487725bc156dcfec872478a","content_type":"application/pdf","file_name":"kirchhoff-rods.pdf","file_id":"13194","date_created":"2023-07-04T08:11:28Z","file_size":19635168,"creator":"chafner","date_updated":"2023-07-04T08:11:28Z"},{"access_level":"open_access","title":"Supplemental Material with Proofs","checksum":"79c9975fbc82ff71f1767331d2204cca","relation":"supplementary_material","content_type":"application/pdf","file_name":"supp-main.pdf","file_id":"13190","date_created":"2023-07-04T07:46:28Z","creator":"chafner","file_size":420909,"date_updated":"2023-07-04T07:46:28Z"},{"file_name":"supp-cheat.pdf","date_created":"2023-07-04T07:46:30Z","file_id":"13191","creator":"chafner","file_size":430086,"date_updated":"2023-07-04T07:46:30Z","access_level":"open_access","title":"Cheat Sheet for Notation","checksum":"4ab647e4f03c711e1e6a5fc1eb8684db","relation":"supplementary_material","content_type":"application/pdf"},{"date_updated":"2023-07-04T07:46:39Z","creator":"chafner","file_size":268088064,"date_created":"2023-07-04T07:46:39Z","file_id":"13192","file_name":"kirchhoff-video-final.mp4","content_type":"video/mp4","checksum":"c0fd9a57d012046de90c185ffa904b76","relation":"supplementary_material","access_level":"open_access","title":"Supplemental Video"},{"file_size":25790,"creator":"chafner","date_updated":"2023-07-04T07:47:10Z","file_name":"matlab-submission.zip","file_id":"13193","date_created":"2023-07-04T07:47:10Z","relation":"supplementary_material","checksum":"71b00712b489ada2cd9815910ee180a9","content_type":"application/x-zip-compressed","title":"Matlab Source Code with Example","access_level":"open_access"}],"acknowledgement":"We thank the anonymous reviewers for their generous feedback, and Julian Fischer for his help in proving Proposition 1. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 715767).","scopus_import":"1","related_material":{"record":[{"id":"12897","relation":"part_of_dissertation","status":"public"}]},"corr_author":"1","month":"09","department":[{"_id":"BeBi"}],"publication_status":"published","ec_funded":1,"doi":"10.1145/3606033","day":"20","acknowledged_ssus":[{"_id":"M-Shop"}],"quality_controlled":"1","oa_version":"Submitted Version","language":[{"iso":"eng"}],"intvolume":"        42","volume":42,"external_id":{"isi":["001086833300010"]},"_id":"13188","issue":"5","isi":1,"author":[{"last_name":"Hafner","id":"400429CC-F248-11E8-B48F-1D18A9856A87","full_name":"Hafner, Christian","first_name":"Christian"},{"orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"publisher":"Association for Computing Machinery","ddc":["516"],"year":"2023","article_number":"171","date_published":"2023-09-20T00:00:00Z","article_processing_charge":"No"},{"article_processing_charge":"No","date_published":"2022-06-01T00:00:00Z","article_number":"112","year":"2022","ddc":["000"],"publisher":"Association for Computing Machinery","project":[{"_id":"eb901961-77a9-11ec-83b8-f5c883a62027","name":"Perception-Aware Appearance Fabrication","grant_number":"M03319"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"author":[{"first_name":"Michael","orcid":"0000-0002-5062-4474","id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","full_name":"Piovarci, Michael","last_name":"Piovarci"},{"first_name":"Michael","full_name":"Foshey, Michael","last_name":"Foshey"},{"first_name":"Jie","full_name":"Xu, Jie","last_name":"Xu"},{"full_name":"Erps, Timothy","last_name":"Erps","first_name":"Timothy"},{"first_name":"Vahid","full_name":"Babaei, Vahid","last_name":"Babaei"},{"first_name":"Piotr","last_name":"Didyk","full_name":"Didyk, Piotr"},{"last_name":"Rusinkiewicz","full_name":"Rusinkiewicz, Szymon","first_name":"Szymon"},{"first_name":"Wojciech","full_name":"Matusik, Wojciech","last_name":"Matusik"},{"last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd"}],"isi":1,"external_id":{"arxiv":["2201.11819"],"isi":["000830989200091"]},"_id":"11442","issue":"4","volume":41,"intvolume":"        41","quality_controlled":"1","oa_version":"Submitted Version","language":[{"iso":"eng"}],"arxiv":1,"day":"01","ec_funded":1,"doi":"10.1145/3528223.3530144","department":[{"_id":"BeBi"}],"publication_status":"published","month":"06","corr_author":"1","related_material":{"link":[{"description":"News on ISTA website","url":"https://ista.ac.at/en/news/machine-learning-3d-printing-fluids/","relation":"press_release"}]},"acknowledgement":"This work is graciously supported by the following grant agencies: FWF Lise Meitner (Grant M 3319), SNSF (Grant 200502), ERC Starting Grant (MATERIALIZABLE-715767), NSF (Grant IIS-181507).\r\n","scopus_import":"1","citation":{"ama":"Piovarci M, Foshey M, Xu J, et al. Closed-loop control of direct ink writing via reinforcement learning. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530144\">10.1145/3528223.3530144</a>","apa":"Piovarci, M., Foshey, M., Xu, J., Erps, T., Babaei, V., Didyk, P., … Bickel, B. (2022). Closed-loop control of direct ink writing via reinforcement learning. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530144\">https://doi.org/10.1145/3528223.3530144</a>","ieee":"M. Piovarci <i>et al.</i>, “Closed-loop control of direct ink writing via reinforcement learning,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","ista":"Piovarci M, Foshey M, Xu J, Erps T, Babaei V, Didyk P, Rusinkiewicz S, Matusik W, Bickel B. 2022. Closed-loop control of direct ink writing via reinforcement learning. ACM Transactions on Graphics. 41(4), 112.","short":"M. Piovarci, M. Foshey, J. Xu, T. Erps, V. Babaei, P. Didyk, S. Rusinkiewicz, W. Matusik, B. Bickel, ACM Transactions on Graphics 41 (2022).","chicago":"Piovarci, Michael, Michael Foshey, Jie Xu, Timothy Erps, Vahid Babaei, Piotr Didyk, Szymon Rusinkiewicz, Wojciech Matusik, and Bernd Bickel. “Closed-Loop Control of Direct Ink Writing via Reinforcement Learning.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530144\">https://doi.org/10.1145/3528223.3530144</a>.","mla":"Piovarci, Michael, et al. “Closed-Loop Control of Direct Ink Writing via Reinforcement Learning.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 112, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530144\">10.1145/3528223.3530144</a>."},"file":[{"relation":"main_file","checksum":"27f6fe41c6ff84d50445cc9b0176d45b","content_type":"application/pdf","success":1,"access_level":"open_access","file_size":33994829,"creator":"dernst","date_updated":"2022-06-28T08:32:58Z","file_name":"2022_ACM_acceptedversion_Piovarci.pdf","date_created":"2022-06-28T08:32:58Z","file_id":"11467"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","has_accepted_license":"1","oa":1,"OA_type":"hybrid","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Closed-loop control of direct ink writing via reinforcement learning","OA_place":"publisher","article_type":"original","date_updated":"2025-09-10T09:36:45Z","type":"journal_article","file_date_updated":"2022-06-28T08:32:58Z","PlanS_conform":"1","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"publication":"ACM Transactions on Graphics","date_created":"2022-06-10T06:41:47Z","abstract":[{"text":"Enabling additive manufacturing to employ a wide range of novel, functional materials can be a major boost to this technology. However, making such materials printable requires painstaking trial-and-error by an expert operator,\r\nas they typically tend to exhibit peculiar rheological or hysteresis properties. Even in the case of successfully finding the process parameters, there is no guarantee of print-to-print consistency due to material differences between batches. These challenges make closed-loop feedback an attractive option where the process parameters are adjusted on-the-fly. There are several challenges for designing an efficient controller: the deposition parameters are complex and highly coupled, artifacts occur after long time horizons, simulating the deposition is computationally costly, and learning on hardware is intractable. In this work, we demonstrate the feasibility of learning a closed-loop control policy for additive manufacturing using reinforcement learning. We show that approximate, but efficient, numerical simulation is\r\nsufficient as long as it allows learning the behavioral patterns of deposition that translate to real-world experiences. In combination with reinforcement learning, our model can be used to discover control policies that outperform\r\nbaseline controllers. Furthermore, the recovered policies have a minimal sim-to-real gap. We showcase this by applying our control policy in-vivo on a single-layer, direct ink writing printer. ","lang":"eng"}]},{"status":"public","file":[{"checksum":"0b51651be45b1b33f2072bd5d2686c69","relation":"main_file","content_type":"application/pdf","access_level":"open_access","success":1,"creator":"bbickel","file_size":16896871,"date_updated":"2022-08-28T07:56:19Z","file_name":"Chen-2022-High-LevelPuzzle_authorVersion.pdf","file_id":"11992","date_created":"2022-08-28T07:56:19Z"}],"citation":{"ieee":"R. Chen, Z. Wang, P. Song, and B. Bickel, “Computational design of high-level interlocking puzzles,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","apa":"Chen, R., Wang, Z., Song, P., &#38; Bickel, B. (2022). Computational design of high-level interlocking puzzles. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530071\">https://doi.org/10.1145/3528223.3530071</a>","ama":"Chen R, Wang Z, Song P, Bickel B. Computational design of high-level interlocking puzzles. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530071\">10.1145/3528223.3530071</a>","mla":"Chen, Rulin, et al. “Computational Design of High-Level Interlocking Puzzles.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 150, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530071\">10.1145/3528223.3530071</a>.","chicago":"Chen, Rulin, Ziqi Wang, Peng Song, and Bernd Bickel. “Computational Design of High-Level Interlocking Puzzles.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530071\">https://doi.org/10.1145/3528223.3530071</a>.","short":"R. Chen, Z. Wang, P. Song, B. Bickel, ACM Transactions on Graphics 41 (2022).","ista":"Chen R, Wang Z, Song P, Bickel B. 2022. Computational design of high-level interlocking puzzles. ACM Transactions on Graphics. 41(4), 150."},"acknowledgement":"We thank the reviewers for the valuable comments, David Gontier for sharing the source code of the baseline design approach, Christian Hafner for proofreading the paper, Keenan Crane for the 3D model of Cow, and Thingiverse for the 3D models of Moai and Owl. This work was supported by the SUTD Start-up Research Grant (Number: SRG ISTD 2019 148), the Swiss National Science Foundation (NCCR Digital Fabrication Agreement #51NF40-141853), and\r\nthe European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No 715767 – MATERIALIZABLE).","scopus_import":"1","related_material":{"link":[{"description":"News on ISTA website","url":"https://ista.ac.at/en/news/unlocking-interlocking-riddles/","relation":"press_release"}]},"month":"07","publication_status":"published","department":[{"_id":"BeBi"}],"doi":"10.1145/3528223.3530071","ec_funded":1,"day":"22","oa_version":"Submitted Version","quality_controlled":"1","language":[{"iso":"eng"}],"abstract":[{"text":"Interlocking puzzles are intriguing geometric games where the puzzle pieces are held together based on their geometric arrangement, preventing the puzzle from falling apart. High-level-of-difficulty, or simply high-level, interlocking puzzles are a subclass of interlocking puzzles that require multiple moves to take out the first subassembly from the puzzle. Solving a high-level interlocking puzzle is a challenging task since one has to explore many different configurations of the puzzle pieces until reaching a configuration where the first subassembly can be taken out. Designing a high-level interlocking puzzle with a user-specified level of difficulty is even harder since the puzzle pieces have to be interlocking in all the configurations before the first subassembly is taken out.\r\n\r\nIn this paper, we present a computational approach to design high-level interlocking puzzles. The core idea is to represent all possible configurations of an interlocking puzzle as well as transitions among these configurations using a rooted, undirected graph called a disassembly graph and leverage this graph to find a disassembly plan that requires a minimal number of moves to take out the first subassembly from the puzzle. At the design stage, our algorithm iteratively constructs the geometry of each puzzle piece to expand the disassembly graph incrementally, aiming to achieve a user-specified level of difficulty. We show that our approach allows efficient generation of high-level interlocking puzzles of various shape complexities, including new solutions not attainable by state-of-the-art approaches.","lang":"eng"}],"date_created":"2022-08-07T22:01:57Z","publication":"ACM Transactions on Graphics","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"file_date_updated":"2022-08-28T07:56:19Z","type":"journal_article","date_updated":"2025-04-14T07:28:57Z","article_type":"original","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Computational design of high-level interlocking puzzles","has_accepted_license":"1","oa":1,"project":[{"grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"publisher":"Association for Computing Machinery","ddc":["000"],"year":"2022","article_number":"150","date_published":"2022-07-22T00:00:00Z","article_processing_charge":"No","intvolume":"        41","volume":41,"_id":"11735","external_id":{"isi":["000830989200018"]},"issue":"4","isi":1,"author":[{"last_name":"Chen","full_name":"Chen, Rulin","first_name":"Rulin"},{"last_name":"Wang","full_name":"Wang, Ziqi","first_name":"Ziqi"},{"first_name":"Peng","last_name":"Song","full_name":"Song, Peng"},{"orcid":"0000-0001-6511-9385","first_name":"Bernd","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel"}]},{"date_published":"2022-07-22T00:00:00Z","article_processing_charge":"No","ddc":["000"],"publisher":"Association for Computing Machinery","article_number":"65","year":"2022","external_id":{"isi":["000830989200114"]},"_id":"11736","issue":"4","isi":1,"author":[{"id":"4DD40360-F248-11E8-B48F-1D18A9856A87","full_name":"Sperl, Georg","last_name":"Sperl","first_name":"Georg"},{"first_name":"Rosa M.","last_name":"Sánchez-Banderas","full_name":"Sánchez-Banderas, Rosa M."},{"last_name":"Li","full_name":"Li, Manwen","first_name":"Manwen"},{"last_name":"Wojtan","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J"},{"full_name":"Otaduy, Miguel A.","last_name":"Otaduy","first_name":"Miguel A."}],"intvolume":"        41","volume":41,"doi":"10.1145/3528223.3530167","day":"22","department":[{"_id":"ChWo"}],"publication_status":"published","month":"07","related_material":{"record":[{"relation":"dissertation_contains","id":"12358","status":"public"}],"link":[{"url":"https://ista.ac.at/en/news/digital-yarn-real-socks/","relation":"press_release","description":"News on the ISTA website"}]},"language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"citation":{"chicago":"Sperl, Georg, Rosa M. Sánchez-Banderas, Manwen Li, Chris Wojtan, and Miguel A. Otaduy. “Estimation of Yarn-Level Simulation Models for Production Fabrics.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530167\">https://doi.org/10.1145/3528223.3530167</a>.","short":"G. Sperl, R.M. Sánchez-Banderas, M. Li, C. Wojtan, M.A. Otaduy, ACM Transactions on Graphics 41 (2022).","mla":"Sperl, Georg, et al. “Estimation of Yarn-Level Simulation Models for Production Fabrics.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 65, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530167\">10.1145/3528223.3530167</a>.","ista":"Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. 2022. Estimation of yarn-level simulation models for production fabrics. ACM Transactions on Graphics. 41(4), 65.","ieee":"G. Sperl, R. M. Sánchez-Banderas, M. Li, C. Wojtan, and M. A. Otaduy, “Estimation of yarn-level simulation models for production fabrics,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","apa":"Sperl, G., Sánchez-Banderas, R. M., Li, M., Wojtan, C., &#38; Otaduy, M. A. (2022). Estimation of yarn-level simulation models for production fabrics. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530167\">https://doi.org/10.1145/3528223.3530167</a>","ama":"Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. Estimation of yarn-level simulation models for production fabrics. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530167\">10.1145/3528223.3530167</a>"},"main_file_link":[{"url":"https://doi.org/10.1145/3528223.3530167","open_access":"1"}],"status":"public","acknowledgement":"We wish to thank the anonymous reviewers for their helpful comments. To develop this project, we were helped by many people both at Under Armour (Clay Dean, Randall Harward, Kyle Blakely, Craig Simile, Michael Seiz, Brooke Malone, Brittainy McFarland, Emilie Phan, Lindsey Kern, Courtney Oswald, Haley Barkley, Bob Chin, Adam Bayer, Connie Kwok, Marielle Newman, Nick Pence, Allison Hicks, Allison White, Candace Rubenstein, Jeremy Stangland, Fred Fagergren, Michael Mazzoleni, Nathaniel Berry, Manuel Frank) and SEDDI (Gabriel Cirio, Alejandro Rodríguez, Sofía Dominguez, Alicia Nicas, Elena Garcés, Daniel Rodríguez, David Pascual, Manuel Godoy, Sergio Suja, Sergio Ruiz, Roberto Condori, Alberto Martín, Graham Sullivan). We also thank the members of the Visual Computing Group at IST Austria and the Multimodal Simulation Lab at URJC for their feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing, and it was funded in part by the European Research Council (ERC Consolidator Grant 772738 TouchDesign).","scopus_import":"1","title":"Estimation of yarn-level simulation models for production fabrics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","oa":1,"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"publication":"ACM Transactions on Graphics","date_created":"2022-08-07T22:01:58Z","abstract":[{"text":"This paper introduces a methodology for inverse-modeling of yarn-level mechanics of cloth, based on the mechanical response of fabrics in the real world. We compiled a database from physical tests of several different knitted fabrics used in the textile industry. These data span different types of complex knit patterns, yarn compositions, and fabric finishes, and the results demonstrate diverse physical properties like stiffness, nonlinearity, and anisotropy.\r\n\r\nWe then develop a system for approximating these mechanical responses with yarn-level cloth simulation. To do so, we introduce an efficient pipeline for converting between fabric-level data and yarn-level simulation, including a novel swatch-level approximation for speeding up computation, and some small-but-necessary extensions to yarn-level models used in computer graphics. The dataset used for this paper can be found at http://mslab.es/projects/YarnLevelFabrics.","lang":"eng"}],"date_updated":"2026-06-18T17:20:41Z","type":"journal_article"},{"oa":1,"has_accepted_license":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Hidden degrees of freedom in implicit vortex filaments","article_type":"original","type":"journal_article","date_updated":"2026-04-07T12:02:23Z","file_date_updated":"2023-01-30T07:15:48Z","publication":"ACM Transactions on Graphics","date_created":"2023-01-29T23:00:59Z","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"abstract":[{"lang":"eng","text":"This paper presents a new representation of curve dynamics, with applications to vortex filaments in fluid dynamics. Instead of representing these filaments with explicit curve geometry and Lagrangian equations of motion, we represent curves implicitly with a new co-dimensional 2 level set description. Our implicit representation admits several redundant mathematical degrees of freedom in both the configuration and the dynamics of the curves, which can be tailored specifically to improve numerical robustness, in contrast to naive approaches for implicit curve dynamics that suffer from overwhelming numerical stability problems. Furthermore, we note how these hidden degrees of freedom perfectly map to a Clebsch representation in fluid dynamics. Motivated by these observations, we introduce untwisted level set functions and non-swirling dynamics which successfully regularize sources of numerical instability, particularly in the twisting modes around curve filaments. A consequence is a novel simulation method which produces stable dynamics for large numbers of interacting vortex filaments and effortlessly handles topological changes and re-connection events."}],"oa_version":"Published Version","quality_controlled":"1","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"ChWo"}],"day":"01","doi":"10.1145/3550454.3555459","related_material":{"record":[{"id":"20551","relation":"dissertation_contains","status":"public"}]},"month":"12","acknowledgement":"We thank the visual computing group at IST Austria for their valuable discussions and feedback. Houdini Education licenses were provided by SideFX software. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).","scopus_import":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"date_updated":"2023-01-30T07:15:48Z","file_size":15551202,"creator":"dernst","date_created":"2023-01-30T07:15:48Z","file_id":"12433","file_name":"2022_ACM_Ishida.pdf","content_type":"application/pdf","relation":"main_file","checksum":"a2fba257fdefe0e747182be6c0f7c70c","success":1,"access_level":"open_access"}],"citation":{"ieee":"S. Ishida, C. Wojtan, and A. Chern, “Hidden degrees of freedom in implicit vortex filaments,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 6. Association for Computing Machinery, 2022.","apa":"Ishida, S., Wojtan, C., &#38; Chern, A. (2022). Hidden degrees of freedom in implicit vortex filaments. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3550454.3555459\">https://doi.org/10.1145/3550454.3555459</a>","ama":"Ishida S, Wojtan C, Chern A. Hidden degrees of freedom in implicit vortex filaments. <i>ACM Transactions on Graphics</i>. 2022;41(6). doi:<a href=\"https://doi.org/10.1145/3550454.3555459\">10.1145/3550454.3555459</a>","mla":"Ishida, Sadashige, et al. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 6, 241, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3550454.3555459\">10.1145/3550454.3555459</a>.","short":"S. Ishida, C. Wojtan, A. Chern, ACM Transactions on Graphics 41 (2022).","chicago":"Ishida, Sadashige, Chris Wojtan, and Albert Chern. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3550454.3555459\">https://doi.org/10.1145/3550454.3555459</a>.","ista":"Ishida S, Wojtan C, Chern A. 2022. Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. 41(6), 241."},"status":"public","author":[{"orcid":"0000-0002-3121-3100","first_name":"Sadashige","full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","last_name":"Ishida"},{"last_name":"Wojtan","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J"},{"first_name":"Albert","last_name":"Chern","full_name":"Chern, Albert"}],"isi":1,"issue":"6","_id":"12431","external_id":{"isi":["000891651900061"]},"volume":41,"intvolume":"        41","article_processing_charge":"No","date_published":"2022-12-01T00:00:00Z","year":"2022","article_number":"241","ddc":["000"],"project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"publisher":"Association for Computing Machinery"},{"year":"2022","article_number":"32","publisher":"Association for Computing Machinery","article_processing_charge":"No","date_published":"2022-03-09T00:00:00Z","volume":41,"intvolume":"        41","author":[{"last_name":"Zhao","id":"fb7f793a-80d1-11eb-8869-d56e5b2a8ff4","full_name":"Zhao, Haisen","first_name":"Haisen","orcid":"0000-0002-6389-1045"},{"first_name":"Max","last_name":"Willsey","full_name":"Willsey, Max"},{"last_name":"Zhu","full_name":"Zhu, Amy","first_name":"Amy"},{"first_name":"Chandrakana","last_name":"Nandi","full_name":"Nandi, Chandrakana"},{"full_name":"Tatlock, Zachary","last_name":"Tatlock","first_name":"Zachary"},{"last_name":"Solomon","full_name":"Solomon, Justin","first_name":"Justin"},{"full_name":"Schulz, Adriana","last_name":"Schulz","first_name":"Adriana"}],"issue":"3","_id":"17065","external_id":{"arxiv":["2107.12265"]},"acknowledgement":"The authors would like to thank anonymous reviewers for their helpful feedback; Haomiao Wu for her contribution to the algorithm development in the early stage of the project; Elias Baldwin, David Tsay, Alexander Lefort, and Qiyang Tan for helping the experiments.","scopus_import":"1","citation":{"apa":"Zhao, H., Willsey, M., Zhu, A., Nandi, C., Tatlock, Z., Solomon, J., &#38; Schulz, A. (2022). Co-optimization of design and fabrication plans for carpentry. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3508499\">https://doi.org/10.1145/3508499</a>","ama":"Zhao H, Willsey M, Zhu A, et al. Co-optimization of design and fabrication plans for carpentry. <i>ACM Transactions on Graphics</i>. 2022;41(3). doi:<a href=\"https://doi.org/10.1145/3508499\">10.1145/3508499</a>","ieee":"H. Zhao <i>et al.</i>, “Co-optimization of design and fabrication plans for carpentry,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 3. Association for Computing Machinery, 2022.","ista":"Zhao H, Willsey M, Zhu A, Nandi C, Tatlock Z, Solomon J, Schulz A. 2022. Co-optimization of design and fabrication plans for carpentry. ACM Transactions on Graphics. 41(3), 32.","short":"H. Zhao, M. Willsey, A. Zhu, C. Nandi, Z. Tatlock, J. Solomon, A. Schulz, ACM Transactions on Graphics 41 (2022).","mla":"Zhao, Haisen, et al. “Co-Optimization of Design and Fabrication Plans for Carpentry.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 3, 32, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3508499\">10.1145/3508499</a>.","chicago":"Zhao, Haisen, Max Willsey, Amy Zhu, Chandrakana Nandi, Zachary Tatlock, Justin Solomon, and Adriana Schulz. “Co-Optimization of Design and Fabrication Plans for Carpentry.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3508499\">https://doi.org/10.1145/3508499</a>."},"status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2107.12265","open_access":"1"}],"quality_controlled":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"arxiv":1,"publication_status":"published","department":[{"_id":"BeBi"}],"doi":"10.1145/3508499","day":"09","month":"03","type":"journal_article","date_updated":"2024-08-06T07:03:14Z","date_created":"2024-05-29T06:09:23Z","publication":"ACM Transactions on Graphics","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"abstract":[{"text":"Past work on optimizing fabrication plans given a carpentry design can provide Pareto-optimal plans trading off between material waste, fabrication time, precision, and other considerations. However, when developing fabrication plans, experts rarely restrict to a single design, instead considering families of design variations, sometimes adjusting designs to simplify fabrication. Jointly exploring the design and fabrication plan spaces for each design is intractable using current techniques. We present a new approach to jointly optimize design and fabrication plans for carpentered objects. To make this bi-level optimization tractable, we adapt recent work from program synthesis based on equality graphs (e-graphs), which encode sets of equivalent programs. Our insight is that subproblems within our bi-level problem share significant substructures. By representing both designs and fabrication plans in a new bag of parts (BOP) e-graph, we amortize the cost of optimizing design components shared among multiple candidates. Even using BOP e-graphs, the optimization space grows quickly in practice. Hence, we also show how a feedback-guided search strategy dubbed Iterative Contraction and Expansion on E-graphs (ICEE) can keep the size of the e-graph manageable and direct the search towards promising candidates. We illustrate the advantages of our pipeline through examples from the carpentry domain.","lang":"eng"}],"oa":1,"title":"Co-optimization of design and fabrication plans for carpentry","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original"},{"author":[{"first_name":"Yingying","full_name":"Ren, Yingying","id":"93d68d10-3540-11ef-a265-f748a50dba3d","last_name":"Ren"},{"first_name":"Uday","full_name":"Kusupati, Uday","last_name":"Kusupati"},{"first_name":"Julian","last_name":"Panetta","full_name":"Panetta, Julian"},{"first_name":"Florin","full_name":"Isvoranu, Florin","last_name":"Isvoranu"},{"first_name":"Davide","full_name":"Pellis, Davide","last_name":"Pellis"},{"first_name":"Tian","last_name":"Chen","full_name":"Chen, Tian"},{"full_name":"Pauly, Mark","last_name":"Pauly","first_name":"Mark"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Umbrella meshes: Elastic mechanisms for freeform shape deployment","extern":"1","_id":"17383","issue":"4","article_type":"original","type":"journal_article","date_updated":"2024-08-12T09:40:49Z","volume":41,"publication":"ACM Transactions on Graphics","date_created":"2024-08-05T06:30:07Z","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"intvolume":"        41","abstract":[{"text":"We present a computational inverse design framework for a new class of volumetric deployable structures that have compact rest states and deploy into bending-active 3D target surfaces. Umbrella meshes consist of elastic beams, rigid plates, and hinge joints that can be directly printed or assembled in a zero-energy fabrication state. During deployment, as the elastic beams of varying heights rotate from vertical to horizontal configurations, the entire structure transforms from a compact block into a target curved surface. Umbrella Meshes encode both intrinsic and extrinsic curvature of the target surface and in principle are free from the area expansion ratio bounds of past auxetic material systems.\r\nWe build a reduced physics-based simulation framework to accurately and efficiently model the complex interaction between the elastically deforming components. To determine the mesh topology and optimal shape parameters for approximating a given target surface, we propose an inverse design optimization algorithm initialized with conformal flattening. Our algorithm minimizes the structure's strain energy in its deployed state and optimizes actuation forces so that the final deployed structure is in stable equilibrium close to the desired surface with few or no external constraints. We validate our approach by fabricating a series of physical models at various scales using different manufacturing techniques.","lang":"eng"}],"oa_version":"None","language":[{"iso":"eng"}],"quality_controlled":"1","page":"1-15","article_processing_charge":"No","publication_status":"published","doi":"10.1145/3528223.3530089","day":"22","date_published":"2022-07-22T00:00:00Z","month":"07","year":"2022","scopus_import":"1","citation":{"ama":"Ren Y, Kusupati U, Panetta J, et al. Umbrella meshes: Elastic mechanisms for freeform shape deployment. <i>ACM Transactions on Graphics</i>. 2022;41(4):1-15. doi:<a href=\"https://doi.org/10.1145/3528223.3530089\">10.1145/3528223.3530089</a>","apa":"Ren, Y., Kusupati, U., Panetta, J., Isvoranu, F., Pellis, D., Chen, T., &#38; Pauly, M. (2022). Umbrella meshes: Elastic mechanisms for freeform shape deployment. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530089\">https://doi.org/10.1145/3528223.3530089</a>","ieee":"Y. Ren <i>et al.</i>, “Umbrella meshes: Elastic mechanisms for freeform shape deployment,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, pp. 1–15, 2022.","ista":"Ren Y, Kusupati U, Panetta J, Isvoranu F, Pellis D, Chen T, Pauly M. 2022. Umbrella meshes: Elastic mechanisms for freeform shape deployment. ACM Transactions on Graphics. 41(4), 1–15.","mla":"Ren, Yingying, et al. “Umbrella Meshes: Elastic Mechanisms for Freeform Shape Deployment.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, Association for Computing Machinery, 2022, pp. 1–15, doi:<a href=\"https://doi.org/10.1145/3528223.3530089\">10.1145/3528223.3530089</a>.","chicago":"Ren, Yingying, Uday Kusupati, Julian Panetta, Florin Isvoranu, Davide Pellis, Tian Chen, and Mark Pauly. “Umbrella Meshes: Elastic Mechanisms for Freeform Shape Deployment.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530089\">https://doi.org/10.1145/3528223.3530089</a>.","short":"Y. Ren, U. Kusupati, J. Panetta, F. Isvoranu, D. Pellis, T. Chen, M. Pauly, ACM Transactions on Graphics 41 (2022) 1–15."},"status":"public","publisher":"Association for Computing Machinery"},{"isi":1,"author":[{"first_name":"Thomas","last_name":"Alderighi","full_name":"Alderighi, Thomas"},{"full_name":"Malomo, Luigi","last_name":"Malomo","first_name":"Luigi"},{"orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Paolo","full_name":"Cignoni, Paolo","last_name":"Cignoni"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"}],"issue":"6","_id":"10184","external_id":{"isi":["000729846700077"]},"volume":40,"intvolume":"        40","article_processing_charge":"No","date_published":"2021-12-01T00:00:00Z","year":"2021","article_number":"272","ddc":["000"],"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767"}],"publisher":"Association for Computing Machinery","has_accepted_license":"1","oa":1,"title":"Volume decomposition for two-piece rigid casting","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","type":"journal_article","date_updated":"2025-04-14T07:28:57Z","file_date_updated":"2021-10-27T07:08:07Z","publication":"ACM Transactions on Graphics","date_created":"2021-10-27T07:08:19Z","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368 "]},"abstract":[{"lang":"eng","text":"We introduce a novel technique to automatically decompose an input object’s volume into a set of parts that can be represented by two opposite height fields. Such decomposition enables the manufacturing of individual parts using two-piece reusable rigid molds. Our decomposition strategy relies on a new energy formulation that utilizes a pre-computed signal on the mesh volume representing the accessibility for a predefined set of extraction directions. Thanks to this novel formulation, our method allows for efficient optimization of a fabrication-aware partitioning of volumes in a completely\r\nautomatic way. We demonstrate the efficacy of our approach by generating valid volume partitionings for a wide range of complex objects and physically reproducing several of them."}],"language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Submitted Version","department":[{"_id":"BeBi"}],"publication_status":"published","ec_funded":1,"day":"01","doi":"10.1145/3478513.3480555","month":"12","scopus_import":"1","acknowledgement":"The authors thank Marco Callieri for all his precious help with the resin casts. The models used in the paper are courtesy of the Stanford 3D Scanning Repository, the AIM@SHAPE Shape Repository, and Thingi10K Repository. The research was partially funded by the European Research Council (ERC) MATERIALIZABLE: Intelligent fabrication-oriented computational design and modeling (grant no. 715767).","file":[{"access_level":"open_access","checksum":"384ece7a9ad1026787ba9560b04336d5","relation":"main_file","content_type":"application/pdf","file_name":"rigidmolds-authorversion.pdf","date_created":"2021-10-27T07:08:07Z","file_id":"10185","creator":"bbickel","file_size":107708317,"date_updated":"2021-10-27T07:08:07Z"}],"citation":{"apa":"Alderighi, T., Malomo, L., Bickel, B., Cignoni, P., &#38; Pietroni, N. (2021). Volume decomposition for two-piece rigid casting. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3478513.3480555\">https://doi.org/10.1145/3478513.3480555</a>","ama":"Alderighi T, Malomo L, Bickel B, Cignoni P, Pietroni N. Volume decomposition for two-piece rigid casting. <i>ACM Transactions on Graphics</i>. 2021;40(6). doi:<a href=\"https://doi.org/10.1145/3478513.3480555\">10.1145/3478513.3480555</a>","ieee":"T. Alderighi, L. Malomo, B. Bickel, P. Cignoni, and N. Pietroni, “Volume decomposition for two-piece rigid casting,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 6. Association for Computing Machinery, 2021.","ista":"Alderighi T, Malomo L, Bickel B, Cignoni P, Pietroni N. 2021. Volume decomposition for two-piece rigid casting. ACM Transactions on Graphics. 40(6), 272.","mla":"Alderighi, Thomas, et al. “Volume Decomposition for Two-Piece Rigid Casting.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 6, 272, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3478513.3480555\">10.1145/3478513.3480555</a>.","short":"T. Alderighi, L. Malomo, B. Bickel, P. Cignoni, N. Pietroni, ACM Transactions on Graphics 40 (2021).","chicago":"Alderighi, Thomas, Luigi Malomo, Bernd Bickel, Paolo Cignoni, and Nico Pietroni. “Volume Decomposition for Two-Piece Rigid Casting.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3478513.3480555\">https://doi.org/10.1145/3478513.3480555</a>."},"main_file_link":[{"open_access":"1","url":"http://vcg.isti.cnr.it/Publications/2021/AMBCP21"}],"status":"public"}]