[{"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20276"}]},"arxiv":1,"date_published":"2025-02-01T00:00:00Z","type":"journal_article","fulldoi":"https://doi.org/10.1111/cgf.15269","das_tickbox":"0","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"BeBi"}],"OA_type":"hybrid","OA_place":"publisher","month":"02","article_processing_charge":"Yes (via OA deal)","article_number":"e15269","external_id":{"arxiv":["2408.06944"],"isi":["001357046100001"]},"date_created":"2024-11-19T09:14:32Z","isi":1,"_id":"18565","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","quality_controlled":"1","has_accepted_license":"1","doi":"10.1111/cgf.15269","year":"2025","title":"Mesh simplification for unfolding","date_updated":"2026-10-02T11:13:08Z","author":[{"full_name":"Bhargava, Manas","last_name":"Bhargava","orcid":"0009-0007-6138-6890","first_name":"Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425"},{"last_name":"Schreck","full_name":"Schreck, Camille","first_name":"Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87"},{"first_name":"M.","full_name":"Freire, M.","last_name":"Freire"},{"full_name":"Hugron, P. A.","last_name":"Hugron","first_name":"P. A."},{"first_name":"S.","full_name":"Lefebvre, S.","last_name":"Lefebvre"},{"full_name":"Sellán, S.","last_name":"Sellán","first_name":"S."},{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel","full_name":"Bickel, Bernd"}],"oa":1,"corr_author":"1","publisher":"Wiley","intvolume":"        44","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png"},"oa_version":"Published Version","issue":"1","acknowledgement":"Researchers from INRIA received support from the DORNELL Inria Challenge. Silvia Sellán acknowledges support from NSERC Vanier Doctoral Scholarship and an MIT SoE Postdoctoral Fellowship for Engineering Excellence.","language":[{"iso":"eng"}],"file_date_updated":"2025-04-16T09:06:45Z","file":[{"content_type":"video/mp4","file_name":"Mesh_Simplification_For_Unfolding_cgf_submission_supplemental_video.mp4","checksum":"34acdd9bfbe43f00eb6c7656afef3ac6","date_created":"2024-11-19T09:23:20Z","file_size":36999751,"relation":"main_file","file_id":"18567","creator":"mbhargav","access_level":"open_access","success":1,"date_updated":"2024-11-19T09:23:20Z"},{"date_updated":"2025-04-16T09:06:45Z","success":1,"access_level":"open_access","creator":"dernst","relation":"main_file","file_id":"19576","file_size":5188265,"date_created":"2025-04-16T09:06:45Z","checksum":"efb06b01bae37f470954601bc004374d","file_name":"2025_CompGraphicsForum_Bhargava.pdf","content_type":"application/pdf"}],"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"keyword":["fabrication","single patch unfolding","mesh simplification"],"citation":{"ama":"Bhargava M, Schreck C, Freire M, et al. Mesh simplification for unfolding. <i>Computer Graphics Forum</i>. 2025;44(1). doi:<a href=\"https://doi.org/10.1111/cgf.15269\">10.1111/cgf.15269</a>","ista":"Bhargava M, Schreck C, Freire M, Hugron PA, Lefebvre S, Sellán S, Bickel B. 2025. Mesh simplification for unfolding. Computer Graphics Forum. 44(1), e15269.","mla":"Bhargava, Manas, et al. “Mesh Simplification for Unfolding.” <i>Computer Graphics Forum</i>, vol. 44, no. 1, e15269, Wiley, 2025, doi:<a href=\"https://doi.org/10.1111/cgf.15269\">10.1111/cgf.15269</a>.","apa":"Bhargava, M., Schreck, C., Freire, M., Hugron, P. A., Lefebvre, S., Sellán, S., &#38; Bickel, B. (2025). Mesh simplification for unfolding. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.15269\">https://doi.org/10.1111/cgf.15269</a>","short":"M. Bhargava, C. Schreck, M. Freire, P.A. Hugron, S. Lefebvre, S. Sellán, B. Bickel, Computer Graphics Forum 44 (2025).","chicago":"Bhargava, Manas, Camille Schreck, M. Freire, P. A. Hugron, S. Lefebvre, S. Sellán, and Bernd Bickel. “Mesh Simplification for Unfolding.” <i>Computer Graphics Forum</i>. Wiley, 2025. <a href=\"https://doi.org/10.1111/cgf.15269\">https://doi.org/10.1111/cgf.15269</a>.","ieee":"M. Bhargava <i>et al.</i>, “Mesh simplification for unfolding,” <i>Computer Graphics Forum</i>, vol. 44, no. 1. Wiley, 2025."},"researchdata_availability":"no","day":"01","article_type":"original","scopus_import":"1","volume":44,"supplementarymaterial":"yes","abstract":[{"lang":"eng","text":"We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing for map distortions or multiple patches. Instead, we propose a geometric relaxation of the problem: We modify the input shape until it admits an overlap‐free unfolding. We achieve this by locally displacing vertices and collapsing edges, guided by the unfolding process. We validate our algorithm quantitatively and qualitatively on a large dataset of complex shapes and show its proficiency by fabricating real shapes from paper."}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","publication":"Computer Graphics Forum","ddc":["006"]},{"language":[{"iso":"eng"}],"acknowledgement":"This work was supported by the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No.: CUHK 14201921] and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 715767 – MATERIALIZABLE). We thank the anonymous reviewers for their insightful feedback; Christian Hafner for proofreading and discussions; Ziqi Wang,\r\nHaisen Zhao, and Martin Hafskjold Thoresen for the helpful discussions; and the Miba Machine Shop at IST Austria for 3D printing the BUNNY and BOOMERANG models.","issue":"2","oa_version":"Submitted Version","citation":{"short":"Z. Liu, J. Hu, H. Xu, P. Song, R. Zhang, B. Bickel, C.-W. Fu, Computer Graphics Forum 41 (2022) 507–519.","apa":"Liu, Z., Hu, J., Xu, H., Song, P., Zhang, R., Bickel, B., &#38; Fu, C.-W. (2022). Worst-case rigidity analysis and optimization for assemblies with mechanical joints. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14490\">https://doi.org/10.1111/cgf.14490</a>","chicago":"Liu, Zhenyuan, Jingyu Hu, Hao Xu, Peng Song, Ran Zhang, Bernd Bickel, and Chi-Wing Fu. “Worst-Case Rigidity Analysis and Optimization for Assemblies with Mechanical Joints.” <i>Computer Graphics Forum</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/cgf.14490\">https://doi.org/10.1111/cgf.14490</a>.","ieee":"Z. Liu <i>et al.</i>, “Worst-case rigidity analysis and optimization for assemblies with mechanical joints,” <i>Computer Graphics Forum</i>, vol. 41, no. 2. Wiley, pp. 507–519, 2022.","ama":"Liu Z, Hu J, Xu H, et al. Worst-case rigidity analysis and optimization for assemblies with mechanical joints. <i>Computer Graphics Forum</i>. 2022;41(2):507-519. doi:<a href=\"https://doi.org/10.1111/cgf.14490\">10.1111/cgf.14490</a>","mla":"Liu, Zhenyuan, et al. “Worst-Case Rigidity Analysis and Optimization for Assemblies with Mechanical Joints.” <i>Computer Graphics Forum</i>, vol. 41, no. 2, Wiley, 2022, pp. 507–19, doi:<a href=\"https://doi.org/10.1111/cgf.14490\">10.1111/cgf.14490</a>.","ista":"Liu Z, Hu J, Xu H, Song P, Zhang R, Bickel B, Fu C-W. 2022. Worst-case rigidity analysis and optimization for assemblies with mechanical joints. Computer Graphics Forum. 41(2), 507–519."},"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"file":[{"date_updated":"2022-03-27T17:34:11Z","access_level":"open_access","creator":"bbickel","relation":"main_file","file_id":"10923","file_size":19601689,"date_created":"2022-03-27T17:34:11Z","checksum":"b62188b07f5c000f1638c782ec92da41","file_name":"paper.pdf","content_type":"application/pdf"}],"file_date_updated":"2022-03-27T17:34:11Z","abstract":[{"lang":"eng","text":"We study structural rigidity for assemblies with mechanical joints. Existing methods identify whether an assembly is structurally rigid by assuming parts are perfectly rigid. Yet, an assembly identified as rigid may not be that “rigid” in practice, and existing methods cannot quantify how rigid an assembly is. We address this limitation by developing a new measure, worst-case rigidity, to quantify the rigidity of an assembly as the largest possible deformation that the assembly undergoes for arbitrary external loads of fixed magnitude. Computing worst-case rigidity is non-trivial due to non-rigid parts and different joint types. We thus formulate a new computational approach by encoding parts and their connections into a stiffness matrix, in which parts are modeled as deformable objects and joints as soft constraints. Based on this, we formulate worst-case rigidity analysis as an optimization that seeks the worst-case deformation of an assembly for arbitrary external loads, and solve the optimization problem via an eigenanalysis. Furthermore, we present methods to optimize the geometry and topology of various assemblies to enhance their rigidity, as guided by our rigidity measure. In the end, we validate our method on a variety of assembly structures with physical experiments and demonstrate its effectiveness by designing and fabricating several structurally rigid assemblies."}],"volume":41,"scopus_import":"1","article_type":"original","day":"01","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020"}],"ddc":["000"],"publication":"Computer Graphics Forum","page":"507-519","ec_funded":1,"fulldoi":"https://doi.org/10.1111/cgf.14490","type":"journal_article","date_published":"2022-05-01T00:00:00Z","date_created":"2022-03-27T17:34:17Z","external_id":{"isi":["000802723900039"]},"article_processing_charge":"No","month":"05","department":[{"_id":"BeBi"}],"publication_status":"published","acknowledged_ssus":[{"_id":"M-Shop"}],"date_updated":"2025-04-14T07:28:57Z","title":"Worst-case rigidity analysis and optimization for assemblies with mechanical joints","year":"2022","doi":"10.1111/cgf.14490","has_accepted_license":"1","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","_id":"10922","isi":1,"intvolume":"        41","publisher":"Wiley","author":[{"orcid":"0000-0001-9200-5690","id":"70f0d7cf-ae65-11ec-a14f-89dfc5505b19","first_name":"Zhenyuan","full_name":"Liu, Zhenyuan","last_name":"Liu"},{"first_name":"Jingyu","last_name":"Hu","full_name":"Hu, Jingyu"},{"last_name":"Xu","full_name":"Xu, Hao","first_name":"Hao"},{"last_name":"Song","full_name":"Song, Peng","first_name":"Peng"},{"first_name":"Ran","last_name":"Zhang","full_name":"Zhang, Ran"},{"full_name":"Bickel, Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"full_name":"Fu, Chi-Wing","last_name":"Fu","first_name":"Chi-Wing"}],"oa":1},{"publication":"Computer Graphics Forum","page":"343-353","ec_funded":1,"volume":41,"abstract":[{"text":"This paper proposes a method for simulating liquids in large bodies of water by coupling together a water surface wave simulator with a 3D Navier-Stokes simulator. The surface wave simulation uses the equivalent sources method (ESM) to efficiently animate large bodies of water with precisely controllable wave propagation behavior. The 3D liquid simulator animates complex non-linear fluid behaviors like splashes and breaking waves using off-the-shelf simulators using FLIP or the level set method with semi-Lagrangian advection.\r\nWe combine the two approaches by using the 3D solver to animate localized non-linear behaviors, and the 2D wave solver to animate larger regions with linear surface physics. We use the surface motion from the 3D solver as boundary conditions for 2D surface wave simulator, and we use the velocity and surface heights from the 2D surface wave simulator as boundary conditions for the 3D fluid simulation. We also introduce a novel technique for removing visual artifacts caused by numerical errors in 3D fluid solvers: we use experimental data to estimate the artificial dispersion caused by the 3D solver and we then carefully tune the wave speeds of the 2D solver to match it, effectively eliminating any differences in wave behavior across the boundary. To the best of our knowledge, this is the first time such a empirically driven error compensation approach has been used to remove coupling errors from a physics simulator.\r\nOur coupled simulation approach leverages the strengths of each simulation technique, animating large environments with seamless transitions between 2D and 3D physics.","lang":"eng"}],"day":"01","article_type":"original","scopus_import":"1","project":[{"call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"citation":{"ista":"Schreck C, Wojtan C. 2022. Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method. Computer Graphics Forum. 41(2), 343–353.","mla":"Schreck, Camille, and Chris Wojtan. “Coupling 3D Liquid Simulation with 2D Wave Propagation for Large Scale Water Surface Animation Using the Equivalent Sources Method.” <i>Computer Graphics Forum</i>, vol. 41, no. 2, Wiley, 2022, pp. 343–53, doi:<a href=\"https://doi.org/10.1111/cgf.14478\">10.1111/cgf.14478</a>.","ama":"Schreck C, Wojtan C. Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method. <i>Computer Graphics Forum</i>. 2022;41(2):343-353. doi:<a href=\"https://doi.org/10.1111/cgf.14478\">10.1111/cgf.14478</a>","ieee":"C. Schreck and C. Wojtan, “Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method,” <i>Computer Graphics Forum</i>, vol. 41, no. 2. Wiley, pp. 343–353, 2022.","chicago":"Schreck, Camille, and Chris Wojtan. “Coupling 3D Liquid Simulation with 2D Wave Propagation for Large Scale Water Surface Animation Using the Equivalent Sources Method.” <i>Computer Graphics Forum</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/cgf.14478\">https://doi.org/10.1111/cgf.14478</a>.","apa":"Schreck, C., &#38; Wojtan, C. (2022). Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14478\">https://doi.org/10.1111/cgf.14478</a>","short":"C. Schreck, C. Wojtan, Computer Graphics Forum 41 (2022) 343–353."},"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"language":[{"iso":"eng"}],"issue":"2","acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria and MFX Team at INRIA for their valuable feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176.","oa_version":"Submitted Version","intvolume":"        41","publisher":"Wiley","author":[{"full_name":"Schreck, Camille","last_name":"Schreck","id":"2B14B676-F248-11E8-B48F-1D18A9856A87","first_name":"Camille"},{"last_name":"Wojtan","full_name":"Wojtan, Christopher J","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546"}],"oa":1,"corr_author":"1","doi":"10.1111/cgf.14478","date_updated":"2024-10-22T09:58:19Z","title":"Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method","year":"2022","acknowledged_ssus":[{"_id":"ScienComp"}],"status":"public","quality_controlled":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"11432","isi":1,"date_created":"2022-06-05T22:01:49Z","external_id":{"isi":["000802723900027"]},"department":[{"_id":"ChWo"}],"month":"05","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-03641349/"}],"publication_status":"published","fulldoi":"https://doi.org/10.1111/cgf.14478","date_published":"2022-05-01T00:00:00Z","type":"journal_article"},{"external_id":{"isi":["000842638900001"]},"date_created":"2022-08-28T18:17:01Z","publication_status":"published","department":[{"_id":"BeBi"}],"article_processing_charge":"No","month":"09","fulldoi":"https://doi.org/10.1111/cgf.14581","type":"journal_article","date_published":"2022-09-01T00:00:00Z","corr_author":"1","oa":1,"author":[{"last_name":"Alderighi","full_name":"Alderighi, Thomas","first_name":"Thomas"},{"first_name":"Luigi","full_name":"Malomo, Luigi","last_name":"Malomo"},{"last_name":"Auzinger","full_name":"Auzinger, Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0002-1546-3265"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bickel, Bernd","last_name":"Bickel"},{"full_name":"Cignoni, Paulo","last_name":"Cignoni","first_name":"Paulo"},{"full_name":"Pietroni, Nico","last_name":"Pietroni","first_name":"Nico"}],"publisher":"Wiley","intvolume":"        41","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","has_accepted_license":"1","status":"public","quality_controlled":"1","doi":"10.1111/cgf.14581","year":"2022","title":"State of the art in computational mould design","date_updated":"2024-10-09T21:03:21Z","isi":1,"_id":"11993","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"keyword":["Computer Graphics and Computer-Aided Design"],"citation":{"apa":"Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P., &#38; Pietroni, N. (2022). State of the art in computational mould design. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>","short":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, N. Pietroni, Computer Graphics Forum 41 (2022) 435–452.","chicago":"Alderighi, Thomas, Luigi Malomo, Thomas Auzinger, Bernd Bickel, Paulo Cignoni, and Nico Pietroni. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>.","ieee":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, and N. Pietroni, “State of the art in computational mould design,” <i>Computer Graphics Forum</i>, vol. 41, no. 6. Wiley, pp. 435–452, 2022.","ama":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. State of the art in computational mould design. <i>Computer Graphics Forum</i>. 2022;41(6):435-452. doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>","ista":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. 2022. State of the art in computational mould design. Computer Graphics Forum. 41(6), 435–452.","mla":"Alderighi, Thomas, et al. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>, vol. 41, no. 6, Wiley, 2022, pp. 435–52, doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>."},"file_date_updated":"2022-08-28T18:18:08Z","file":[{"date_updated":"2022-08-28T18:18:08Z","title":"pre-peer reviewed version","access_level":"open_access","creator":"bbickel","file_size":32480850,"file_id":"11994","description":"This is the pre-peer reviewed version of the following article: Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P. and Pietroni, N. (2022), State of the Art in Computational Mould Design. Computer Graphics Forum, which has been published in final form at https://doi.org/10.1111/cgf.14581. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.","relation":"main_file","date_created":"2022-08-28T18:18:08Z","file_name":"star_molding_preprint.pdf","checksum":"c40cc8ceb7b7f0512172b883d712198e","content_type":"application/pdf"}],"issue":"6","language":[{"iso":"eng"}],"oa_version":"Submitted Version","page":"435-452","ddc":["000"],"publication":"Computer Graphics Forum","day":"01","article_type":"original","scopus_import":"1","volume":41,"abstract":[{"text":"Moulding refers to a set of manufacturing techniques in which a mould, usually a cavity or a solid frame, is used to shape a liquid or pliable material into an object of the desired shape. The popularity of moulding comes from its effectiveness, scalability and versatility in terms of employed materials. Its relevance as a fabrication process is demonstrated by the extensive literature covering different aspects related to mould design, from material flow simulation to the automation of mould geometry design. In this state-of-the-art report, we provide an extensive review of the automatic methods for the design of moulds, focusing on contributions from a geometric perspective. We classify existing mould design methods based on their computational approach and the nature of their target moulding process. We summarize the relationships between computational approaches and moulding techniques, highlighting their strengths and limitations. Finally, we discuss potential future research directions.","lang":"eng"}]},{"publisher":"Wiley","intvolume":"        40","author":[{"last_name":"Sietzen","full_name":"Sietzen, Stefan","first_name":"Stefan"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"first_name":"Judy","full_name":"Borowski, Judy","last_name":"Borowski"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"first_name":"Manuela","last_name":"Waldner","full_name":"Waldner, Manuela"}],"oa":1,"isi":1,"_id":"10404","doi":"10.1111/cgf.14418","date_updated":"2025-04-15T06:25:55Z","year":"2021","title":"Interactive analysis of CNN robustness","quality_controlled":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","department":[{"_id":"ToHe"}],"month":"11","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2110.07667"}],"publication_status":"published","date_created":"2021-12-05T23:01:40Z","external_id":{"isi":["000722952000024"],"arxiv":["2110.07667"]},"date_published":"2021-11-27T00:00:00Z","type":"journal_article","arxiv":1,"fulldoi":"https://doi.org/10.1111/cgf.14418","publication":"Computer Graphics Forum","page":"253-264","project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"volume":40,"abstract":[{"lang":"eng","text":"While convolutional neural networks (CNNs) have found wide adoption as state-of-the-art models for image-related tasks, their predictions are often highly sensitive to small input perturbations, which the human vision is robust against. This paper presents Perturber, a web-based application that allows users to instantaneously explore how CNN activations and predictions evolve when a 3D input scene is interactively perturbed. Perturber offers a large variety of scene modifications, such as camera controls, lighting and shading effects, background modifications, object morphing, as well as adversarial attacks, to facilitate the discovery of potential vulnerabilities. Fine-tuned model versions can be directly compared for qualitative evaluation of their robustness. Case studies with machine learning experts have shown that Perturber helps users to quickly generate hypotheses about model vulnerabilities and to qualitatively compare model behavior. Using quantitative analyses, we could replicate users’ insights with other CNN architectures and input images, yielding new insights about the vulnerability of adversarially trained models."}],"day":"27","article_type":"original","scopus_import":"1","citation":{"apa":"Sietzen, S., Lechner, M., Borowski, J., Hasani, R., &#38; Waldner, M. (2021). Interactive analysis of CNN robustness. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14418\">https://doi.org/10.1111/cgf.14418</a>","short":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, M. Waldner, Computer Graphics Forum 40 (2021) 253–264.","ieee":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, and M. Waldner, “Interactive analysis of CNN robustness,” <i>Computer Graphics Forum</i>, vol. 40, no. 7. Wiley, pp. 253–264, 2021.","chicago":"Sietzen, Stefan, Mathias Lechner, Judy Borowski, Ramin Hasani, and Manuela Waldner. “Interactive Analysis of CNN Robustness.” <i>Computer Graphics Forum</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/cgf.14418\">https://doi.org/10.1111/cgf.14418</a>.","ama":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. Interactive analysis of CNN robustness. <i>Computer Graphics Forum</i>. 2021;40(7):253-264. doi:<a href=\"https://doi.org/10.1111/cgf.14418\">10.1111/cgf.14418</a>","ista":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. 2021. Interactive analysis of CNN robustness. Computer Graphics Forum. 40(7), 253–264.","mla":"Sietzen, Stefan, et al. “Interactive Analysis of CNN Robustness.” <i>Computer Graphics Forum</i>, vol. 40, no. 7, Wiley, 2021, pp. 253–64, doi:<a href=\"https://doi.org/10.1111/cgf.14418\">10.1111/cgf.14418</a>."},"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"oa_version":"Preprint","language":[{"iso":"eng"}],"issue":"7","acknowledgement":"We thank Robert Geirhos and Roland Zimmermann for their participation in the case study and valuable feedback, Chris Olah and Nick Cammarata for valuable discussions in the early phase of the project, as well as the Distill Slack workspace as a platform for discussions. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). J.B. is supported by the German Federal Ministry of Education and Research\r\n(BMBF) through the Competence Center for Machine Learning (TUE.AI, FKZ 01IS18039A) and the International Max Planck Research School for Intelligent Systems (IMPRS-IS). R.H. is partially supported by Boeing and Horizon-2020 ECSEL (grant 783163, iDev40).\r\n"},{"date_created":"2021-06-13T22:01:32Z","external_id":{"isi":["000657959600017"]},"department":[{"_id":"BeBi"}],"article_processing_charge":"No","month":"05","publication_status":"published","fulldoi":"https://doi.org/10.1111/cgf.142626","date_published":"2021-05-01T00:00:00Z","type":"journal_article","publisher":"Wiley","intvolume":"        40","oa":1,"author":[{"last_name":"Rittig","full_name":"Rittig, Tobias","first_name":"Tobias"},{"first_name":"Denis","full_name":"Sumin, Denis","last_name":"Sumin"},{"first_name":"Vahid","full_name":"Babaei, Vahid","last_name":"Babaei"},{"full_name":"Didyk, Piotr","last_name":"Didyk","first_name":"Piotr"},{"last_name":"Voloboy","full_name":"Voloboy, Alexey","first_name":"Alexey"},{"full_name":"Wilkie, Alexander","last_name":"Wilkie","first_name":"Alexander"},{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel","full_name":"Bickel, Bernd"},{"first_name":"Karol","last_name":"Myszkowski","full_name":"Myszkowski, Karol"},{"first_name":"Tim","last_name":"Weyrich","full_name":"Weyrich, Tim"},{"last_name":"Křivánek","full_name":"Křivánek, Jaroslav","first_name":"Jaroslav"}],"doi":"10.1111/cgf.142626","year":"2021","date_updated":"2025-03-31T15:58:16Z","title":"Neural acceleration of scattering-aware color 3D printing","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","status":"public","has_accepted_license":"1","isi":1,"_id":"9547","citation":{"ieee":"T. Rittig <i>et al.</i>, “Neural acceleration of scattering-aware color 3D printing,” <i>Computer Graphics Forum</i>, vol. 40, no. 2. Wiley, pp. 205–219, 2021.","chicago":"Rittig, Tobias, Denis Sumin, Vahid Babaei, Piotr Didyk, Alexey Voloboy, Alexander Wilkie, Bernd Bickel, Karol Myszkowski, Tim Weyrich, and Jaroslav Křivánek. “Neural Acceleration of Scattering-Aware Color 3D Printing.” <i>Computer Graphics Forum</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/cgf.142626\">https://doi.org/10.1111/cgf.142626</a>.","short":"T. Rittig, D. Sumin, V. Babaei, P. Didyk, A. Voloboy, A. Wilkie, B. Bickel, K. Myszkowski, T. Weyrich, J. Křivánek, Computer Graphics Forum 40 (2021) 205–219.","apa":"Rittig, T., Sumin, D., Babaei, V., Didyk, P., Voloboy, A., Wilkie, A., … Křivánek, J. (2021). Neural acceleration of scattering-aware color 3D printing. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.142626\">https://doi.org/10.1111/cgf.142626</a>","mla":"Rittig, Tobias, et al. “Neural Acceleration of Scattering-Aware Color 3D Printing.” <i>Computer Graphics Forum</i>, vol. 40, no. 2, Wiley, 2021, pp. 205–19, doi:<a href=\"https://doi.org/10.1111/cgf.142626\">10.1111/cgf.142626</a>.","ista":"Rittig T, Sumin D, Babaei V, Didyk P, Voloboy A, Wilkie A, Bickel B, Myszkowski K, Weyrich T, Křivánek J. 2021. Neural acceleration of scattering-aware color 3D printing. Computer Graphics Forum. 40(2), 205–219.","ama":"Rittig T, Sumin D, Babaei V, et al. Neural acceleration of scattering-aware color 3D printing. <i>Computer Graphics Forum</i>. 2021;40(2):205-219. doi:<a href=\"https://doi.org/10.1111/cgf.142626\">10.1111/cgf.142626</a>"},"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"file":[{"date_updated":"2021-10-11T12:06:50Z","success":1,"access_level":"open_access","creator":"bbickel","relation":"main_file","file_id":"10120","file_size":26026501,"date_created":"2021-10-11T12:06:50Z","checksum":"33271724215f54a75c39d2ed40f2c502","file_name":"ScatteringAwareColor3DPrinting_authorVersion.pdf","content_type":"application/pdf"}],"file_date_updated":"2021-10-11T12:06:50Z","language":[{"iso":"eng"}],"issue":"2","acknowledgement":"We thank Sebastian Cucerca for processing and capturing the phys-cal printouts. This work was supported by the Charles University grant SVV-260588 and Czech Science Foundation grant 19-07626S. This project has received funding from the European Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska Curie grant agreements No 642841 (DISTRO) and No765911 (RealVision), and under the European Research Council grant agreement No 715767 (MATERIALIZABLE).","oa_version":"Submitted Version","ddc":["004"],"publication":"Computer Graphics Forum","page":"205-219","ec_funded":1,"volume":40,"abstract":[{"lang":"eng","text":"With the wider availability of full-color 3D printers, color-accurate 3D-print preparation has received increased attention. A key challenge lies in the inherent translucency of commonly used print materials that blurs out details of the color texture. Previous work tries to compensate for these scattering effects through strategic assignment of colored primary materials to printer voxels. To date, the highest-quality approach uses iterative optimization that relies on computationally expensive Monte Carlo light transport simulation to predict the surface appearance from subsurface scattering within a given print material distribution; that optimization, however, takes in the order of days on a single machine. In our work, we dramatically speed up the process by replacing the light transport simulation with a data-driven approach. Leveraging a deep neural network to predict the scattering within a highly heterogeneous medium, our method performs around two orders of magnitude faster than Monte Carlo rendering while yielding optimization results of similar quality level. The network is based on an established method from atmospheric cloud rendering, adapted to our domain and extended by a physically motivated weight sharing scheme that substantially reduces the network size. We analyze its performance in an end-to-end print preparation pipeline and compare quality and runtime to alternative approaches, and demonstrate its generalization to unseen geometry and material values. This for the first time enables full heterogenous material optimization for 3D-print preparation within time frames in the order of the actual printing time."}],"article_type":"original","day":"01","scopus_import":"1","project":[{"call_identifier":"H2020","grant_number":"642841","name":"Distributed 3D Object Design","_id":"2508E324-B435-11E9-9278-68D0E5697425"},{"grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}]},{"_id":"8765","isi":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"title":"A practical method for animating anisotropic elastoplastic materials","year":"2020","date_updated":"2024-10-22T09:58:14Z","doi":"10.1111/cgf.13914","quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","has_accepted_license":"1","intvolume":"        39","publisher":"Wiley","oa":1,"author":[{"full_name":"Schreck, Camille","last_name":"Schreck","first_name":"Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","last_name":"Wojtan","full_name":"Wojtan, Christopher J"}],"type":"journal_article","date_published":"2020-05-01T00:00:00Z","fulldoi":"https://doi.org/10.1111/cgf.13914","article_processing_charge":"No","month":"05","department":[{"_id":"ChWo"}],"publication_status":"published","date_created":"2020-11-17T09:35:10Z","external_id":{"isi":["000548709600008"]},"project":[{"grant_number":"638176","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"This paper introduces a simple method for simulating highly anisotropic elastoplastic material behaviors like the dissolution of fibrous phenomena (splintering wood, shredding bales of hay) and materials composed of large numbers of irregularly‐shaped bodies (piles of twigs, pencils, or cards). We introduce a simple transformation of the anisotropic problem into an equivalent isotropic one, and we solve this new “fictitious” isotropic problem using an existing simulator based on the material point method. Our approach results in minimal changes to existing simulators, and it allows us to re‐use popular isotropic plasticity models like the Drucker‐Prager yield criterion instead of inventing new anisotropic plasticity models for every phenomenon we wish to simulate.","lang":"eng"}],"volume":39,"scopus_import":"1","article_type":"original","day":"01","ec_funded":1,"ddc":["000"],"publication":"Computer Graphics Forum","page":"89-99","oa_version":"Submitted Version","language":[{"iso":"eng"}],"acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. We would also like to thank Joseph Teran and Chenfanfu Jiang for the helpful discussions.\r\nThis project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme under grant agreement No. 638176.","issue":"2","file":[{"date_created":"2020-11-23T09:05:13Z","file_name":"2020_poff_revisited.pdf","checksum":"7605f605acd84d0942b48bc7a1c2d72e","content_type":"application/pdf","date_updated":"2020-11-23T09:05:13Z","access_level":"open_access","success":1,"creator":"dernst","file_size":38969122,"relation":"main_file","file_id":"8796"}],"file_date_updated":"2020-11-23T09:05:13Z","citation":{"ista":"Schreck C, Wojtan C. 2020. A practical method for animating anisotropic elastoplastic materials. Computer Graphics Forum. 39(2), 89–99.","mla":"Schreck, Camille, and Chris Wojtan. “A Practical Method for Animating Anisotropic Elastoplastic Materials.” <i>Computer Graphics Forum</i>, vol. 39, no. 2, Wiley, 2020, pp. 89–99, doi:<a href=\"https://doi.org/10.1111/cgf.13914\">10.1111/cgf.13914</a>.","ama":"Schreck C, Wojtan C. A practical method for animating anisotropic elastoplastic materials. <i>Computer Graphics Forum</i>. 2020;39(2):89-99. doi:<a href=\"https://doi.org/10.1111/cgf.13914\">10.1111/cgf.13914</a>","chicago":"Schreck, Camille, and Chris Wojtan. “A Practical Method for Animating Anisotropic Elastoplastic Materials.” <i>Computer Graphics Forum</i>. Wiley, 2020. <a href=\"https://doi.org/10.1111/cgf.13914\">https://doi.org/10.1111/cgf.13914</a>.","ieee":"C. Schreck and C. Wojtan, “A practical method for animating anisotropic elastoplastic materials,” <i>Computer Graphics Forum</i>, vol. 39, no. 2. Wiley, pp. 89–99, 2020.","apa":"Schreck, C., &#38; Wojtan, C. (2020). A practical method for animating anisotropic elastoplastic materials. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13914\">https://doi.org/10.1111/cgf.13914</a>","short":"C. Schreck, C. Wojtan, Computer Graphics Forum 39 (2020) 89–99."},"keyword":["Computer Networks and Communications"],"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]}},{"publication":"Computer Graphics Forum","page":"253-264","volume":39,"abstract":[{"text":"Adversarial attacks have demonstrated remarkable efficacy in altering the output of a learning model by applying a minimal perturbation to the input data. While increasing attention has been placed on the image domain, however, the study of adversarial perturbations for geometric data has been notably lagging behind. In this paper, we show that effective adversarial attacks can be concocted for surfaces embedded in 3D, under weak smoothness assumptions on the perceptibility of the attack. We address the case of deformable 3D shapes in particular, and introduce a general model that is not tailored to any specific surface representation, nor does it assume access to a parametric description of the 3D object. In this context, we consider targeted and untargeted variants of the attack, demonstrating compelling results in either case. We further show how discovering adversarial examples, and then using them for adversarial training, leads to an increase in both robustness and accuracy. Our findings are confirmed empirically over multiple datasets spanning different semantic classes and deformations.","lang":"eng"}],"day":"01","article_type":"original","scopus_import":"1","citation":{"apa":"Mariani, G., Cosmo, L., Bronstein, A. M., &#38; Rodolà, E. (2020). Generating adversarial surfaces via band‐limited perturbations. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14083\">https://doi.org/10.1111/cgf.14083</a>","short":"G. Mariani, L. Cosmo, A.M. Bronstein, E. Rodolà, Computer Graphics Forum 39 (2020) 253–264.","ieee":"G. Mariani, L. Cosmo, A. M. Bronstein, and E. Rodolà, “Generating adversarial surfaces via band‐limited perturbations,” <i>Computer Graphics Forum</i>, vol. 39, no. 5. Wiley, pp. 253–264, 2020.","chicago":"Mariani, G., L. Cosmo, Alex M. Bronstein, and E. Rodolà. “Generating Adversarial Surfaces via Band‐limited Perturbations.” <i>Computer Graphics Forum</i>. Wiley, 2020. <a href=\"https://doi.org/10.1111/cgf.14083\">https://doi.org/10.1111/cgf.14083</a>.","ama":"Mariani G, Cosmo L, Bronstein AM, Rodolà E. Generating adversarial surfaces via band‐limited perturbations. <i>Computer Graphics Forum</i>. 2020;39(5):253-264. doi:<a href=\"https://doi.org/10.1111/cgf.14083\">10.1111/cgf.14083</a>","ista":"Mariani G, Cosmo L, Bronstein AM, Rodolà E. 2020. Generating adversarial surfaces via band‐limited perturbations. Computer Graphics Forum. 39(5), 253–264.","mla":"Mariani, G., et al. “Generating Adversarial Surfaces via Band‐limited Perturbations.” <i>Computer Graphics Forum</i>, vol. 39, no. 5, Wiley, 2020, pp. 253–64, doi:<a href=\"https://doi.org/10.1111/cgf.14083\">10.1111/cgf.14083</a>."},"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"language":[{"iso":"eng"}],"issue":"5","oa_version":"None","intvolume":"        39","publisher":"Wiley","author":[{"first_name":"G.","last_name":"Mariani","full_name":"Mariani, G."},{"first_name":"L.","last_name":"Cosmo","full_name":"Cosmo, L."},{"orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"first_name":"E.","full_name":"Rodolà, E.","last_name":"Rodolà"}],"extern":"1","doi":"10.1111/cgf.14083","date_updated":"2024-10-15T09:36:46Z","title":"Generating adversarial surfaces via band‐limited perturbations","year":"2020","quality_controlled":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"18246","date_created":"2024-10-08T13:04:35Z","OA_type":"closed access","month":"08","article_processing_charge":"No","publication_status":"published","fulldoi":"https://doi.org/10.1111/cgf.14083","type":"journal_article","date_published":"2020-08-01T00:00:00Z"},{"citation":{"ieee":"E. Rodolà, Z. Lähner, A. M. Bronstein, M. M. Bronstein, and J. Solomon, “Functional maps representation on product manifolds,” <i>Computer Graphics Forum</i>, vol. 38, no. 1. Wiley, pp. 678–689, 2019.","chicago":"Rodolà, E., Z. Lähner, Alex M. Bronstein, M. M. Bronstein, and J. Solomon. “Functional Maps Representation on Product Manifolds.” <i>Computer Graphics Forum</i>. Wiley, 2019. <a href=\"https://doi.org/10.1111/cgf.13598\">https://doi.org/10.1111/cgf.13598</a>.","apa":"Rodolà, E., Lähner, Z., Bronstein, A. M., Bronstein, M. M., &#38; Solomon, J. (2019). Functional maps representation on product manifolds. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13598\">https://doi.org/10.1111/cgf.13598</a>","short":"E. Rodolà, Z. Lähner, A.M. Bronstein, M.M. Bronstein, J. Solomon, Computer Graphics Forum 38 (2019) 678–689.","ista":"Rodolà E, Lähner Z, Bronstein AM, Bronstein MM, Solomon J. 2019. Functional maps representation on product manifolds. Computer Graphics Forum. 38(1), 678–689.","mla":"Rodolà, E., et al. “Functional Maps Representation on Product Manifolds.” <i>Computer Graphics Forum</i>, vol. 38, no. 1, Wiley, 2019, pp. 678–89, doi:<a href=\"https://doi.org/10.1111/cgf.13598\">10.1111/cgf.13598</a>.","ama":"Rodolà E, Lähner Z, Bronstein AM, Bronstein MM, Solomon J. Functional maps representation on product manifolds. <i>Computer Graphics Forum</i>. 2019;38(1):678-689. doi:<a href=\"https://doi.org/10.1111/cgf.13598\">10.1111/cgf.13598</a>"},"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"oa_version":"Preprint","language":[{"iso":"eng"}],"issue":"1","publication":"Computer Graphics Forum","page":"678-689","abstract":[{"lang":"eng","text":"We consider the tasks of representing, analysing and manipulating maps between shapes. We model maps as densities over the product manifold of the input shapes; these densities can be treated as scalar functions and therefore are manipulable using the language of signal processing on manifolds. Being a manifold itself, the product space endows the set of maps with a geometry of its own, which we exploit to define map operations in the spectral domain; we also derive relationships with other existing representations (soft maps and functional maps). To apply these ideas in practice, we discretize product manifolds and their Laplace–Beltrami operators, and we introduce localized spectral analysis of the product manifold as a novel tool for map processing. Our framework applies to maps defined between and across 2D and 3D shapes without requiring special adjustment, and it can be implemented efficiently with simple operations on sparse matrices."}],"volume":38,"scopus_import":"1","day":"01","article_type":"original","OA_place":"repository","article_processing_charge":"No","month":"02","OA_type":"green","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1809.10940","open_access":"1"}],"date_created":"2024-10-08T13:09:33Z","external_id":{"arxiv":["1809.10940"]},"date_published":"2019-02-01T00:00:00Z","type":"journal_article","arxiv":1,"fulldoi":"https://doi.org/10.1111/cgf.13598","extern":"1","publisher":"Wiley","intvolume":"        38","oa":1,"author":[{"full_name":"Rodolà, E.","last_name":"Rodolà","first_name":"E."},{"last_name":"Lähner","full_name":"Lähner, Z.","first_name":"Z."},{"last_name":"Bronstein","full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730"},{"first_name":"M. M.","last_name":"Bronstein","full_name":"Bronstein, M. M."},{"full_name":"Solomon, J.","last_name":"Solomon","first_name":"J."}],"_id":"18263","title":"Functional maps representation on product manifolds","date_updated":"2024-10-16T13:07:30Z","year":"2019","doi":"10.1111/cgf.13598","quality_controlled":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"journal_article","date_published":"2017-05-01T00:00:00Z","oa_version":"None","issue":"2","fulldoi":"https://doi.org/10.1111/cgf.13123","language":[{"iso":"eng"}],"publication_status":"published","month":"05","article_processing_charge":"No","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"citation":{"ieee":"O. Litany, E. Rodolà, A. M. Bronstein, and M. M. Bronstein, “Fully spectral partial shape matching,” <i>Computer Graphics Forum</i>, vol. 36, no. 2. Wiley, pp. 247–258, 2017.","chicago":"Litany, O., E. Rodolà, Alex M. Bronstein, and M. M. Bronstein. “Fully Spectral Partial Shape Matching.” <i>Computer Graphics Forum</i>. Wiley, 2017. <a href=\"https://doi.org/10.1111/cgf.13123\">https://doi.org/10.1111/cgf.13123</a>.","short":"O. Litany, E. Rodolà, A.M. Bronstein, M.M. Bronstein, Computer Graphics Forum 36 (2017) 247–258.","apa":"Litany, O., Rodolà, E., Bronstein, A. M., &#38; Bronstein, M. M. (2017). Fully spectral partial shape matching. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13123\">https://doi.org/10.1111/cgf.13123</a>","mla":"Litany, O., et al. “Fully Spectral Partial Shape Matching.” <i>Computer Graphics Forum</i>, vol. 36, no. 2, Wiley, 2017, pp. 247–58, doi:<a href=\"https://doi.org/10.1111/cgf.13123\">10.1111/cgf.13123</a>.","ista":"Litany O, Rodolà E, Bronstein AM, Bronstein MM. 2017. Fully spectral partial shape matching. Computer Graphics Forum. 36(2), 247–258.","ama":"Litany O, Rodolà E, Bronstein AM, Bronstein MM. Fully spectral partial shape matching. <i>Computer Graphics Forum</i>. 2017;36(2):247-258. doi:<a href=\"https://doi.org/10.1111/cgf.13123\">10.1111/cgf.13123</a>"},"date_created":"2024-10-15T11:20:55Z","_id":"18427","day":"01","status":"public","quality_controlled":"1","scopus_import":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","doi":"10.1111/cgf.13123","volume":36,"date_updated":"2024-12-19T14:38:05Z","abstract":[{"text":"We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain. Our technique relies on the recently introduced partial functional maps formalism and on the joint approximate diagonalization (JAD) of the Laplace-Beltrami operators previously introduced for matching non-isometric shapes. We show that a variant of the JAD problem with an appropriately modified coupling term (surprisingly) allows to construct quasi-harmonic bases localized on the latent corresponding parts. This circumvents the need to explicitly compute the unknown parts by means of the cumbersome alternating minimization used in the previous approaches, and allows performing all the calculations in the spectral domain with constant complexity independent of the number of shape vertices. We provide an extensive evaluation of the proposed technique on standard non-rigid correspondence benchmarks and show state-of-the-art performance in various settings, including partiality and the presence of topological noise.","lang":"eng"}],"title":"Fully spectral partial shape matching","year":"2017","extern":"1","page":"247-258","author":[{"full_name":"Litany, O.","last_name":"Litany","first_name":"O."},{"first_name":"E.","full_name":"Rodolà, E.","last_name":"Rodolà"},{"last_name":"Bronstein","full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730"},{"last_name":"Bronstein","full_name":"Bronstein, M. M.","first_name":"M. M."}],"intvolume":"        36","publication":"Computer Graphics Forum","publisher":"Wiley"},{"day":"01","scopus_import":"1","volume":35,"abstract":[{"lang":"eng","text":"Shape correspondence is a fundamental problem in computer graphics and vision, with applications in various problems including animation, texture mapping, robotic vision, medical imaging, archaeology and many more. In settings where the shapes are allowed to undergo non-rigid deformations and only partial views are available, the problem becomes very challenging. To this end, we present a non-rigid multi-part shape matching algorithm. We assume to be given a reference shape and its multiple parts undergoing a non-rigid deformation. Each of these query parts can be additionally contaminated by clutter, may overlap with other parts, and there might be missing parts or redundant ones. Our method simultaneously solves for the segmentation of the reference model, and for a dense correspondence to (subsets of) the parts. Experimental results on synthetic as well as real scans demonstrate the effectiveness of our method in dealing with this challenging matching scenario."}],"page":"135-143","publication":"Computer Graphics Forum","issue":"5","language":[{"iso":"eng"}],"oa_version":"Preprint","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"citation":{"chicago":"Litany, O., E. Rodolà, Alex M. Bronstein, M. M. Bronstein, and D. Cremers. “Non‐rigid Puzzles.” <i>Computer Graphics Forum</i>. Wiley, 2016. <a href=\"https://doi.org/10.1111/cgf.12970\">https://doi.org/10.1111/cgf.12970</a>.","ieee":"O. Litany, E. Rodolà, A. M. Bronstein, M. M. Bronstein, and D. Cremers, “Non‐rigid puzzles,” <i>Computer Graphics Forum</i>, vol. 35, no. 5. Wiley, pp. 135–143, 2016.","short":"O. Litany, E. Rodolà, A.M. Bronstein, M.M. Bronstein, D. Cremers, Computer Graphics Forum 35 (2016) 135–143.","apa":"Litany, O., Rodolà, E., Bronstein, A. M., Bronstein, M. M., &#38; Cremers, D. (2016). Non‐rigid puzzles. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12970\">https://doi.org/10.1111/cgf.12970</a>","mla":"Litany, O., et al. “Non‐rigid Puzzles.” <i>Computer Graphics Forum</i>, vol. 35, no. 5, Wiley, 2016, pp. 135–43, doi:<a href=\"https://doi.org/10.1111/cgf.12970\">10.1111/cgf.12970</a>.","ista":"Litany O, Rodolà E, Bronstein AM, Bronstein MM, Cremers D. 2016. Non‐rigid puzzles. Computer Graphics Forum. 35(5), 135–143.","ama":"Litany O, Rodolà E, Bronstein AM, Bronstein MM, Cremers D. Non‐rigid puzzles. <i>Computer Graphics Forum</i>. 2016;35(5):135-143. doi:<a href=\"https://doi.org/10.1111/cgf.12970\">10.1111/cgf.12970</a>"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","quality_controlled":"1","doi":"10.1111/cgf.12970","title":"Non‐rigid puzzles","year":"2016","date_updated":"2024-12-19T14:29:56Z","_id":"18426","author":[{"first_name":"O.","last_name":"Litany","full_name":"Litany, O."},{"first_name":"E.","full_name":"Rodolà, E.","last_name":"Rodolà"},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"first_name":"M. M.","full_name":"Bronstein, M. M.","last_name":"Bronstein"},{"first_name":"D.","last_name":"Cremers","full_name":"Cremers, D."}],"oa":1,"intvolume":"        35","publisher":"Wiley","extern":"1","fulldoi":"https://doi.org/10.1111/cgf.12970","date_published":"2016-08-01T00:00:00Z","type":"journal_article","date_created":"2024-10-15T11:20:55Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2011.13076","open_access":"1"}],"publication_status":"published","article_processing_charge":"No","month":"08"},{"publication":"Computer Graphics Forum","page":"2-13","volume":34,"abstract":[{"text":"We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high probability. Our method uses a carefully designed sampling of the transformation space, where each transformation is efficiently evaluated using a sublinear algorithm. We prove that the density of the sampling depends on the total variation of the shape, allowing us to derive formal bounds on the algorithm's complexity and approximation quality. We further investigate different volumetric shape representations (in the form of truncated distance transforms), and in such a way control the total variation of the shape and hence the sampling density and the runtime of the algorithm. A comprehensive set of experiments assesses the proposed method, including an evaluation on the eight categories of the COSEG data set. This is the first large-scale evaluation of any symmetry detection technique that we are aware of.","lang":"eng"}],"day":"01","scopus_import":"1","citation":{"chicago":"Korman, Simon, Roee Litman, Shai Avidan, and Alex M. Bronstein. “Probably Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.” <i>Computer Graphics Forum</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/cgf.12454\">https://doi.org/10.1111/cgf.12454</a>.","ieee":"S. Korman, R. Litman, S. Avidan, and A. M. Bronstein, “Probably approximately symmetric: Fast rigid symmetry detection with global guarantees,” <i>Computer Graphics Forum</i>, vol. 34, no. 1. Wiley, pp. 2–13, 2015.","short":"S. Korman, R. Litman, S. Avidan, A.M. Bronstein, Computer Graphics Forum 34 (2015) 2–13.","apa":"Korman, S., Litman, R., Avidan, S., &#38; Bronstein, A. M. (2015). Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12454\">https://doi.org/10.1111/cgf.12454</a>","mla":"Korman, Simon, et al. “Probably Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.” <i>Computer Graphics Forum</i>, vol. 34, no. 1, Wiley, 2015, pp. 2–13, doi:<a href=\"https://doi.org/10.1111/cgf.12454\">10.1111/cgf.12454</a>.","ista":"Korman S, Litman R, Avidan S, Bronstein AM. 2015. Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. Computer Graphics Forum. 34(1), 2–13.","ama":"Korman S, Litman R, Avidan S, Bronstein AM. Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. <i>Computer Graphics Forum</i>. 2015;34(1):2-13. doi:<a href=\"https://doi.org/10.1111/cgf.12454\">10.1111/cgf.12454</a>"},"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"language":[{"iso":"eng"}],"issue":"1","oa_version":"Preprint","publisher":"Wiley","intvolume":"        34","oa":1,"author":[{"first_name":"Simon","full_name":"Korman, Simon","last_name":"Korman"},{"last_name":"Litman","full_name":"Litman, Roee","first_name":"Roee"},{"first_name":"Shai","full_name":"Avidan, Shai","last_name":"Avidan"},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander"}],"extern":"1","doi":"10.1111/cgf.12454","date_updated":"2024-12-19T10:12:48Z","title":"Probably approximately symmetric: Fast rigid symmetry detection with global guarantees","year":"2015","quality_controlled":"1","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"18424","date_created":"2024-10-15T11:20:55Z","external_id":{"arxiv":["1403.6637"]},"article_processing_charge":"No","month":"02","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1403.6637","open_access":"1"}],"fulldoi":"https://doi.org/10.1111/cgf.12454","type":"journal_article","date_published":"2015-02-01T00:00:00Z","arxiv":1},{"extern":"1","author":[{"full_name":"Biasotti, S.","last_name":"Biasotti","first_name":"S."},{"first_name":"A.","last_name":"Cerri","full_name":"Cerri, A."},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"last_name":"Bronstein","full_name":"Bronstein, M.","first_name":"M."}],"page":"87-119","publisher":"Wiley","intvolume":"        35","publication":"Computer Graphics Forum","_id":"18425","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","status":"public","scopus_import":"1","day":"01","title":"Recent trends, applications, and perspectives in 3D shape similarity assessment","abstract":[{"lang":"eng","text":"The recent introduction of 3D shape analysis frameworks able to quantify the deformation of a shape into another in terms of the variation of real functions yields a new interpretation of the 3D shape similarity assessment and opens new perspectives. Indeed, while the classical approaches to similarity mainly quantify it as a numerical score, map-based methods also define (dense) shape correspondences. After presenting in detail the theoretical foundations underlying these approaches, we classify them by looking at their most salient features, including the kind of structure and invariance properties they capture, as well as the distances and the output modalities according to which the similarity between shapes is assessed and returned. We also review the usage of these methods in a number of 3D shape application domains, ranging from matching and retrieval to annotation and segmentation. Finally, the most promising directions for future research developments are discussed."}],"year":"2015","date_updated":"2024-12-19T13:44:16Z","doi":"10.1111/cgf.12734","volume":35,"publication_status":"published","article_processing_charge":"No","month":"09","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"citation":{"mla":"Biasotti, S., et al. “Recent Trends, Applications, and Perspectives in 3D Shape Similarity Assessment.” <i>Computer Graphics Forum</i>, vol. 35, no. 6, Wiley, 2015, pp. 87–119, doi:<a href=\"https://doi.org/10.1111/cgf.12734\">10.1111/cgf.12734</a>.","ista":"Biasotti S, Cerri A, Bronstein AM, Bronstein M. 2015. Recent trends, applications, and perspectives in 3D shape similarity assessment. Computer Graphics Forum. 35(6), 87–119.","ama":"Biasotti S, Cerri A, Bronstein AM, Bronstein M. Recent trends, applications, and perspectives in 3D shape similarity assessment. <i>Computer Graphics Forum</i>. 2015;35(6):87-119. doi:<a href=\"https://doi.org/10.1111/cgf.12734\">10.1111/cgf.12734</a>","ieee":"S. Biasotti, A. Cerri, A. M. Bronstein, and M. Bronstein, “Recent trends, applications, and perspectives in 3D shape similarity assessment,” <i>Computer Graphics Forum</i>, vol. 35, no. 6. Wiley, pp. 87–119, 2015.","chicago":"Biasotti, S., A. Cerri, Alex M. Bronstein, and M. Bronstein. “Recent Trends, Applications, and Perspectives in 3D Shape Similarity Assessment.” <i>Computer Graphics Forum</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/cgf.12734\">https://doi.org/10.1111/cgf.12734</a>.","short":"S. Biasotti, A. Cerri, A.M. Bronstein, M. Bronstein, Computer Graphics Forum 35 (2015) 87–119.","apa":"Biasotti, S., Cerri, A., Bronstein, A. M., &#38; Bronstein, M. (2015). Recent trends, applications, and perspectives in 3D shape similarity assessment. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12734\">https://doi.org/10.1111/cgf.12734</a>"},"date_created":"2024-10-15T11:20:55Z","oa_version":"None","date_published":"2015-09-01T00:00:00Z","type":"journal_article","fulldoi":"https://doi.org/10.1111/cgf.12734","issue":"6","language":[{"iso":"eng"}]},{"extern":"1","page":"127-136","author":[{"full_name":"Litman, Roee","last_name":"Litman","first_name":"Roee"},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"first_name":"Michael","full_name":"Bronstein, Michael","last_name":"Bronstein"},{"full_name":"Castellani, Umberto","last_name":"Castellani","first_name":"Umberto"}],"publication":"Computer Graphics Forum","intvolume":"        33","publisher":"Wiley","_id":"18423","status":"public","scopus_import":"1","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","abstract":[{"text":"We present a method for supervised learning of shape descriptors for shape retrieval applications. Many content-based shape retrieval approaches follow the bag-of-features (BoF) paradigm commonly used in text and image retrieval by first computing local shape descriptors, and then representing them in a ‘geometric dictionary’ using vector quantization. A major drawback of such approaches is that the dictionary is constructed in an unsupervised manner using clustering, unaware of the last stage of the process (pooling of the local descriptors into a BoF, and comparison of the latter using some metric). In this paper, we replace the clustering with dictionary learning, where every atom acts as a feature, followed by sparse coding and pooling to get the final BoF descriptor. Both the dictionary and the sparse codes can be learned in the supervised regime via bi-level optimization using a task-specific objective that promotes invariance desired in the specific application. We show significant performance improvement on several standard shape retrieval benchmarks.","lang":"eng"}],"date_updated":"2024-12-19T10:20:12Z","title":"Supervised learning of bag‐of‐features shape descriptors using sparse coding","year":"2014","doi":"10.1111/cgf.12438","volume":33,"publication_status":"published","month":"08","article_processing_charge":"No","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"date_created":"2024-10-15T11:20:55Z","citation":{"short":"R. Litman, A.M. Bronstein, M. Bronstein, U. Castellani, Computer Graphics Forum 33 (2014) 127–136.","apa":"Litman, R., Bronstein, A. M., Bronstein, M., &#38; Castellani, U. (2014). Supervised learning of bag‐of‐features shape descriptors using sparse coding. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12438\">https://doi.org/10.1111/cgf.12438</a>","chicago":"Litman, Roee, Alex M. Bronstein, Michael Bronstein, and Umberto Castellani. “Supervised Learning of Bag‐of‐features Shape Descriptors Using Sparse Coding.” <i>Computer Graphics Forum</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/cgf.12438\">https://doi.org/10.1111/cgf.12438</a>.","ieee":"R. Litman, A. M. Bronstein, M. Bronstein, and U. Castellani, “Supervised learning of bag‐of‐features shape descriptors using sparse coding,” <i>Computer Graphics Forum</i>, vol. 33, no. 5. Wiley, pp. 127–136, 2014.","ama":"Litman R, Bronstein AM, Bronstein M, Castellani U. Supervised learning of bag‐of‐features shape descriptors using sparse coding. <i>Computer Graphics Forum</i>. 2014;33(5):127-136. doi:<a href=\"https://doi.org/10.1111/cgf.12438\">10.1111/cgf.12438</a>","mla":"Litman, Roee, et al. “Supervised Learning of Bag‐of‐features Shape Descriptors Using Sparse Coding.” <i>Computer Graphics Forum</i>, vol. 33, no. 5, Wiley, 2014, pp. 127–36, doi:<a href=\"https://doi.org/10.1111/cgf.12438\">10.1111/cgf.12438</a>.","ista":"Litman R, Bronstein AM, Bronstein M, Castellani U. 2014. Supervised learning of bag‐of‐features shape descriptors using sparse coding. Computer Graphics Forum. 33(5), 127–136."},"oa_version":"None","date_published":"2014-08-01T00:00:00Z","type":"journal_article","fulldoi":"https://doi.org/10.1111/cgf.12438","issue":"5","language":[{"iso":"eng"}]},{"_id":"18421","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","year":"2013","title":"Coupled quasi‐harmonic bases","date_updated":"2024-12-19T10:02:12Z","doi":"10.1111/cgf.12064","extern":"1","author":[{"last_name":"Kovnatsky","full_name":"Kovnatsky, A.","first_name":"A."},{"first_name":"M. M.","full_name":"Bronstein, M. M.","last_name":"Bronstein"},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"last_name":"Glashoff","full_name":"Glashoff, K.","first_name":"K."},{"first_name":"R.","full_name":"Kimmel, R.","last_name":"Kimmel"}],"oa":1,"intvolume":"        32","publisher":"Wiley","arxiv":1,"type":"journal_article","date_published":"2013-05-01T00:00:00Z","fulldoi":"https://doi.org/10.1111/cgf.12064","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1210.0026","open_access":"1"}],"month":"05","article_processing_charge":"No","external_id":{"arxiv":["1210.0026"]},"date_created":"2024-10-15T11:20:55Z","scopus_import":"1","day":"01","abstract":[{"text":"The use of Laplacian eigenbases has been shown to be fruitful in many computer graphics applications. Today, state-of-the-art approaches to shape analysis, synthesis, and correspondence rely on these natural harmonic bases that allow using classical tools from harmonic analysis on manifolds. However, many applications involving multiple shapes are obstacled by the fact that Laplacian eigenbases computed independently on different shapes are often incompatible with each other. In this paper, we propose the construction of common approximate eigenbases for multiple shapes using approximate joint diagonalization algorithms, taking as input a set of corresponding functions (e.g. indicator functions of stable regions) on the two shapes. We illustrate the benefits of the proposed approach on tasks from shape editing, pose transfer, correspondence, and similarity.","lang":"eng"}],"volume":32,"page":"439-448","publication":"Computer Graphics Forum","oa_version":"Preprint","issue":"2pt4","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"citation":{"ama":"Kovnatsky A, Bronstein MM, Bronstein AM, Glashoff K, Kimmel R. Coupled quasi‐harmonic bases. <i>Computer Graphics Forum</i>. 2013;32(2pt4):439-448. doi:<a href=\"https://doi.org/10.1111/cgf.12064\">10.1111/cgf.12064</a>","mla":"Kovnatsky, A., et al. “Coupled Quasi‐harmonic Bases.” <i>Computer Graphics Forum</i>, vol. 32, no. 2pt4, Wiley, 2013, pp. 439–48, doi:<a href=\"https://doi.org/10.1111/cgf.12064\">10.1111/cgf.12064</a>.","ista":"Kovnatsky A, Bronstein MM, Bronstein AM, Glashoff K, Kimmel R. 2013. Coupled quasi‐harmonic bases. Computer Graphics Forum. 32(2pt4), 439–448.","short":"A. Kovnatsky, M.M. Bronstein, A.M. Bronstein, K. Glashoff, R. Kimmel, Computer Graphics Forum 32 (2013) 439–448.","apa":"Kovnatsky, A., Bronstein, M. M., Bronstein, A. M., Glashoff, K., &#38; Kimmel, R. (2013). Coupled quasi‐harmonic bases. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12064\">https://doi.org/10.1111/cgf.12064</a>","chicago":"Kovnatsky, A., M. M. Bronstein, Alex M. Bronstein, K. Glashoff, and R. Kimmel. “Coupled Quasi‐harmonic Bases.” <i>Computer Graphics Forum</i>. Wiley, 2013. <a href=\"https://doi.org/10.1111/cgf.12064\">https://doi.org/10.1111/cgf.12064</a>.","ieee":"A. Kovnatsky, M. M. Bronstein, A. M. Bronstein, K. Glashoff, and R. Kimmel, “Coupled quasi‐harmonic bases,” <i>Computer Graphics Forum</i>, vol. 32, no. 2pt4. Wiley, pp. 439–448, 2013."}},{"extern":"1","oa":1,"author":[{"last_name":"Pokrass","full_name":"Pokrass, J.","first_name":"J."},{"first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"first_name":"M. M.","full_name":"Bronstein, M. M.","last_name":"Bronstein"},{"last_name":"Sprechmann","full_name":"Sprechmann, P.","first_name":"P."},{"full_name":"Sapiro, G.","last_name":"Sapiro","first_name":"G."}],"intvolume":"        32","publisher":"Wiley","_id":"18422","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","quality_controlled":"1","doi":"10.1111/cgf.12066","year":"2013","title":"Sparse modeling of intrinsic correspondences","date_updated":"2024-12-19T09:57:17Z","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1209.6560","open_access":"1"}],"article_processing_charge":"No","month":"05","external_id":{"arxiv":["1209.6560"]},"date_created":"2024-10-15T11:20:55Z","arxiv":1,"type":"journal_article","date_published":"2013-05-01T00:00:00Z","fulldoi":"https://doi.org/10.1111/cgf.12066","page":"459-468","publication":"Computer Graphics Forum","day":"01","scopus_import":"1","volume":32,"abstract":[{"lang":"eng","text":"We present a novel sparse modeling approach to non-rigid shape matching using only the ability to detect repeatable regions. As the input to our algorithm, we are given only two sets of regions in two shapes; no descriptors are provided so the correspondence between the regions is not know, nor we know how many regions correspond in the two shapes. We show that even with such scarce information, it is possible to establish very accurate correspondence between the shapes by using methods from the field of sparse modeling, being this, the first non-trivial use of sparse models in shape correspondence. We formulate the problem of permuted sparse coding, in which we solve simultaneously for an unknown permutation ordering the regions on two shapes and for an unknown correspondence in functional representation. We also propose a robust variant capable of handling incomplete matches. Numerically, the problem is solved efficiently by alternating the solution of a linear assignment and a sparse coding problem. The proposed methods are evaluated qualitatively and quantitatively on standard benchmarks containing both synthetic and scanned objects."}],"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"citation":{"chicago":"Pokrass, J., Alex M. Bronstein, M. M. Bronstein, P. Sprechmann, and G. Sapiro. “Sparse Modeling of Intrinsic Correspondences.” <i>Computer Graphics Forum</i>. Wiley, 2013. <a href=\"https://doi.org/10.1111/cgf.12066\">https://doi.org/10.1111/cgf.12066</a>.","ieee":"J. Pokrass, A. M. Bronstein, M. M. Bronstein, P. Sprechmann, and G. Sapiro, “Sparse modeling of intrinsic correspondences,” <i>Computer Graphics Forum</i>, vol. 32, no. 2pt4. Wiley, pp. 459–468, 2013.","short":"J. Pokrass, A.M. Bronstein, M.M. Bronstein, P. Sprechmann, G. Sapiro, Computer Graphics Forum 32 (2013) 459–468.","apa":"Pokrass, J., Bronstein, A. M., Bronstein, M. M., Sprechmann, P., &#38; Sapiro, G. (2013). Sparse modeling of intrinsic correspondences. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12066\">https://doi.org/10.1111/cgf.12066</a>","mla":"Pokrass, J., et al. “Sparse Modeling of Intrinsic Correspondences.” <i>Computer Graphics Forum</i>, vol. 32, no. 2pt4, Wiley, 2013, pp. 459–68, doi:<a href=\"https://doi.org/10.1111/cgf.12066\">10.1111/cgf.12066</a>.","ista":"Pokrass J, Bronstein AM, Bronstein MM, Sprechmann P, Sapiro G. 2013. Sparse modeling of intrinsic correspondences. Computer Graphics Forum. 32(2pt4), 459–468.","ama":"Pokrass J, Bronstein AM, Bronstein MM, Sprechmann P, Sapiro G. Sparse modeling of intrinsic correspondences. <i>Computer Graphics Forum</i>. 2013;32(2pt4):459-468. doi:<a href=\"https://doi.org/10.1111/cgf.12066\">10.1111/cgf.12066</a>"},"oa_version":"Preprint","issue":"2pt4","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"issue":"2","pubrep_id":"601","acknowledgement":"This work was funded by NSF grant IIS-1017014 and CCF- 0917093.","oa_version":"Submitted Version","citation":{"chicago":"Yu, Jihun, Chris Wojtan, Greg Turk, and Chee Yap. “Explicit Mesh Surfaces for Particle Based Fluids.” In <i>Computer Graphics Forum</i>, 31:815–24. Wiley, 2012. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03062.x\">https://doi.org/10.1111/j.1467-8659.2012.03062.x</a>.","ieee":"J. Yu, C. Wojtan, G. Turk, and C. Yap, “Explicit mesh surfaces for particle based fluids,” in <i>Computer Graphics Forum</i>, Cagliari, Sardinia, Italy, 2012, vol. 31, no. 2, pp. 815–824.","short":"J. Yu, C. Wojtan, G. Turk, C. Yap, in:, Computer Graphics Forum, Wiley, 2012, pp. 815–824.","apa":"Yu, J., Wojtan, C., Turk, G., &#38; Yap, C. (2012). Explicit mesh surfaces for particle based fluids. In <i>Computer Graphics Forum</i> (Vol. 31, pp. 815–824). Cagliari, Sardinia, Italy: Wiley. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03062.x\">https://doi.org/10.1111/j.1467-8659.2012.03062.x</a>","mla":"Yu, Jihun, et al. “Explicit Mesh Surfaces for Particle Based Fluids.” <i>Computer Graphics Forum</i>, vol. 31, no. 2, Wiley, 2012, pp. 815–24, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03062.x\">10.1111/j.1467-8659.2012.03062.x</a>.","ista":"Yu J, Wojtan C, Turk G, Yap C. 2012. Explicit mesh surfaces for particle based fluids. Computer Graphics Forum. EUROGRAPHICS: Conference on European Association for Computer Graphics, Eurographics, vol. 31, 815–824.","ama":"Yu J, Wojtan C, Turk G, Yap C. Explicit mesh surfaces for particle based fluids. In: <i>Computer Graphics Forum</i>. Vol 31. Wiley; 2012:815-824. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03062.x\">10.1111/j.1467-8659.2012.03062.x</a>"},"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:14:39Z","file_name":"IST-2016-601-v1+1_meshSPH.pdf","checksum":"acb325dd1e31859bedd30e013f61d0b9","creator":"system","file_size":5740527,"file_id":"5092","relation":"main_file","date_updated":"2020-07-14T12:46:00Z","access_level":"open_access"}],"file_date_updated":"2020-07-14T12:46:00Z","alternative_title":["Eurographics"],"volume":31,"abstract":[{"lang":"eng","text":"We introduce the idea of using an explicit triangle mesh to track the air/fluid interface in a smoothed particle hydrodynamics (SPH) simulator. Once an initial surface mesh is created, this mesh is carried forward in time using nearby particle velocities to advect the mesh vertices. The mesh connectivity remains mostly unchanged across time-steps; it is only modified locally for topology change events or for the improvement of triangle quality. In order to ensure that the surface mesh does not diverge from the underlying particle simulation, we periodically project the mesh surface onto an implicit surface defined by the physics simulation. The mesh surface gives us several advantages over previous SPH surface tracking techniques. We demonstrate a new method for surface tension calculations that clearly outperforms the state of the art in SPH surface tension for computer graphics. We also demonstrate a method for tracking detailed surface information (like colors) that is less susceptible to numerical diffusion than competing techniques. Finally, our temporally-coherent surface mesh allows us to simulate high-resolution surface wave dynamics without being limited by the particle resolution of the SPH simulation."}],"day":"01","scopus_import":"1","ddc":["000"],"publication":"Computer Graphics Forum","page":"815 - 824","fulldoi":"https://doi.org/10.1111/j.1467-8659.2012.03062.x","type":"conference","date_published":"2012-05-01T00:00:00Z","date_created":"2018-12-11T12:01:31Z","external_id":{"isi":["000306182500009"]},"conference":{"start_date":"2012-05-13","location":"Cagliari, Sardinia, Italy","end_date":"2012-05-18","name":"EUROGRAPHICS: Conference on European Association for Computer Graphics"},"department":[{"_id":"ChWo"}],"month":"05","article_processing_charge":"No","publication_status":"published","doi":"10.1111/j.1467-8659.2012.03062.x","title":"Explicit mesh surfaces for particle based fluids","year":"2012","date_updated":"2025-09-30T07:58:32Z","status":"public","has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","_id":"3123","isi":1,"publist_id":"3576","publisher":"Wiley","intvolume":"        31","oa":1,"author":[{"full_name":"Yu, Jihun","last_name":"Yu","first_name":"Jihun"},{"full_name":"Wojtan, Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Turk","full_name":"Turk, Greg","first_name":"Greg"},{"last_name":"Yap","full_name":"Yap, Chee","first_name":"Chee"}]}]