Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos 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