Professional Documents
Culture Documents
1 Introduction
The geometrical shape minimization problem can be
formulated as an unconstrained nonlinear programming
problem, where the objective function is the final total
volume and the displacements of the nodal points are the
unknowns. The shape volume is discretized into line,
triangle and tetrahedron elements. The elements are
interconnected at their nodal points. It is important to
emphasize that by construction, the final element state is
uniquely defined in terms of its nodal displacements.
x1
u2
u1
x2
v
1
x
Figure 1
v = v + u2 − u1
v = ( v Tv ) 2
1
v = ⎡vTv + 2vT ( u2 − u1 ) + ( u2 − u1 ) ( u2 − u1 ) ⎤ 2
T
⎣ ⎦
φ = α v
⎢⎣u3 ⎥⎦ ⎢⎣u6 ⎥⎦
1 ⎡ −v ⎤
∇φ = α
v ⎢⎣ + v ⎥⎦
x3
v2
x1 v1
3
u
x2
v3
u1
x3
2
v
v1 u2
x1
v3
x2
Figure 2
v1 = v1 + u3 − u2
v2 = v2 + u1 − u3
v3 = v3 + u2 − u1
w = v1 × v2
w = v1 × v2
w = w +
+ v1 × u1 + v2 × u2 + v3 × u3 +
+u1 × u2 + u2 × u3 + u3 × u1
λ
φ = w
2
x4
v1 v3
v2
x1
x3
u4
u1
x2
x4
u2 u3
1
v
v3
v2
x1
x3
x2
Figure 3
v1 = v1 + u1 − u4
v2 = v2 + u2 − u4
v3 = v3 + u3 − u4
φ = − ( v ) ( v × v3 )
1 1 T 2
6
Note that if the apex moves below the base, the volume
becomes negative.
v1 = v1 + u1 − u4 ⎫
⎪
v2 = v2 + u2 − u4 ⎬ ⇒
v3 = v3 + u3 − u4 ⎪⎭
(
1 1
v + u1 − u4 ) ⎡⎣( v2 + u2 − u4 ) × ( v3 + u3 − u4 ) ⎤⎦
T
φ = −
6
di = ui − u4 ⇒
−6φ = ( v1 ) (v × v3 ) +
T 2
+ ( d1 )(v × v3 ) + ( d 2 )
(v × v1 ) + ( d3 ) (v × v2 ) +
T 2 T 3 T 1
+ ( v ) (d
1 T 2
× d ) + ( v ) (d
3 2 T 3
× d1 ) + ( v ) (d
3 T 1
× d2 ) +
+ (d ) (d
1 T 2
× d )3
2
ηφ0 ⎛ φ − φ0 ⎞
φ = ⎜ ⎟
2 ⎝ φ0 ⎠
⎛ φ − φ0 ⎞
∇φ = η ⎜ ⎟ ∇φ
⎝ φ0 ⎠
φ
ε = −1
φ0
ηφ0 2
φ = ε
2
∇φ = ηε∇φ
Line element
1
v̂ = v
v
z =
1
v
(u2
− u1 )
ˆTz + zTz
2v
ε =
v̂ + z + 1
Triangle element
w = w
w ˆ
w z =
+ ( v1 − u2 ) × u1 +
+ ( v2 − u3 ) × u2 +
+u3 × ( v1 + v2 + u1 )
ˆTz + zTz
2w
ε =
ŵ + z + 1
Tetrahedron element
1
v̂i = i
vi
v
zi =
1
vi
(ui
− u4 )
( vˆ ) ( vˆ × vˆ ) ε =
1 T 2 3
+ (v ˆ ) (v
1 T
ˆ + z) ×z
2 2 3
+
+ (v ˆ ) (v
2 T
ˆ + z) ×z
3 3 1
+
+ (v ˆ ) (v
3 T
ˆ + z) ×z
1 1 2
+
+ (z ) (z × z )
1 T 2 3
π (u) = ∑
elements
φ (u)
∇π ( u ) = ∑
elements
∇φ ( u )
Figure 4
⎡⎛ x ⎞2 ⎛y⎞ ⎤
2
z = h ⎢⎜ ⎟ − ⎜ ⎟ ⎥
⎣⎝ r ⎠ ⎝r⎠ ⎦
⎛z⎞
y (z) = c cosh ⎜ ⎟
⎝c⎠
2r 2c ⎛h⎞
= cosh ⎜ ⎟
h h ⎝ 2c ⎠
Figure 7
The general problem of connecting n points by the shortest
path length is called Steiner problem [2]. Its solution
contains straight lines intersecting at 120°. The number of
intersections is between zero and (n - 2).
Figure 8
Figure 9
Figure 15
8 Appendix 1
Figure 16 shows a straight prismoid. The bottom and top
regular polygons are inscribed in circles of different
radius. The sum of the lengths of the red lines is
minimized by rotating the top polygon counterclockwise with
respect to the bottom polygon, while the lengths of the
black lines remain constant.
pi
pi
Figure 16
8.1 Geometry
2π
γ =
n
⎡r cos ( γi) ⎤
p = ⎢⎢r sin ( γi) ⎥⎥
i
⎢⎣ 0 ⎥⎦
⎡ r cos ( θ + γi) ⎤
p = ⎢⎢r sin ( θ + γi) ⎥⎥
i
⎢⎣ hθ ⎥⎦
bi = pi + 1 − pi
di = pi − pi + 1
vi = pi − pi
vi = pi − pi ⇒
2
vi = r2 + r2 − 2rr cos θ + h2θ
bi + di − vi = 0 ⇒
2
∂ di sin γ
= 0 ⇒ tan θ =
∂θ cos γ − 1
h02 − h2θ 1
= (2 − 2 cos γ ) 2 + 2
rr
Table 2
n θ h02 − h2θ
rr
3 150.0 3.732051
4 135.0 3.414214
5 126.0 3.175571
6 120.0 3.000000
7 115.7 2.867767
8 112.5 2.765367
9 110.0 2.684040
∞ 90.0 2.000000
9 Appendix 2
Figure 17 shows a straight prismoid. The projection of the
bottom and top closed polygonal chains is a regular polygon
inscribed in a circle of radius = r. The Z coordinates of
the bottom points alternate between ±δ while the Z
coordinates of the corresponding top points alternate
between the height of the prismoid ∓ δ . The corresponding
bottom and top points are connected by elements only when
its distance is the smallest between the two possible
values. The sum of the lengths of the red lines is
minimized by rotating the top polygonal chain
counterclockwise with respect to the bottom polygonal
chain, while the lengths of the black lines remain
constant.
pi + 2
pi
pi + 2
pi
Figure 17
9.1 Geometry
2π
γ =
n
⎡r cos ( γi) ⎤
⎢ ⎥
pi = ⎢r sin ( γi) ⎥
⎢ ⎥
⎣ ( −1) δ ⎦
i
⎡r cos ( θ + γi) ⎤
⎢ ⎥
pi = ⎢r sin ( θ + γi) ⎥
⎢ ⎥
⎣ hθ − ( −1) δ ⎦
i
bi = pi + 1 − pi
di = pi − pi + 1
vi = pi − pi
vi = pi − pi ⇒
Notice that there are two different values for this norm.
The smallest value, associated with i even, is given by:
( hθ − 2δ ) = ( h0 − 2δ ) − 2r2 (1 − cos θ )
2 2
bi + di − vi = 0 ⇒
2 2 2
di = vi + bi +
−2r2 (1 − cos γ ) − 2r2 ⎡⎣cos ( θ − γ ) − cos θ⎤⎦ + 4hθδ − 8δ2
2
∂ di
= 2r2φ ( θ ) = 0
∂θ
Notice that this expression is valid when the vectors
connect the corresponding bottom and top points in any
symmetric way.
sin γ
tan θ =
cos γ − 1
θ < θ < π
h0 ≥ 2r + 2δ ⇒ hθ ≥ 2δ
sin (2γ )
tan θ = ⇒
cos (2γ ) − 1
2
⎛ h0 δ⎞
2
⎡ 2 cos γ δ⎤
⎜ − 2 ⎟ = ⎢ ⎥ + 2 (1 + sin γ )
⎝r r⎠ ⎣ (1 − cos γ ) r ⎦
hθ 2 δ
=
r (1 − cos γ ) r
10 Appendix 3
w = w +
+ v1 × u1 + v2 × u2 + v3 × u3 +
+u1 × u2 + u2 × u3 + u3 × u1
11 References
[1] Gill, P. E. and Murray, W. Newton type methods for
unconstrained and linearly constrained optimization,
Mathematical Programming 7, 311-350, 1974.