Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Orthogonal maps are two-dimensional mappings that are solutions of the so-called origami problem obtained when folding a paper. These mappings are piecewise linear, and the discontinuities of their gradient form a singular set composed of straight lines representing the folding edges. The proposed algorithm relies on the minimization of a variational principle discussed in Caboussat et al. (2019). A splitting algorithm for the corresponding flow problem derived from the first-order optimality conditions alternates between local nonlinear problems and linear elliptic variational problems at each time step. Anisotropic adaptive techniques allow to obtain refined triangulations near the folding edges while keeping the number of vertices as low as possible. Numerical experiments validate the accuracy and efficiency of the adaptive method in various situations. Appropriate convergence properties are exhibited, and solutions with sharp edges are recovered. (C)& nbsp;2021 The Author(s). Published by Elsevier B.V.& nbsp;
Simone Deparis, Roland John Tormey, Cécile Hardebolle, Alexandra Corina Niculescu