[{"publication_status":"published","department":[{"_id":"ChWo"}],"publisher":"ACM","year":"2019","date_updated":"2023-09-06T15:22:23Z","date_created":"2020-01-30T10:19:43Z","volume":38,"author":[{"last_name":"Karlík","first_name":"Ondřej","full_name":"Karlík, Ondřej"},{"last_name":"Šik","first_name":"Martin","full_name":"Šik, Martin"},{"full_name":"Vévoda, Petr","last_name":"Vévoda","first_name":"Petr"},{"id":"486A5A46-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas","last_name":"Skrivan","full_name":"Skrivan, Tomas"},{"full_name":"Křivánek, Jaroslav","last_name":"Křivánek","first_name":"Jaroslav"}],"article_number":"151","quality_controlled":"1","isi":1,"external_id":{"isi":["000498397300001"]},"language":[{"iso":"eng"}],"doi":"10.1145/3355089.3356565","month":"11","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"status":"public","title":"MIS compensation: Optimizing sampling techniques in multiple importance sampling","intvolume":" 38","_id":"7418","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"None","type":"journal_article","abstract":[{"text":"Multiple importance sampling (MIS) has become an indispensable tool in Monte Carlo rendering, widely accepted as a near-optimal solution for combining different sampling techniques. But an MIS combination, using the common balance or power heuristics, often results in an overly defensive estimator, leading to high variance. We show that by generalizing the MIS framework, variance can be substantially reduced. Specifically, we optimize one of the combined sampling techniques so as to decrease the overall variance of the resulting MIS estimator. We apply the approach to the computation of direct illumination due to an HDR environment map and to the computation of global illumination using a path guiding algorithm. The implementation can be as simple as subtracting a constant value from the tabulated sampling density done entirely in a preprocessing step. This produces a consistent noise reduction in all our tests with no negative influence on run time, no artifacts or bias, and no failure cases.","lang":"eng"}],"issue":"6","article_type":"original","publication":"ACM Transactions on Graphics","citation":{"chicago":"Karlík, Ondřej, Martin Šik, Petr Vévoda, Tomas Skrivan, and Jaroslav Křivánek. “MIS Compensation: Optimizing Sampling Techniques in Multiple Importance Sampling.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3355089.3356565.","mla":"Karlík, Ondřej, et al. “MIS Compensation: Optimizing Sampling Techniques in Multiple Importance Sampling.” ACM Transactions on Graphics, vol. 38, no. 6, 151, ACM, 2019, doi:10.1145/3355089.3356565.","short":"O. Karlík, M. Šik, P. Vévoda, T. Skrivan, J. Křivánek, ACM Transactions on Graphics 38 (2019).","ista":"Karlík O, Šik M, Vévoda P, Skrivan T, Křivánek J. 2019. MIS compensation: Optimizing sampling techniques in multiple importance sampling. ACM Transactions on Graphics. 38(6), 151.","ieee":"O. Karlík, M. Šik, P. Vévoda, T. Skrivan, and J. Křivánek, “MIS compensation: Optimizing sampling techniques in multiple importance sampling,” ACM Transactions on Graphics, vol. 38, no. 6. ACM, 2019.","apa":"Karlík, O., Šik, M., Vévoda, P., Skrivan, T., & Křivánek, J. (2019). MIS compensation: Optimizing sampling techniques in multiple importance sampling. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3355089.3356565","ama":"Karlík O, Šik M, Vévoda P, Skrivan T, Křivánek J. MIS compensation: Optimizing sampling techniques in multiple importance sampling. ACM Transactions on Graphics. 2019;38(6). doi:10.1145/3355089.3356565"},"date_published":"2019-11-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"oa_version":"Preprint","status":"public","title":"On diffusive variants of some classical viscoelastic rate-type models","intvolume":" 2107","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6642","abstract":[{"text":"We present a thermodynamically based approach to the design of models for viscoelastic fluids with stress diffusion effect. In particular, we show how to add a stress diffusion term to some standard viscoelastic rate-type models (Giesekus, FENE-P, Johnson–Segalman, Phan-Thien–Tanner and Bautista–Manero–Puig) so that the resulting models with the added stress diffusion term are thermodynamically consistent in the sense that they obey the first and the second law of thermodynamics. We point out the potential applications of the provided thermodynamical background in the study of flows of fluids described by the proposed models.","lang":"eng"}],"type":"conference","date_published":"2019-05-21T00:00:00Z","publication":"AIP Conference Proceedings","citation":{"ama":"Dostalík M, Pruša V, Skrivan T. On diffusive variants of some classical viscoelastic rate-type models. In: AIP Conference Proceedings. Vol 2107. AIP Publishing; 2019. doi:10.1063/1.5109493","ieee":"M. Dostalík, V. Pruša, and T. Skrivan, “On diffusive variants of some classical viscoelastic rate-type models,” in AIP Conference Proceedings, Zlin, Czech Republic, 2019, vol. 2107.","apa":"Dostalík, M., Pruša, V., & Skrivan, T. (2019). On diffusive variants of some classical viscoelastic rate-type models. In AIP Conference Proceedings (Vol. 2107). Zlin, Czech Republic: AIP Publishing. https://doi.org/10.1063/1.5109493","ista":"Dostalík M, Pruša V, Skrivan T. 2019. On diffusive variants of some classical viscoelastic rate-type models. AIP Conference Proceedings. 8th International Conference on Novel Trends in Rheology vol. 2107, 020002.","short":"M. Dostalík, V. Pruša, T. Skrivan, in:, AIP Conference Proceedings, AIP Publishing, 2019.","mla":"Dostalík, Mark, et al. “On Diffusive Variants of Some Classical Viscoelastic Rate-Type Models.” AIP Conference Proceedings, vol. 2107, 020002, AIP Publishing, 2019, doi:10.1063/1.5109493.","chicago":"Dostalík, Mark, Vít Pruša, and Tomas Skrivan. “On Diffusive Variants of Some Classical Viscoelastic Rate-Type Models.” In AIP Conference Proceedings, Vol. 2107. AIP Publishing, 2019. https://doi.org/10.1063/1.5109493."},"day":"21","article_processing_charge":"No","scopus_import":"1","date_updated":"2024-02-28T13:01:28Z","date_created":"2019-07-15T10:07:09Z","volume":2107,"author":[{"full_name":"Dostalík, Mark","last_name":"Dostalík","first_name":"Mark"},{"full_name":"Pruša, Vít","last_name":"Pruša","first_name":"Vít"},{"full_name":"Skrivan, Tomas","last_name":"Skrivan","first_name":"Tomas","id":"486A5A46-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"AIP Publishing","department":[{"_id":"ChWo"}],"year":"2019","article_number":"020002","language":[{"iso":"eng"}],"conference":{"name":"8th International Conference on Novel Trends in Rheology","location":"Zlin, Czech Republic","start_date":"2019-07-30","end_date":"2019-07-31"},"doi":"10.1063/1.5109493","quality_controlled":"1","isi":1,"external_id":{"arxiv":["1902.07983"],"isi":["000479303100002"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1902.07983","open_access":"1"}],"month":"05"},{"publication_status":"published","department":[{"_id":"ChWo"}],"publisher":"Wiley","year":"2018","date_created":"2018-12-11T11:44:49Z","date_updated":"2023-09-11T14:00:26Z","volume":37,"author":[{"first_name":"Takahiro","last_name":"Sato","full_name":"Sato, Takahiro"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","first_name":"Christopher J"},{"full_name":"Thuerey, Nils","first_name":"Nils","last_name":"Thuerey"},{"full_name":"Igarashi, Takeo","last_name":"Igarashi","first_name":"Takeo"},{"full_name":"Ando, Ryoichi","last_name":"Ando","first_name":"Ryoichi"}],"file_date_updated":"2020-10-08T08:38:23Z","ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","call_identifier":"H2020","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"external_id":{"isi":["000434085600016"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1111/cgf.13351","month":"05","publication_identifier":{"issn":["0167-7055"]},"status":"public","ddc":["006"],"title":"Extended narrow band FLIP for liquid simulations","intvolume":" 37","_id":"135","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","file":[{"success":1,"checksum":"8edb90da8a72395eb5d970580e0925b6","date_created":"2020-10-08T08:38:23Z","date_updated":"2020-10-08T08:38:23Z","file_id":"8627","relation":"main_file","creator":"wojtan","content_type":"application/pdf","file_size":54309947,"access_level":"open_access","file_name":"exnbflip.pdf"}],"alternative_title":["Eurographics"],"type":"journal_article","abstract":[{"lang":"eng","text":"The Fluid Implicit Particle method (FLIP) reduces numerical dissipation by combining particles with grids. To improve performance, the subsequent narrow band FLIP method (NB‐FLIP) uses a FLIP‐based fluid simulation only near the liquid surface and a traditional grid‐based fluid simulation away from the surface. This spatially‐limited FLIP simulation significantly reduces the number of particles and alleviates a computational bottleneck. In this paper, we extend the NB‐FLIP idea even further, by allowing a simulation to transition between a FLIP‐like fluid simulation and a grid‐based simulation in arbitrary locations, not just near the surface. This approach leads to even more savings in memory and computation, because we can concentrate the particles only in areas where they are needed. More importantly, this new method allows us to seamlessly transition to smooth implicit surface geometry wherever the particle‐based simulation is unnecessary. Consequently, our method leads to a practical algorithm for avoiding the noisy surface artifacts associated with particle‐based liquid simulations, while simultaneously maintaining the benefits of a FLIP simulation in regions of dynamic motion."}],"issue":"2","article_type":"original","page":"169 - 177","publication":"Computer Graphics Forum","citation":{"short":"T. Sato, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, Computer Graphics Forum 37 (2018) 169–177.","mla":"Sato, Takahiro, et al. “Extended Narrow Band FLIP for Liquid Simulations.” Computer Graphics Forum, vol. 37, no. 2, Wiley, 2018, pp. 169–77, doi:10.1111/cgf.13351.","chicago":"Sato, Takahiro, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi Ando. “Extended Narrow Band FLIP for Liquid Simulations.” Computer Graphics Forum. Wiley, 2018. https://doi.org/10.1111/cgf.13351.","ama":"Sato T, Wojtan C, Thuerey N, Igarashi T, Ando R. Extended narrow band FLIP for liquid simulations. Computer Graphics Forum. 2018;37(2):169-177. doi:10.1111/cgf.13351","ieee":"T. Sato, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Extended narrow band FLIP for liquid simulations,” Computer Graphics Forum, vol. 37, no. 2. Wiley, pp. 169–177, 2018.","apa":"Sato, T., Wojtan, C., Thuerey, N., Igarashi, T., & Ando, R. (2018). Extended narrow band FLIP for liquid simulations. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13351","ista":"Sato T, Wojtan C, Thuerey N, Igarashi T, Ando R. 2018. Extended narrow band FLIP for liquid simulations. Computer Graphics Forum. 37(2), 169–177."},"date_published":"2018-05-22T00:00:00Z","scopus_import":"1","day":"22","has_accepted_license":"1","article_processing_charge":"No"},{"type":"journal_article","alternative_title":["SIGGRAPH"],"issue":"4","abstract":[{"lang":"eng","text":"The current state of the art in real-time two-dimensional water wave simulation requires developers to choose between efficient Fourier-based methods, which lack interactions with moving obstacles, and finite-difference or finite element methods, which handle environmental interactions but are significantly more expensive. This paper attempts to bridge this long-standing gap between complexity and performance, by proposing a new wave simulation method that can faithfully simulate wave interactions with moving obstacles in real time while simultaneously preserving minute details and accommodating very large simulation domains.\r\n\r\nPrevious methods for simulating 2D water waves directly compute the change in height of the water surface, a strategy which imposes limitations based on the CFL condition (fast moving waves require small time steps) and Nyquist's limit (small wave details require closely-spaced simulation variables). This paper proposes a novel wavelet transformation that discretizes the liquid motion in terms of amplitude-like functions that vary over space, frequency, and direction, effectively generalizing Fourier-based methods to handle local interactions. Because these new variables change much more slowly over space than the original water height function, our change of variables drastically reduces the limitations of the CFL condition and Nyquist limit, allowing us to simulate highly detailed water waves at very large visual resolutions. Our discretization is amenable to fast summation and easy to parallelize. We also present basic extensions like pre-computed wave paths and two-way solid fluid coupling. Finally, we argue that our discretization provides a convenient set of variables for artistic manipulation, which we illustrate with a novel wave-painting interface."}],"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","_id":"134","intvolume":" 37","title":"Water surface wavelets","status":"public","ddc":["000"],"file":[{"file_id":"5744","relation":"main_file","date_updated":"2020-07-14T12:44:45Z","date_created":"2018-12-18T09:59:23Z","checksum":"db75ebabe2ec432bf41389e614d6ef62","file_name":"2018_ACM_Jeschke.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":22185016}],"oa_version":"Published Version","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"30","citation":{"chicago":"Jeschke, Stefan, Tomas Skrivan, Matthias Mueller Fischer, Nuttapong Chentanez, Miles Macklin, and Chris Wojtan. “Water Surface Wavelets.” ACM Transactions on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201336.","short":"S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, C. Wojtan, ACM Transactions on Graphics 37 (2018).","mla":"Jeschke, Stefan, et al. “Water Surface Wavelets.” ACM Transactions on Graphics, vol. 37, no. 4, 94, ACM, 2018, doi:10.1145/3197517.3201336.","ieee":"S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, and C. Wojtan, “Water surface wavelets,” ACM Transactions on Graphics, vol. 37, no. 4. ACM, 2018.","apa":"Jeschke, S., Skrivan, T., Mueller Fischer, M., Chentanez, N., Macklin, M., & Wojtan, C. (2018). Water surface wavelets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3197517.3201336","ista":"Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C. 2018. Water surface wavelets. ACM Transactions on Graphics. 37(4), 94.","ama":"Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C. Water surface wavelets. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201336"},"publication":"ACM Transactions on Graphics","date_published":"2018-07-30T00:00:00Z","article_number":"94","publist_id":"7789","ec_funded":1,"file_date_updated":"2020-07-14T12:44:45Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","year":"2018","department":[{"_id":"ChWo"}],"publisher":"ACM","publication_status":"published","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/new-water-simulation-captures-small-details-even-in-large-scenes/"}]},"author":[{"first_name":"Stefan","last_name":"Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Jeschke, Stefan"},{"id":"486A5A46-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas","last_name":"Skrivan","full_name":"Skrivan, Tomas"},{"last_name":"Mueller Fischer","first_name":"Matthias","full_name":"Mueller Fischer, Matthias"},{"full_name":"Chentanez, Nuttapong","first_name":"Nuttapong","last_name":"Chentanez"},{"full_name":"Macklin, Miles","first_name":"Miles","last_name":"Macklin"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan"}],"volume":37,"date_created":"2018-12-11T11:44:48Z","date_updated":"2024-02-28T13:58:51Z","month":"07","external_id":{"isi":["000448185000055"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa":1,"project":[{"call_identifier":"H2020","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"isi":1,"quality_controlled":"1","doi":"10.1145/3197517.3201336","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}]},{"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2017-07-01T00:00:00Z","citation":{"ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103.","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017.","apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678."},"publication":"ACM Transactions on Graphics","article_type":"original","issue":"4","abstract":[{"text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios.","lang":"eng"}],"type":"journal_article","file":[{"relation":"main_file","file_id":"7359","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","date_updated":"2020-07-14T12:46:34Z","date_created":"2020-01-24T09:32:35Z","access_level":"open_access","file_name":"wavepackets_final.pdf","file_size":13131683,"content_type":"application/pdf","creator":"wojtan"}],"oa_version":"Published Version","_id":"470","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 36","ddc":["006"],"status":"public","title":"Water wave packets","publication_identifier":{"issn":["07300301"]},"month":"07","doi":"10.1145/3072959.3073678","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"project":[{"call_identifier":"H2020","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176"}],"quality_controlled":"1","ec_funded":1,"publist_id":"7350","file_date_updated":"2020-07-14T12:46:34Z","article_number":"103","author":[{"first_name":"Stefan","last_name":"Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Jeschke, Stefan"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","full_name":"Wojtan, Christopher J"}],"volume":36,"date_created":"2018-12-11T11:46:39Z","date_updated":"2023-02-23T12:20:26Z","year":"2017","department":[{"_id":"ChWo"}],"publisher":"ACM","publication_status":"published"},{"scopus_import":1,"day":"01","article_processing_charge":"No","article_type":"original","page":"95 - 106","publication":"Computer Graphics Forum","citation":{"ama":"Schreck C, Rohmer D, Hahmann S. Interactive paper tearing. Computer Graphics Forum. 2017;36(2):95-106. doi:10.1111/cgf.13110","ieee":"C. Schreck, D. Rohmer, and S. Hahmann, “Interactive paper tearing,” Computer Graphics Forum, vol. 36, no. 2. Wiley, pp. 95–106, 2017.","apa":"Schreck, C., Rohmer, D., & Hahmann, S. (2017). Interactive paper tearing. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13110","ista":"Schreck C, Rohmer D, Hahmann S. 2017. Interactive paper tearing. Computer Graphics Forum. 36(2), 95–106.","short":"C. Schreck, D. Rohmer, S. Hahmann, Computer Graphics Forum 36 (2017) 95–106.","mla":"Schreck, Camille, et al. “Interactive Paper Tearing.” Computer Graphics Forum, vol. 36, no. 2, Wiley, 2017, pp. 95–106, doi:10.1111/cgf.13110.","chicago":"Schreck, Camille, Damien Rohmer, and Stefanie Hahmann. “Interactive Paper Tearing.” Computer Graphics Forum. Wiley, 2017. https://doi.org/10.1111/cgf.13110."},"date_published":"2017-05-01T00:00:00Z","type":"journal_article","abstract":[{"text":"We propose an efficient method to model paper tearing in the context of interactive modeling. The method uses geometrical information to automatically detect potential starting points of tears. We further introduce a new hybrid geometrical and physical-based method to compute the trajectory of tears while procedurally synthesizing high resolution details of the tearing path using a texture based approach. The results obtained are compared with real paper and with previous studies on the expected geometric paths of paper that tears.","lang":"eng"}],"issue":"2","status":"public","ddc":["000"],"title":"Interactive paper tearing","intvolume":" 36","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"670","oa_version":"Published Version","month":"05","publication_identifier":{"issn":["01677055"]},"quality_controlled":"1","project":[{"_id":"25357BD2-B435-11E9-9278-68D0E5697425","grant_number":"P 24352-N23","name":"Deep Pictures: Creating Visual and Haptic Vector Images","call_identifier":"FWF"}],"oa":1,"main_file_link":[{"url":"https://hal.inria.fr/hal-01647113/file/eg_2017_schreck_paper_tearing.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1111/cgf.13110","publist_id":"7056","publication_status":"published","publisher":"Wiley","department":[{"_id":"ChWo"}],"year":"2017","date_updated":"2021-01-12T08:08:37Z","date_created":"2018-12-11T11:47:49Z","volume":36,"author":[{"full_name":"Schreck, Camille","first_name":"Camille","last_name":"Schreck","id":"2B14B676-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rohmer","first_name":"Damien","full_name":"Rohmer, Damien"},{"last_name":"Hahmann","first_name":"Stefanie","full_name":"Hahmann, Stefanie"}]},{"date_published":"2017-09-01T00:00:00Z","citation":{"ista":"Manteaux P, Wojtan C, Narain R, Redon S, Faure F, Cani M. 2017. Adaptive physically based models in computer graphics. Computer Graphics Forum. 36(6), 312–337.","apa":"Manteaux, P., Wojtan, C., Narain, R., Redon, S., Faure, F., & Cani, M. (2017). Adaptive physically based models in computer graphics. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12941","ieee":"P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, and M. Cani, “Adaptive physically based models in computer graphics,” Computer Graphics Forum, vol. 36, no. 6. Wiley-Blackwell, pp. 312–337, 2017.","ama":"Manteaux P, Wojtan C, Narain R, Redon S, Faure F, Cani M. Adaptive physically based models in computer graphics. Computer Graphics Forum. 2017;36(6):312-337. doi:10.1111/cgf.12941","chicago":"Manteaux, Pierre, Chris Wojtan, Rahul Narain, Stéphane Redon, François Faure, and Marie Cani. “Adaptive Physically Based Models in Computer Graphics.” Computer Graphics Forum. Wiley-Blackwell, 2017. https://doi.org/10.1111/cgf.12941.","mla":"Manteaux, Pierre, et al. “Adaptive Physically Based Models in Computer Graphics.” Computer Graphics Forum, vol. 36, no. 6, Wiley-Blackwell, 2017, pp. 312–37, doi:10.1111/cgf.12941.","short":"P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, M. Cani, Computer Graphics Forum 36 (2017) 312–337."},"publication":"Computer Graphics Forum","page":"312 - 337","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","pubrep_id":"634","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:16:21Z","date_updated":"2020-07-14T12:44:47Z","checksum":"7676e9a9ead6d58c3000988c97deb2ef","file_id":"5208","relation":"main_file","creator":"system","file_size":1434439,"content_type":"application/pdf","file_name":"IST-2016-634-v1+1_starAdaptivity-cgf.pdf","access_level":"open_access"}],"_id":"1367","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 36","title":"Adaptive physically based models in computer graphics","status":"public","ddc":["000"],"issue":"6","abstract":[{"lang":"eng","text":"One of the major challenges in physically based modelling is making simulations efficient. Adaptive models provide an essential solution to these efficiency goals. These models are able to self-adapt in space and time, attempting to provide the best possible compromise between accuracy and speed. This survey reviews the adaptive solutions proposed so far in computer graphics. Models are classified according to the strategy they use for adaptation, from time-stepping and freezing techniques to geometric adaptivity in the form of structured grids, meshes and particles. Applications range from fluids, through deformable bodies, to articulated solids."}],"type":"journal_article","doi":"10.1111/cgf.12941","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000408634200019"]},"quality_controlled":"1","isi":1,"publication_identifier":{"issn":["01677055"]},"month":"09","author":[{"last_name":"Manteaux","first_name":"Pierre","full_name":"Manteaux, Pierre"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","full_name":"Wojtan, Christopher J"},{"full_name":"Narain, Rahul","first_name":"Rahul","last_name":"Narain"},{"first_name":"Stéphane","last_name":"Redon","full_name":"Redon, Stéphane"},{"last_name":"Faure","first_name":"François","full_name":"Faure, François"},{"last_name":"Cani","first_name":"Marie","full_name":"Cani, Marie"}],"volume":36,"date_created":"2018-12-11T11:51:37Z","date_updated":"2023-09-20T11:05:36Z","year":"2017","acknowledgement":"This work was partly supported by the starting grants ADAPT and BigSplash, as well as the advanced grant EXPRESSIVE from the European Research Council (ERC-2012-StG_20111012, ERC-2014-StG_638176 and ERC-2011-ADG_20110209).","department":[{"_id":"ChWo"}],"publisher":"Wiley-Blackwell","publication_status":"published","publist_id":"5873","file_date_updated":"2020-07-14T12:44:47Z"},{"month":"01","publication_identifier":{"issn":["18777503"]},"oa":1,"external_id":{"isi":["000393528700009"]},"isi":1,"quality_controlled":"1","doi":"10.1016/j.jocs.2016.06.007","language":[{"iso":"eng"}],"file_date_updated":"2019-01-18T08:43:16Z","publist_id":"6206","year":"2017","publication_status":"published","publisher":"Elsevier","department":[{"_id":"ChWo"}],"author":[{"full_name":"Gajda-Zagorska, Ewa P","last_name":"Gajda-Zagorska","first_name":"Ewa P","id":"47794CF0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schaefer, Robert","last_name":"Schaefer","first_name":"Robert"},{"full_name":"Smołka, Maciej","first_name":"Maciej","last_name":"Smołka"},{"full_name":"Pardo, David","last_name":"Pardo","first_name":"David"},{"first_name":"Julen","last_name":"Alvarez Aramberri","full_name":"Alvarez Aramberri, Julen"}],"date_updated":"2023-09-20T11:29:44Z","date_created":"2018-12-11T11:50:26Z","volume":18,"scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","publication":"Journal of Computational Science","citation":{"ieee":"E. P. Gajda-Zagorska, R. Schaefer, M. Smołka, D. Pardo, and J. Alvarez Aramberri, “A multi objective memetic inverse solver reinforced by local optimization methods,” Journal of Computational Science, vol. 18. Elsevier, pp. 85–94, 2017.","apa":"Gajda-Zagorska, E. P., Schaefer, R., Smołka, M., Pardo, D., & Alvarez Aramberri, J. (2017). A multi objective memetic inverse solver reinforced by local optimization methods. Journal of Computational Science. Elsevier. https://doi.org/10.1016/j.jocs.2016.06.007","ista":"Gajda-Zagorska EP, Schaefer R, Smołka M, Pardo D, Alvarez Aramberri J. 2017. A multi objective memetic inverse solver reinforced by local optimization methods. Journal of Computational Science. 18, 85–94.","ama":"Gajda-Zagorska EP, Schaefer R, Smołka M, Pardo D, Alvarez Aramberri J. A multi objective memetic inverse solver reinforced by local optimization methods. Journal of Computational Science. 2017;18:85-94. doi:10.1016/j.jocs.2016.06.007","chicago":"Gajda-Zagorska, Ewa P, Robert Schaefer, Maciej Smołka, David Pardo, and Julen Alvarez Aramberri. “A Multi Objective Memetic Inverse Solver Reinforced by Local Optimization Methods.” Journal of Computational Science. Elsevier, 2017. https://doi.org/10.1016/j.jocs.2016.06.007.","short":"E.P. Gajda-Zagorska, R. Schaefer, M. Smołka, D. Pardo, J. Alvarez Aramberri, Journal of Computational Science 18 (2017) 85–94.","mla":"Gajda-Zagorska, Ewa P., et al. “A Multi Objective Memetic Inverse Solver Reinforced by Local Optimization Methods.” Journal of Computational Science, vol. 18, Elsevier, 2017, pp. 85–94, doi:10.1016/j.jocs.2016.06.007."},"page":"85 - 94","date_published":"2017-01-01T00:00:00Z","type":"journal_article","abstract":[{"text":"We propose a new memetic strategy that can solve the multi-physics, complex inverse problems, formulated as the multi-objective optimization ones, in which objectives are misfits between the measured and simulated states of various governing processes. The multi-deme structure of the strategy allows for both, intensive, relatively cheap exploration with a moderate accuracy and more accurate search many regions of Pareto set in parallel. The special type of selection operator prefers the coherent alternative solutions, eliminating artifacts appearing in the particular processes. The additional accuracy increment is obtained by the parallel convex searches applied to the local scalarizations of the misfit vector. The strategy is dedicated for solving ill-conditioned problems, for which inverting the single physical process can lead to the ambiguous results. The skill of the selection in artifact elimination is shown on the benchmark problem, while the whole strategy was applied for identification of oil deposits, where the misfits are related to various frequencies of the magnetic and electric waves of the magnetotelluric measurements. 2016 Elsevier B.V.","lang":"eng"}],"_id":"1152","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["000"],"title":"A multi objective memetic inverse solver reinforced by local optimization methods","status":"public","intvolume":" 18","oa_version":"Submitted Version","file":[{"success":1,"date_updated":"2019-01-18T08:43:16Z","date_created":"2019-01-18T08:43:16Z","file_id":"5842","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":1083911,"access_level":"open_access","file_name":"2016_jocs_ewa.pdf"}]},{"doi":"10.1109/CVPR.2017.587","conference":{"end_date":"2017-07-26","location":"Honolulu, HA, United States","start_date":"2017-07-21","name":"CVPR: Computer Vision and Pattern Recognition"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.07725"}],"external_id":{"isi":["000418371405066"]},"project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","publication_identifier":{"isbn":["978-153860457-1"]},"month":"04","author":[{"full_name":"Rebuffi, Sylvestre Alvise","last_name":"Rebuffi","first_name":"Sylvestre Alvise"},{"last_name":"Kolesnikov","first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander"},{"first_name":"Georg","last_name":"Sperl","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","full_name":"Sperl, Georg"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"}],"volume":2017,"date_updated":"2023-09-22T09:51:58Z","date_created":"2018-12-11T11:49:37Z","year":"2017","publisher":"IEEE","department":[{"_id":"ChLa"},{"_id":"ChWo"}],"publication_status":"published","ec_funded":1,"publist_id":"6400","date_published":"2017-04-14T00:00:00Z","citation":{"apa":"Rebuffi, S. A., Kolesnikov, A., Sperl, G., & Lampert, C. (2017). iCaRL: Incremental classifier and representation learning (Vol. 2017, pp. 5533–5542). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.587","ieee":"S. A. Rebuffi, A. Kolesnikov, G. Sperl, and C. Lampert, “iCaRL: Incremental classifier and representation learning,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 5533–5542.","ista":"Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. 2017. iCaRL: Incremental classifier and representation learning. CVPR: Computer Vision and Pattern Recognition vol. 2017, 5533–5542.","ama":"Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. iCaRL: Incremental classifier and representation learning. In: Vol 2017. IEEE; 2017:5533-5542. doi:10.1109/CVPR.2017.587","chicago":"Rebuffi, Sylvestre Alvise, Alexander Kolesnikov, Georg Sperl, and Christoph Lampert. “ICaRL: Incremental Classifier and Representation Learning,” 2017:5533–42. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.587.","short":"S.A. Rebuffi, A. Kolesnikov, G. Sperl, C. Lampert, in:, IEEE, 2017, pp. 5533–5542.","mla":"Rebuffi, Sylvestre Alvise, et al. ICaRL: Incremental Classifier and Representation Learning. Vol. 2017, IEEE, 2017, pp. 5533–42, doi:10.1109/CVPR.2017.587."},"page":"5533 - 5542","article_processing_charge":"No","day":"14","scopus_import":"1","oa_version":"Submitted Version","_id":"998","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 2017","title":"iCaRL: Incremental classifier and representation learning","status":"public","abstract":[{"lang":"eng","text":"A major open problem on the road to artificial intelligence is the development of incrementally learning systems that learn about more and more concepts over time from a stream of data. In this work, we introduce a new training strategy, iCaRL, that allows learning in such a class-incremental way: only the training data for a small number of classes has to be present at the same time and new classes can be added progressively. iCaRL learns strong classifiers and a data representation simultaneously. This distinguishes it from earlier works that were fundamentally limited to fixed data representations and therefore incompatible with deep learning architectures. We show by experiments on CIFAR-100 and ImageNet ILSVRC 2012 data that iCaRL can learn many classes incrementally over a long period of time where other strategies quickly fail. "}],"type":"conference"},{"_id":"839","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["004","005","006","531","621"],"status":"public","title":"Brittle fracture simulation with boundary elements for computer graphics","pubrep_id":"855","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2017-855-v1+1_thesis_online_pdfA.pdf","creator":"system","content_type":"application/pdf","file_size":14596191,"file_id":"5100","relation":"main_file","checksum":"6c1ae8c90bfaba5e089417fefbc4a272","date_created":"2018-12-12T10:14:46Z","date_updated":"2020-07-14T12:48:13Z"},{"access_level":"closed","file_name":"2017_thesis_Hahn_source.zip","content_type":"application/zip","file_size":15060566,"creator":"dernst","relation":"source_file","file_id":"6207","checksum":"421672f68d563b029869c5cf1713f919","date_updated":"2020-07-14T12:48:13Z","date_created":"2019-04-05T08:40:30Z"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"This thesis describes a brittle fracture simulation method for visual effects applications. Building upon a symmetric Galerkin boundary element method, we first compute stress intensity factors following the theory of linear elastic fracture mechanics. We then use these stress intensities to simulate the motion of a propagating crack front at a significantly higher resolution than the overall deformation of the breaking object. Allowing for spatial variations of the material's toughness during crack propagation produces visually realistic, highly-detailed fracture surfaces. Furthermore, we introduce approximations for stress intensities and crack opening displacements, resulting in both practical speed-up and theoretically superior runtime complexity compared to previous methods. While we choose a quasi-static approach to fracture mechanics, ignoring dynamic deformations, we also couple our fracture simulation framework to a standard rigid-body dynamics solver, enabling visual effects artists to simulate both large scale motion, as well as fracturing due to collision forces in a combined system. As fractures inside of an object grow, their geometry must be represented both in the coarse boundary element mesh, as well as at the desired fine output resolution. Using a boundary element method, we avoid complicated volumetric meshing operations. Instead we describe a simple set of surface meshing operations that allow us to progressively add cracks to the mesh of an object and still re-use all previously computed entries of the linear boundary element system matrix. On the high resolution level, we opt for an implicit surface representation. We then describe how to capture fracture surfaces during crack propagation, as well as separate the individual fragments resulting from the fracture process, based on this implicit representation. We show results obtained with our method, either solving the full boundary element system in every time step, or alternatively using our fast approximations. These results demonstrate that both of these methods perform well in basic test cases and produce realistic fracture surfaces. Furthermore we show that our fast approximations substantially out-perform the standard approach in more demanding scenarios. Finally, these two methods naturally combine, using the full solution while the problem size is manageably small and switching to the fast approximations later on. The resulting hybrid method gives the user a direct way to choose between speed and accuracy of the simulation. ","lang":"eng"}],"citation":{"ama":"Hahn D. Brittle fracture simulation with boundary elements for computer graphics. 2017. doi:10.15479/AT:ISTA:th_855","apa":"Hahn, D. (2017). Brittle fracture simulation with boundary elements for computer graphics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_855","ieee":"D. Hahn, “Brittle fracture simulation with boundary elements for computer graphics,” Institute of Science and Technology Austria, 2017.","ista":"Hahn D. 2017. Brittle fracture simulation with boundary elements for computer graphics. Institute of Science and Technology Austria.","short":"D. Hahn, Brittle Fracture Simulation with Boundary Elements for Computer Graphics, Institute of Science and Technology Austria, 2017.","mla":"Hahn, David. Brittle Fracture Simulation with Boundary Elements for Computer Graphics. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_855.","chicago":"Hahn, David. “Brittle Fracture Simulation with Boundary Elements for Computer Graphics.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_855."},"page":"124","date_published":"2017-08-14T00:00:00Z","day":"14","has_accepted_license":"1","article_processing_charge":"No","year":"2017","acknowledgement":"ERC H2020 programme (grant agreement no. 638176)\r\nFirst of all, let me thank my committee members, especially my supervisor, Chris\r\nWojtan, for supporting me throughout my PhD. Obviously, none of this work would\r\nhave been possible without you.\r\nFurthermore, Thank You to all the people who have contributed to this work in various\r\nways, in particular Martin Schanz and his group for providing and supporting the\r\nHyENA boundary element library, as well as Eder Miguel and Morten Bojsen-Hansen\r\nfor (repeatedly) proof reading and providing valuable suggestions during the writing\r\nof this thesis.\r\nI would also like to thank Bernd Bickel, and all the members – past and present – of his\r\nand Chris’ research groups at IST Austria for always providing honest and insightful\r\nfeedback throughout many joint group meetings, as well as Christopher Batty, Eitan\r\nGrinspun, and Fang Da for many insights into boundary element methods during our\r\ncollaboration.\r\nAs only virtual objects have been harmed in the process of creating this work, I would\r\nlike to acknowledge the Stanford scanning repository for providing the “Bunny” and\r\n“Armadillo” models, the AIM@SHAPE repository for “Pierre’s hand, watertight”, and\r\nS. Gainsbourg for the “Column” via Archive3D.net. Sorry for breaking these models\r\nin many different ways.\r\n","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ChWo"}],"author":[{"full_name":"Hahn, David","id":"357A6A66-F248-11E8-B48F-1D18A9856A87","first_name":"David","last_name":"Hahn"}],"related_material":{"record":[{"id":"1362","status":"public","relation":"part_of_dissertation"},{"id":"1633","relation":"part_of_dissertation","status":"public"},{"relation":"popular_science","status":"public","id":"5568"}]},"date_updated":"2024-02-21T13:48:02Z","date_created":"2018-12-11T11:48:47Z","file_date_updated":"2020-07-14T12:48:13Z","ec_funded":1,"publist_id":"6809","license":"https://creativecommons.org/licenses/by-sa/4.0/","tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode"},"oa":1,"project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"doi":"10.15479/AT:ISTA:th_855","supervisor":[{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","first_name":"Christopher J"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"month":"08","publication_identifier":{"issn":["2663-337X"]}}]