Skip to main content
Springer logoLink to Springer
. 2026 Jan 4;25(1):12. doi: 10.1007/s10237-025-02035-5

Optimization of the cut configuration for skin grafts

Helmut Harbrecht 1,, Viacheslav Karnaev 1
PMCID: PMC12764539  PMID: 41484680

Abstract

The subject of this work is the problem of optimizing the configuration of cuts for skin grafting in order to improve the efficiency of the procedure. We consider the optimization problem in the framework of a linear elasticity model. We choose three mechanical measures that define optimality via related objective functionals: the compliance, the Lp-norm of the von Mises stress, and the area covered by the stretched skin. We provide a proof of the existence of the solution for each problem, but we cannot claim uniqueness. We compute the gradient of the objectives with respect to the cut configuration using concepts from shape calculus. To solve the problem numerically, we apply the gradient descent method, which performs well under uniaxial stretching. However, in more complex cases, such as multidirectional stretching, its effectiveness is limited due to the low sensitivity of the functionals under consideration.To avoid this difficulty, we use a combination of the genetic algorithm and the gradient descent method, which leads to a significant improvement in the results.

Keywords: Skin grafts, Cut configuration, Optimization

Introduction

Skin grafting is a surgical procedure. Healthy skin is removed from one part of the body and transplanted. The healthy skin covers or replaces damaged or lost skin, for example, on the lower leg, to get a wound healed. The most commonly used skin graft is the split-thickness skin graft (SSG) which is a thin layer of shaved skin, see Maskan Bermudez et al. (2024); Taylor et al. (2021) for example. It is called split-thickness because only the epidermis and part of the dermis is shaved off, leaving part of the skin behind. As a result, the part left behind, called the donor site, can heal on its own without needing any additional skin covering.

To transplant as small a piece of skin as possible or, vice versa, in order to cover as large a piece of skin as possible, numerous parallel rows of short cuts are made in the healthy, harvested skin by using a suitable skin graft mesh device. The question we like to address in this article is: Is there a better pattern to enlarge the healthy piece of skin than just making parallel cuts? We tackle this problem by means of shape optimization (Delfour and Zolésio 2011; Henrot and Pierre 2018; Pironneau 1983; Sokołowski and Zolésio 1992), which means we are searching for an optimal layout of the cuts. To this end, we model the piece of skin by the equations of linear elasticity in two spatial dimensions and try to optimize the orientation of specific, predefined cuts such that a cost functional is optimized. We consider different cost functionals when stretching the skin: We (a) minimize the von Mises stress which ensures a small loading of the piece of skin, (b) maximize the area of the skin after the stretching procedure, and (c) minimize the compliance of the piece of skin. We analytically compute the Hadamard shape gradient for either cost functional which enables us to perform a gradient-based optimization algorithm.

Note that the linear-elastic model is the simplest constitutive model which is used to represent the mechanical behaviour of skin and its layers, see, e.g. Joodaki and Panzer (2018) for an overview of different skin models. Human skin is indeed not a simple object from the modelling point of view and its properties would be better described by a non-linear hyperelasticity model. However, we have chosen this simple model in order to be able to compute analytical expressions of the shape gradients of the cost functions under consideration. Moreover, the numerical simulation of the equations of linear elasticity can easily be carried out using the finite element method, compare (Braess 2001; Brenner and Scott 2008) for example. We use in our computations the finite element solver FreeFem++, see Hecht (2012).

Our particular setup is as follows. A quadratic piece of skin is subdivided into regular grid cells, each of which contains a cut that is anchored in the centre of the cell. The design variable is the rotation angle of the cut. However, it turns out that the shape functionals are not very sensitive with respect to the design variables. Moreover, we observe numerous local minima. We have therefore decided to group the cells into blocks that all match, so that the skin is represented by identical copies of one of these blocks. Moreover, we also combined the gradient-based optimization with a genetic algorithm in order to avoid to get stuck in a local minimum. Both ideas improve the optimization results considerably, as can be seen later in Sect. 4.

We finally like to mention related literature. An extensive study of different patterns in skin grafting is found in Gupta et al. (2022). Likewise, also in Capek et al. (2018); Gupta and Chanda (2023); Gupta et al. (2022) one can find results of forward simulations for predefined patterns. In contrast to these articles, however, we try to find the optimal pattern for skin grafting in case of the specific situation under consideration by an optimization algorithm. Indeed, we are only aware of Sutula et al. (2020), where also shape optimization has been exploited by means of a phase-field model in combination with a first discretize-then-optimize approach. Nonetheless, the results therein are completely different from our findings as we only vary the orientation of predefined cuts.

The rest of this article is organized as follows. In Sect. 2, we formulate the problem under consideration and cast it into shape optimization problems given by three different shape functionals. We then derive in Sect. 3 the related shape gradients and show the existence of solutions to the shape optimization problems under consideration. The numerical method is introduced in Sect. 4. Results of the numerical optimization process are presented which demonstrate the feasibility of our approach. Finally, concluding remarks are stated in Sect. 5.

Problem formulation

We first introduce some general notation and define the governing equations describing a stretched elastic body with N cuts modelled as holes with a prescribed shape, size, and position of the centres. Each hole is thus uniquely determined by a rotation angle. Hence, the configuration of the cuts is defined by N angles. We proceed with the formulation of the shape optimization problems for the unknown angles in order to find the optimal configuration of the cuts. We finish this section by proving the existence of solutions to the optimization problems under consideration.

Notation

Let ΩR2 be a bounded and connected domain with Lipschitz-smooth external boundary Γ that is divided into two subsets ΓD and ΓN satisfying

|ΓD|>0such thatΓ=Γ¯DΓ¯NandΓDΓN=.

We further assume that there are N holes with smooth boundaries ωαi,i=1,,N, inside the domain. They are of the same shape and size, positioned on an equispaced grid, but with different angles of deviation from the abscissa axis. The set of all holes is denoted as

ωα:=i=1Nωαi,whereα=(α1,,αN)[0,2π)N.

We shall consider an elastic body with N cuts, represented by the domain Ωα:=Ω\ωα. The state of the body is determined by the vector field of displacements u:ΩR2. The mechanical properties of the body are completely characterized by the constant, symmetric, fourth-order stiffness tensor C, which incorporates the material parameters—the Young modulus E>0 and the Poisson ratio -1<ν<1/2.

Throughout this article, we use the notation

ε(u):=12u+u,where[u]i,j:=uixj,i,j=1,2,

for the deformation tensor and

σ(u):=C:ε(u)=2με(u)+λdiv(u)I

for the stress tensor, where I is the 2×2 identity matrix and the Lamé constants are

μ=E2(1+ν)andλ=νE(1+ν)(1-2ν).

Governing equations

To simplify the model, we consider the cuts as thin, elliptical holes ωαi, i=1,,N. The main mechanical quantity is the displacement field uH1(Ωα)2. It is described by the equations of linear elasticity, supplemented by boundary conditions. The elastic body is subject to the body force fL2(Ωα)2 in the whole domain Ωα and the external displacements gL2(ΓD)2 on the part ΓD of its outer boundary, while the remaining part ΓN and the boundaries ωα of the holes are unconstrained. Therefore, we arrive at the boundary value problem

-div(σ(u))=finΩα,σ(u)n=0onΓNωα,u=gonΓD. 2.1

Here, n denotes the outward pointing unit normal vector on Ωα. A visualization of the model can be found in Fig. 1.

Fig. 1.

Fig. 1

The model for the elastic body with cuts which are represented by thin elliptical holes

In order to derive the variational formulation of (2.1), we define the space of admissible displacements

H(Ωα):=uH1(Ωα)2|u=gonΓD.

Moreover, the respective test space is given by

H0(Ωα):=uH1(Ωα)2|u=0onΓD.

The scalar product and norm in H(Ωα) defined as

u,vH(Ωα)=Ωασ(u):ε(v)dxanduH(Ωα)=Ωασ(u):ε(u)dx. 2.2

In the same way, it is defined in H0(Ωα). Thus, the variational formulation associated to the system (2.1) reads as follows: find uH(Ωα) such that

Ωασ(u):ε(v)dx=Ωαf·vdxvH0(Ωα). 2.3

In view of the Lax–Milgram theorem together with Korn’s inequality, the variational formulation (2.3) and hence the system (2.1) admits a unique solution uH(Ωα).

Optimization problem

We are looking for the optimal configuration Ωα of the model described above. By optimal, we mean that the objective functional reaches a minimum or maximum (depending on the task at hand) in the set of admissible configurations. We consider two different cost functionals for the minimization problem, the compliance and the Lp-norm of the von Mises stress, and one for the maximization problem, the area of the deformed body. Here and in the following, we mean by uα the solution of (2.1) for the body Ωα that is determined by αRN.

  • The compliance is given by
    C(Ωα):=Ωασ(uα):ε(uα)dx.
  • The von Mises stress in R2 is defined as
    σVM(u):=σd(u):σd(u),
    where σd is the stress deviator tensor
    σd(u):=σ(u)-tr(σ(u))2I=2με(u)-div(u)I.
    Of central interest from an application point of view is the L-norm of the von Mises stress. However, it is not differentiable. Therefore, since we want to use gradient-based methods, we consider the Lp-norm, which is known to converge to the L-norm at p. So we define the objective functional as
    M(Ωα):=Ωα|σVM(uα)|pdx1/p=Ωα(σd(uα):σd(uα))p/2dx1/p.
    Since we consider a convex domain with smooth cuts, we have uαH2(Ωα)2. Thus, there holds uαH1(Ωα)2×2Lq(Ωα)2×2 for any finite q. As a consequence, M(Ωα) is well defined for any finite p.
  • The deformed body is defined as (Ωα)uα:=(Id+uα)(Ωα), where Id:R2R2 is the identity mapping. Thus, its area is given by
    A(Ωα):=(Ωα)uαdx=Ωαdet(I+uα)dx.
    We note that the change of the local measure of area in linearized elasticity is characterized by div(uα), which corresponds to the first-order expansion of det(I+uα). In order to keep the formulation consistent with possible extensions to finite (nonlinear) elasticity, we define the functional A(Ωα) by using the determinant. In the linear elasticity case considered in this article, both definitions coincide up to higher-order terms, while the chosen form allows for the seamless transition to large-deformation models.

We define the set of admissible configurations as

O2π:={ΩαR2|α(Rmod2π)N}.

Note that the set O2π is homeomorphic to (Rmod2π)N which is compact in the standard Euclidean metric dRN(·,·). Thus, we conclude compactness of O2π in the metric that is defined by

d(Ωα,Ωα):=dRN(A-1(Ωα),A-1(Ωα))=dRN(α,α),

where A:(Rmod2π)NO2π is a homeomorphism.

We are now in the position to formulate the three shape optimization problems for finding the optimal cuts in the body as follows: find ΩαC,ΩαM,ΩαAO2π such that

C(ΩαC)=infαO2πC(Ωα), 2.4
M(ΩαM)=infαO2πM(Ωα), 2.5
A(ΩαA)=supαO2πA(Ωα). 2.6

Since these optimization problems are formulated over a compact set, we only need to show that the above functionals are continuous in order to prove the existence of a solution. However, there is a certain difficulty as the functionals depend not only directly on α, but also on the solution uα. The sequence {Ωαn}nNO2π corresponds to the relative sequence of fields {unH(Ωαn)}nN, each element of which is defined in its own space. Therefore, for mathematical analysis, we will map them to a single, fixed space as follows.

Let us fix some arbitrary ΩαO2π and a sequence {Ωαn}nNO2π. Since the cuts ωαn,i do not intersect each other for fixed n, we can define the non-intersecting and closed sets Bri:={xR2:x2ri} and BRi{xR2:x2Ri} such that ωαn,iBriBRiΩ for any n. Let χi(x)C0(Ω) be such that

χi(x):=1,ifxBri,0,ifxΩ\BRi, 2.7

for i=1,,N. Let further {Oi,n}nN be a sequence of orthogonal matrices defined as

On,i=cos(αi-αn,i)-sin(αi-αn,i)sin(αi-αn,i)-cos(αi-αn,i)for anyi=1,,NandnN.

Thus, we define a sequence {ϕn}nN of diffeomorphisms in accordance with

ϕn(x):=x+i=1Nχi(x)(Oi,nx-x)for anynN. 2.8

These mappings do not touch the outer boundary Γ. In particular, there holds ϕn(Ωαn)=Ωα and ϕn-1(Ωα)=Ωαn. Moreover, in the neighbourhood of an arbitrary cut ωαi, this mapping is expressed as ϕn(x)=Oi,nx and, in the neighbourhood of the external boundary, as ϕn(x)=x. In addition, the Jacobi matrix of ϕn is given by

ϕn(x):=I+Jn(x)withJn(x)=i=1Nχi(x)(Oi,nx-x)+χi(x)(Oi,n-I). 2.9

For n large enough, Jn becomes sufficiently close to zero, so det(I+Jn)>0. Therefore, I+Jn remains invertible.

Introducing the mappings ϕn resolves the aforementioned difficulty: by pulling back each solution to the fixed reference domain Ωα, i.e. uαnϕn-1H(Ωα), we place all objects in a single, fixed space and thus verify continuity of the functionals without comparing functions defined on different domains.

Before formulating the existence theorem, we need the following lemma and its proof.

Lemma 2.1

Assume ΩαO2π and consider the sequence {Ωαn}nNO2π. Let un:=uαn for all nN and u:=uα denote the corresponding solutions of (2.3) and define the mapped fields u^n:=unϕnu via the mapping (2.8). If ΩαnΩα as n, then we have u^nu strongly in H(Ωα).

Proof

We can express the identity (2.3) in the form

ΩαC:((I+Jn)-1u^n):((I+Jn)-1v^)det(I+Jn)dx=Ωα(f·v^)det(I+Jn)dxvH0(Ωα).

Utilizing the Neumann series, i.e. the representation (I+Jn)-1=I-Jn+Jn2-, which is valid for Jn2 sufficiently small (as n), and using the properties of determinants in R2 allows us to rewrite the expression as

Ωασ(u^n):ε(v^)dx+Rn(u^n,v^)=Ωαf·v^dx+Ωα(f·v^)det(Jn)dxvH0(Ωα). 2.10

Herein, by the Cauchy–Schwarz inequality and the uniform boundedness of C and Jn, the remainder term satisfies

|Rn(u,v)|COi,n-IuH(Ωα)vH(Ωα)u,vH(Ωα)

for some constant C>0. In view of ΩαnΩα, by definition we get Oi,nI and det(Jn)0 for any i=1,,N as n. Thus, we conclude that Rn(u^n,v^)0 for any v^H0(Ωα) as n. Hence, we get

Ωασ(u^n):ε(v^)dxΩασ(u~):ε(v^)dxv^H(Ωα) 2.11

as n. Combining (2.10) and (2.11), we conclude that

Ωασ(u~):ε(v^)dx=Ωαf·v^dxv^H0(Ωα).

Since the solution of (2.3) is unique for each Ωα, we arrive at u~=u. By the definition of the scalar product ·,·H(Ωα) in (2.2) and using (2.11), we deduce the weak convergence u^nu in H(Ωα), i.e.

u^n,v^H(Ωα)=Ωασ(u^n):ε(v^)dxΩασ(u~):ε(v^)dx=u,v^H(Ωα)vH0(Ωα).

Inserting the test function v^=u^n in (2.10) and exploiting the weak convergence, we obtain

Ωασ(u^n):ε(u^n)dx+Rn(u^n,u^n)=Ωαf·u^ndx+Ωα(f·u^n)det(Jn)dxΩαf·udx. 2.12

On the other hand, we have

Ωαf·udx=Ωασ(u):ε(u)dx. 2.13

Using the definition of the norm ·H(Ωα) from (2.2), and combining (2.12) with (2.13), we deduce the convergence

u^nH(Ωα)=Ωασ(u^n):ε(u^n)dxΩασ(u):ε(u)dx=uH(Ωα).

Finally, combining the weak convergence u^nu and the convergence u^nH(Ωα)uH(Ωα), we conclude the strong convergence u^nu in H(Ωα).

Theorem 2.2

Each of the problems (2.4)–(2.6) allows its own solution.

Proof

For the sake of brevity, we present the proof only for the compliance C(Ωα). In complete analogy, we can get the result for the shape functionals M(Ωα) and M(Ωα), respectively.

Let {Ωαn}nNO2π and ΩαO2π such that ΩαnΩα as n. Using the mappings defined in (2.8), we rewrite the functional C(Ωαn) as an integral over the domain Ωα as

C(Ωαn)=Ωαnσ(un):ε(un)dx=ΩαC:((I+Jn)-1u^n):((I+Jn)-1u^n)·det(I+Jn)dx.

From Lemma 2.1, we thus conclude that

C(Ωαn)=ΩαC:((I+Jn)-1u^n):((I+Jn)-1u^n)det(I+Jn)dxΩασ(u):ε(u)dx=C(Ωα).

By the extreme value theorem, every continuous functional on a compact set attains its extrema. Hence, since C is continuous and O2π is compact, the desired claim follows.

Remark 2.3

We cannot guarantee the uniqueness of the minimizer as the problem under consideration may admit many local minima, in particular due to symmetries. For example, if the external displacements and admissible cuts are invariant under reflections or rotations, different but symmetric cut patterns give the same objective value. This is particularly observed in our numerical results in Subsect. 4.4.

Sensitivity analysis

The most common way to solve optimization problems numerically is to use gradient-based algorithms, for example gradient descent or the quasi-Newton method. To define the gradient, we use the concept of shape calculus. We begin with an introduction of the basic notations and definitions, and finish with the expression of the shape gradient for each of the considered functionals. For a general overview of shape calculus, we refer the reader, for example, to Allaire et al. (2021); Henrot and Pierre (2018); Plotnikov and Sokolowski (2023); Sokołowski and Zolésio (1992).

Fundamentals of shape calculus

Let us consider an arbitrary shape functional F:O2πR and perturbation fields θiW1,(Ωα)2 for i=1,,N such that θi(x)=0 if xΓ(ωα\ωi), i.e. it only perturbs the boundary of the respective cut. Then, for a sufficiently small parameter ϵ>0, we define the perturbed body as

Ωαϵi:=(Id+ϵθi)(Ωα).

Since we consider cuts of fixed shape and size, the only thing we can perturb is their angles. So we define θi as

θi(x):=χi(x)-x2+x1, 3.1

where χi defined in (2.7). The whole perturbation in the neighbourhood of the cut is expressed as

(Id+ϵθi)(x)=1-ϵϵ+1x1x2ifxBri,

which defines a linearized ϵ angle rotation, see Karnaev (2022) for the linearization. In the rest of the domain, the perturbation is the identity mapping

(Id+ϵθi)(x)=IdifxΩ\BRi.

We refer to Fig. 2 for an illustration.

Fig. 2.

Fig. 2

Variation Ωαϵ1of a shape Ωα according to a deformation field θ1

We can define the shape derivative of the functional along the direction given by the perturbation as follows.

Definition 3.1

The shape derivative of the shape functional F is defined as the Gâteaux derivative at Ωα in direction of the vector field θi, i=1,,N, i.e.

dF(Ωα)θi:=ddϵF((Id+ϵθi)(Ωα))|ϵ=0.

Thus, we define the shape gradient as

DF(Ωα)Θ:=[dF(Ωα)θ1,,dF(Ωα)θN]whereΘ=[θ1,,θN].

In addition, we introduce the derivative of the displacement field uα, which quantifies the sensitivity of the solution to (2.1) with respect to variations in the domain. We follow the Lagrangian approach and introduce the following definition.

Definition 3.2

The Lagrangian derivative with respect to the perturbation field θi, i=1,,N, of the displacement field uα at the domain Ωα is defined as the Fréchet derivative of the transported solution at ϵ=0, i.e.

u˙αθi:=ddϵ(uαϵi(Id+ϵθi))ϵ=0,

where uαϵi denotes the solution of (2.1) in the perturbed domain Ωαϵi.

In the context of unconstrained shape optimization, the shape derivative is used to identify a direction θ of deformation such that dF(Ωα)(θ)<0. This direction of deformation serves as a descent direction in an appropriate optimization algorithm, which allows the minimization of the objective functional F(Ωα). Before proceeding to the shape derivatives of the functionals under consideration, we need to note that the shape derivative can be expressed via the integral over the boundary of the domain.

Remark 3.3

In the case of a sufficiently regular domain Ωα, due to Hadamard’s structure theorem (see, e.g. Henrot and Pierre (2018); Sokołowski and Zolésio (1992)), we can conclude that the value of the derivative dF(D)· depends only on the normal component of the vector field θ at the boundary Ωα, i.e.

dF(Ωα)θ=ΩαvΩα(θ·n)ds.

Here, vΩα:ΩαR is a scalar field whose expression depends on the solutions of the underlying boundary value problem and the functional. The expression is commonly called the Hadamard’s form of the shape derivative.

Shape derivatives

We provide next statements about the boundary value problems underlying for the Lagrangian derivative of the displacement field uα and about the expressions for the shape derivatives of functionals C(Ωα) and M(Ωα). We do not give proofs of these statements since they are derived by standard techniques found for example in Allaire et al. (2021).

The next lemma characterizes the Lagrangian derivative of the displacement field uα.

Lemma 3.4

The Lagrangian derivative u˙H1(Ωα)2 of the solution to (2.1) satisfies the boundary value problem

div(σ(u˙αθi)=div((C:uα)θ+C:(θiuα)-div(θi)σ(uα)-fθi)inΩα,σ(u˙α)n=((C:uα)θ+C:(θuα)-div(θi)σ(uα))nonωi,σ(u˙α)n=0onΓN(ωα\ωi),u˙α=0onΓD, 3.2

for any i=1,,N. It corresponds to the variational formulation

Ωασ(u˙αθi):ε(v)=Ωα(C:(θiuα):v+C:uα:(θiv))dx-Ωα(div(θi)σ(uα):ε(v)-div(fθi)·v)dxvH0(Ωα). 3.3

The shape derivative of the compliance C(Ωα) is presented in the next proposition.

Proposition 3.5

The shape derivative of C(Ωα) is given by

dC(Ωα)θi=ωi(σ(uα):ε(uα))(θi·n)ds, 3.4

where i=1,,N.

The shape derivative of the Lp-norm of the von Mises stress M(Ωα) is provided in the following proposition, see also Caubet et al. (2023).

Proposition 3.6

The shape derivative M(Ωα) is given by

dM(Ωα)θi=1p(ωi((σd(uα):σd(uα))p/2-σ(pα):ε(uα)+(f·pα))(θ·n)ds)Ωα(σd(uα):σd(uα))p/2dx1/p-1, 3.5

where i=1,,N and pαH1(Ωα)2 satisfies the adjoint system

div(σ(pα))=2pμdiv(σd(uα)(σd(uα):σd(uα))p/2-1)inΩα,σ(pα)n=2pμ(σd(uα)(σd(uα):σd(uα))p/2-1)nonΓNωα,pα=0onΓD. 3.6

The respective variational formulation is given by

Ωασ(pα):ε(v)=Ωαp(σd(uα):σd(uα))p/2-1σd(uα):σd(v)vH0(Ωα).

Finally, the next proposition gives the shape derivative of the area of the deformed body A(Ωα). Since we have not seen an expression for this before, we shall provide the proof.

Proposition 3.7

The shape derivative of A(Ωα) is given by

dA(Ωα)θi=ωi(det(I+uα)-σ(uα):ε(qα)+f·qα)(θ·n)dx, 3.7

where i=1,,N and qαH1(Ωα)2 satisfies the adjoint system

div(σ(qα))=div(det(I+uα)(I+uα)-)inΩα,σ(qα)n=det(I+uα)(I+uα)-nonΓNωα,qα=0onΓD. 3.8

The respective variational formulation is given by

Ωασ(qα):ε(v)=Ωαdet(I+uα)(I+uα)-:vvH0(Ωα).

Proof

Since the proof does not depend on the particular choice of 1iN, we will simplify our notation in accordance with θθi,ωiω,ΩαϵΩαϵi and likewise uαϵuαϵi.

For sufficiently small θW1,(Ωα)2, a change of variables in the shape functional A(Ωαϵ) yields

A(Ωαϵ)=(Ωαϵ)uαϵdx=Ωαϵdet(I+uαϵ)dx=Ωαdet(I+(I+ϵθ)-1u^αϵ)det(I+ϵθ)dx.

By taking the derivative at ϵ=0, we obtain

dA(Ωαϵ)θ=Ωαdiv(θ)det(I+uα)dx+Ωαdet(I+uα)tr(I+uα)-1(u˙α-θuα))dx=Ωαdiv(θ)det(I+uα)dx+Ωαdet(I+uα)(I+uα)-:u˙αdx-Ωαdet(I+uα)(I+uα)-:(θuα)dx. 3.9

Next, we formulate the variational identity for the adjoint state qαH0(Ωα) as follows:

Ωασ(qα):ε(v)dx=Ωαdet(I+uα)(I+uα)-:vdxvH0(Ωα). 3.10

One readily checks that the variational formulation (3.10) corresponds to the boundary value problem (3.8). By taking u˙α as test function in (3.10) and qα as test function in (3.3), we conclude

Ωαdet(I+uα)(I+uα)-:u˙αdx=Ωα(C:(θuα):qα+C:uα:(θqα))dx-Ωα(div(θ)σ(uα):ε(qα)-div(fθ)·qα)dx.

Thus, we can rewrite (3.9) as

dA(Ωαϵ)θ=Ωαdiv(θ)det(I+uα)dx+Ωα(C:(θuα):qα+C:uα:(θqα))dx-Ωα(div(θ)σ(uα):ε(qα)-div(fθ)·qα)dx-Ωαdet(I+uα)(I+uα)-:(θuα)dx. 3.11

In tensor notation, (3.11) can be rewritten as

dA(Ωαϵ)θ=ΩαT:θdx,

where

T=(det(I+uα)-σ(uα):ε(qα)+f·qα)I+C:(uαqα)+C:(qαuα)-det(I+uα)(I+uα)-u.

Thus, the application of [Laurain and Sturm (2016), Theorem 3.1] under the assumption that θ=(θ·n)n on ωα yields

dA(Ωαϵ)θ=ωαTn·n(θ·n)ds. 3.12

By means of Green’s formula to (3.10), we conclude in view of the boundary conditions in (2.1) that

σ(qα)n=det(I+uα)(I+uα)-nandσ(u)n=0onωα. 3.13

The application of (3.13) to (3.12) yields the desired expression, thus completing the proof.

Numerical realization

In this part of the article, we develop the numerical method for solving the shape optimization problems under consideration. We employ both, the gradient descent method as such and its combination with a genetic algorithm. We aim at optimizing a quadratic piece of skin, in which the cuts are modelled as slits with locations in periodic cells within the domain. We present the outcomes of the gradient descent method in the case of stretching the skin in one axis direction and the outcomes of the combination of a genetic algorithm and the gradient descent method in the case of stretching in two axes directions.

Optimization algorithm

To solve the optimal cut layout problems (2.4)–(2.6), we employ the classical gradient descent method

αn+1=αn-γnDF(Ωαn)Θ, 4.1

where F(Ωαn) is one of the considered shape functionals, DF(Ωαn)Θ is the shape gradient calculated in accordance with Proposition 3.5 for the perturbation field Θ=[θ1,,θN] defined by (3.1). The step size γn is found by a quadratic line search with at most five iterations. Note that in the case of maximization of the area of the deformed body, we just switch the sign in front of the shape functional to cast it into a minimization problem.

Numerical experiments have shown that the shape optimization problem under consideration has a low sensitivity and many local minima, which in some configurations makes the solution of the problem by the gradient descent method significantly more difficult, even when using accelerated variants such as the quasi-Newton or the Nesterov scheme, see Fletcher (1980); Nesterov (2018) for example. Therefore, inspired by the successful results of combining global optimization methods with continuous optimization in Harbrecht and Loos (2016) for a similar shape optimization problem, we shall address the application of a genetic algorithm, cf. Haupt and Haupt (2004).

A genetic algorithm is a stochastic method used to solve optimization problems. It lacks the precision of gradient-based methods because it does not study the function to be minimized. It evaluates the objective functional (fitness) for the optimization variables (individuals). The algorithm runs as follows: an initial population of individuals evolves over multiple generations through the simulated genetic operations of mutation and crossover. The fittest individuals survive and reproduce, advancing the population. The initial population consists of M individuals, obtained by a specified heuristics or generated randomly. To transition from one generation to the next, we follow the steps:

  1. The current population (parents) mutates and produces a generation of children.

  2. The elite is selected from the generations of parents and children based on the fitness.

  3. The elite is crossed to produce the new children.

  4. The new elite replaces the old population.

As a mutation, we use a gradient descent step (4.1) with step size γn=DF(Ωαn)Θ2-1. Crossover children are created by intersecting the vectors of a pair of parents: we randomly choose two parents (here: p1 and p2) and a cut position, then we exchange the components of both parents and create two children (here: c1 and c2). For example:

p1=[1,2,3,4,5,6,7]p2=[a,b,c,d,e,f,g]c1=[1,2,3,4,e,f,g]c2=[a,b,c,d,5,6,7]

Identical individuals are not allowed in the population. Then, at some stage, the fittest individual no longer changes and displaces all others in the population by the crossover and elite choice. Once it has displaced all the rest, the algorithm naturally stops. Note that the most computationally expensive part of the above algorithm is the computation of the solution of the direct problem and the calculation of the shape gradient. This, however, can be easily parallelized.

Computational setup

The domain Ω=(0,1)2, which represents the piece of skin, is chosen as the unite square. We divide the domain into 3×3 equal blocks, each of which being a copy of the others. Inside these blocks, we introduce a grid of 4×4 quadratic cells of edge size 1/12. In the centre of each cell, we put an ellipse-shaped cut with semi-axes 0.75/12 and 0.05/12. Thus, we get ωα with 144 cuts in all, but only N=16 design variables (the rotation angles of the cuts), compare Fig. 1. We do so in order to improve the optimization results, since each of the components α defines nine cuts at once which increases the sensitivity of the functional with respect to a change in the design variables.

For solving the equations of linear elasticity on the respective layout, we apply the finite element method as provided by the finite element solver FreeFem++, see Hecht (2012). The material parameters are set as proposed in the review article (Kalra et al. 2016): the Young modulus is E=50 MPa and the Poisson is ratio ν=0.48. Since the finite element mesh is automatically adapted towards the current geometry during the optimization process, it is sufficient to say that the finite element mesh size varies from hmin=6.5·10-4 to hmin=7.5·10-3, which leads to a number of about 165,000 finite elements. An illustration of the finite element mesh in case of a random configuration can be found in Fig. 3.

Fig. 3.

Fig. 3

Skin grafting model with a random configuration of cuts. The finite element mesh consists of roughly 165,000 finite elements

We consider two stress models. The first one is stretching in one axial direction, i.e. ΓD consists of two opposite boundaries of the square Ω, on which there is a Dirichlet condition, and the remaining boundaries ΓN are free. The second one is the stretching in both axial directions, i.e. a Dirichlet boundary condition is prescribed at the whole boundary Ω=ΓD. In both cases, we set g=0.25n and f=0. Note that, with this setup, the solution of the equations of linear elasticity will admit singularities in the vertices of the square. A visualization of the stretched skin in case of the random configuration from Fig. 3 can be found in Fig. 4.

Fig. 4.

Fig. 4

Stretched skin for the random configuration of cuts: (a) single axis stretching, (b) bi-axial stretching

Numerical results: stretching in one axial direction

In the case of stretching in one axial direction, the gradient descent method provides satisfactory results. The initial configuration is the same for all experiments and the one presented in Fig. 3. A total of 100 iterations is performed, and the outcomes obtained are presented in Fig. 5. Note that, in all our subsequent experiments, we have chosen p=5 when minimizing the Lp-norm of the von Mises stress.

Fig. 5.

Fig. 5

Stretching in one axial direction. Final cut configuration (left), deformed skin (middle), and convergence history (right): first row—compliance C(Ωα), second row—L5-norm of the von Mises stress M(Ωα), third row—area of the deformed body A(Ωα)

When minimizing the compliance C(Ωα), the optimal design is a horizontal arrangement of the cuts. More precisely, all cuts are perpendicular to the stretch direction, which is a reasonable configuration, see the first row in the Fig. 5. It allows for the largest possible opening of the cuts, which makes the stretching process easier. The deformation in this situation is characterized by a minimum amount of work. However, the skin in the area between the cuts is quite thin, which increases its stress. Therefore, it is not surprising that, in order to decrease the stress intensity, it is necessary to find a better balance between stretching easiness and maintaining sufficient thickness in the areas between the cuts. Thus, when minimizating the L5-norm of the von Mises stress M(Ωα), the optimal design is a zigzag configuration, compare the second row in Fig. 5.

Finally, in the case of the maximization of the area of the stretched skin, i.e. when considering the shape functional A(Ωα), we on the one hand maximize the area of the entire deformed body A(Ωuα) and on the other hand minimize the size of the deformed cuts A((ωα)uα). Therefore, the logical result is a diagonal configuration of the cuts, see the third row in Fig. 5. Then, the contraction of the body perpendicular to stretching and the deformation of the cuts are in balance.

The optimal configurations found by the optimization process are summarized in Fig. 6 without computational noise in the outcomes caused by the simulation process.

Fig. 6.

Fig. 6

Illustration of the optimal designs in case of stretching the skin in one axial direction

Numerical results: stretching in two axial directions

In the case of stretching the skin in both axial directions, solely using the gradient descent method is not successful since we get stuck in one of the many local minima. We refer the reader to Fig. 7 where we present the respective result in case of the minimization of the compliance functional.

Fig. 7.

Fig. 7

Result of the gradient descent method for the compliance C(Ωα) when we stretch the skin in two axial directions: Final cut configuration (left) and convergence history (right)

However, the combination of the gradient descent method with the genetic algorithm gives reasonable results. The initial population consisted of 150 random individuals as specified in Fig. 5. It took about 30 iterations for each functional to obtain a single elite individual. The results can be found in Fig. 8. The convergence histories represent the values of the objective functional for the fittest individual in the population during the algorithm’s execution.

Fig. 8.

Fig. 8

Stretching in two axial directions. Final cut configuration (left), deformed skin (middle) and convergence history(right): first row—compliance C(Ωα), second row—L5-norm of the von Mises stress M(Ωα), third row—area of the deformed body A(Ωα)

In the case of compliance minimization C(Ωα), we obtained a configuration that switches between horizontal and vertical cuts, see the first row in Fig. 8. This configuration is remarkable because it gives the skin auxetic properties. Unlike conventional structures, auxetic ones expand perpendicular to the stretching axes rather than shrinking. This results in a negative Poisson ratio. With this configuration, the work required to deform the body is minimized. We get also the same configuration when maximizing the area of the deformed body A(Ωα).1

In the case of stretching in two axial directions, the area of the body without taking into account the cuts A(Ωuα) is always the same, since we specify the deformation of the entire boundary, but the area of the cuts themselves changes. Therefore, this problem of maximization of the area of the skin amounts to minimizing the area A((ωα)uα) of the cuts after deformation. Therefore, it is optimal to deform the elliptical cuts into circles, which indeed can be achieved with the swapping pattern.

Finally, when minimizing the L5-norm of the von Mises stress M(Ωα), we obtained the same zigzag pattern as when we stretch in one axial direction. This is reasonable since in the present situation it is important to avoid thinning of the skin between the cuts where the stress is highest.

The optimal configurations found by the optimization process are again summarized in Fig. 9 without computational noise in the outcomes caused by the simulation process.

Fig. 9.

Fig. 9

Illustration of the optimal designs in case of stretching the skin in two axial directions

Conclusion

In this article, we considered the problem of optimizing the layout of the cut configuration for skin grafting within the framework of linear elasticity. The cuts are located in periodic cells and are specified by the angle of rotation. We formulated the optimization problem with three objective functionals: the compliance, the Lp-norm of the von Mises stress, and the area of the deformed body. For the solution of each of these optimization problems, we established an existence result. By using shape calculus, we derived the corresponding shape gradients with respect to the cut configuration and implemented a numerical approach based on gradient descent. The combination of this approach with a genetic algorithm avoids getting stuck in one of the numerous local minima. We obtained reasonable numerical results in the case of stretching the skin in one and two axial directions.

The presented approach offers a mathematically solid and computationally feasible tool for the optimization in the context of skin grafting. It, however, also opens up several directions for future research. Extending the mathematical model to include hyperelastic behaviour would better capture the non-linear mechanical properties of the skin. Further, allowing more general cut geometries could enhance the practical relevance of the simulations. Finally, the formulation of optimization strategies that explicitly promote auxetic behaviour could offer promising avenues for improving the outcomes of skin grafts.

Author contributions

Helmut Harbrecht was responsible for conceptualization, methodology, modeling, and writing—review and editing. Viacheslav Karnaev was responsible for conceptualization, methodology, modeling, software development, and drafting the original manuscript.

Funding

Open access funding provided by University of Basel.

Data availability

The results presented in this article can be replicated by implementing the data structures and algorithms presented in this article. The objective functionals and their shape gradients can be used as described and only require the inputs specified in the problem’s description.

Declarations

Conflict of interest

The authors disclose financial or non-financial interests.

Footnotes

1

By taking a closer look to Fig. 8, one readily infers that the swap pattern is shifted, compare also Fig. 9. But for symmetry reasons, both patterns represent minimizers with identical values in the respective objective functional.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  1. Allaire G, Dapogny C, Jouve F (2021) Shape and topology optimization. Handbook of Numerical Analysis. volume 22. Elsevier, Amsterdam, pp 1–132
  2. Maskan Bermudez N, Sa BC, Hargis A, Yaghi M, Mervis J (2024) Skin grafting for dermatologists: Past, present, and future. Curr Dermatol Rep 13:47–54 [Google Scholar]
  3. Braess D (2001) Finite Elements. Theory, Fast Solvers, and Applications in Solid Mechanics. Cambridge University Press, Cambridge, second edition
  4. Brenner SC, Scott LR (2008) The Mathematical Theory of Finite Element Methods, 3rd edn. Springer, Berlin
  5. Capek L, Flynn C, Molitor M, Chong S, Henyš P (2018) Graft orientation influences meshing ratio. Burns 44(6):1439–1445 [DOI] [PubMed] [Google Scholar]
  6. Caubet F, Dambrine M, Gargantini G, Maynadier J (2025) Shape optimization of polynomial functionals under uncertainties on the right-hand side of the state equation. SIAM J Contr Opt 63(4):2632–2658 [Google Scholar]
  7. Delfour MC, Zolésio J-P (2011) Shapes and Geometries: Metrics, Analysis, Differential Calculus, and Optimization, 2nd edn. Advances in Design and Control. Society for Industrial and Applied Mathematics, Philadelphia
  8. Fletcher R (1980) Practical methods for optimization. Wiley, New York [Google Scholar]
  9. Gupta S, Gupta V, Chanda A (2022) Biomechanical modeling of novel high expansion auxetic skin grafts. Int J Numeric Methods Biomed Eng 38(5):e3586 [Google Scholar]
  10. Gupta V, Chanda A (2023) Expansion potential of novel skin grafts simulants with I-shaped auxetic incisions. Biomed Eng Adv 5:100071 [Google Scholar]
  11. Gupta V, Singh G, Chanda A (2022) Development and testing of skin grafts models with varying slit orientations. Mater Today Proc 62(6):3462–3467 [Google Scholar]
  12. Harbrecht H, Loos F (2016) Optimization of current carrying multicables. Comput Optim Appl 63:237–271 [Google Scholar]
  13. Haupt RL, Haupt SE (2004) Practical Genetic Algorithms. John Wiley & Sons, Hoboken, New Jersey
  14. Hecht F (2012) New development in freefem++. J Numer Math 20(3–4):251–266 [Google Scholar]
  15. Henrot A, Pierre M (2018) Shape Variation and Optimization, volume 28 of EMS Tracts in Mathematics. European Mathematical Society (EMS), Zürich
  16. Joodaki H, Panzer MB (2018) Skin mechanical properties and modeling: A review. Proc Inst Mech Eng [H] 232(4):323–343 [Google Scholar]
  17. Laurain A, Sturm K (2016) Distributed shape derivative via averaged adjoint method and applications. ESAIM: Math Model Numl Anal 50(4):1241–1267 [Google Scholar]
  18. Kalra A, Lowe A, Al-Jumaily AM (2016) Mechanical behaviour of skin: A review. J Mater Sci Eng 5(4):1000254 [Google Scholar]
  19. Karnaev VM (2022) Optimal control of thin elastic inclusion in an elastic body. Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electro Mathe Rep] 19(1):187–210 [Google Scholar]
  20. Nesterov Y (2018) Lectures on Convex Optimization, volume 137 of Springer Optimization and Its Applications. Springer Nature Switzerland, Cham, second edition
  21. Pironneau O (1983) Optimal shape design for elliptic systems. Springer, New York [Google Scholar]
  22. Plotnikov PI, Sokolowski J (2023) Geometric aspects of shape optimization. J Geom Anal 33(7):206 [Google Scholar]
  23. Sokołowski J, Zolésio JP (1992) Introduction to Shape Optimization. Shape Sensitivity Analysis, volume 16 of Springer Series in Computational Mathematics. Springer, Berlin-Heidelberg
  24. Sutula D, Henyš P, Čapek L (2020) Optimal structural pattern for maximal compliance using topology optimization based on phasefields: Application to improve skin graft meshing efficiency. Int J Num Method Biomed Eng 36:e3405 [Google Scholar]
  25. Taylor BC, Triplet JJ, Wells M (2021) Split-thickness skin grafting: a primer for orthopaedic surgeons. J Am Acad Orthop Surg 29(20):855–861 [DOI] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

The results presented in this article can be replicated by implementing the data structures and algorithms presented in this article. The objective functionals and their shape gradients can be used as described and only require the inputs specified in the problem’s description.


Articles from Biomechanics and Modeling in Mechanobiology are provided here courtesy of Springer

RESOURCES