Proceedings of the 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA2010)

Universiti Tunku Abdul Rahman, Kuala Lumpur, Malaysia 704

The shortest path between two points on some

surface by using the application of
Euler equation
Nathaphon Boonnam1 and Pakkinee Chitsakul2
1,2
Department of Mathematics, Faculty of Science, King Mongkut’s Institute of Technology
Ladkrabang, Bangkok, Thailand.
1
[email protected]
2
[email protected]

Abstract. It is well-known that the shortest curve on surface of sphere is great circle.
However, finding of the shortest curve on other surface is not much studied. Currently,
many researchers are more interested in studying about this field. A curve which is called
geodesic is a curve that accelerates to surface. The definition of geodesic is α& ⋅ α
&& = 0
and orthogonal to the tangent space. In this paper, we offered the shortest path on some
surfaces of revolution. Then, we analyzed the parametric equation to determine the
shortest curve by using the application of Euler equation. Finally, the given examples can
be used to apply in clinical application and other.

1 Introduction

The Geodesic problem is the problem about the shortest distance on arbitrary
surfaces by considering from distance that minimizes non-increasing. In
addition, geodesic generate directions on surface as well. It can be found by
generalizing the equation for the length of a curve, and then minimizing this
length using the calculus of variations. This has some minor technical
problems, because there is different ways to parameterize the shortest path. It is
simpler to demand not only that the curve locally minimize length but also that
it is parameterized with constant, meaning that the distance between two points
along the geodesic is proportional to their points.
While the case of finding the shortest path between two points in a plane is
straight line. In many methods exist for making this generalization, such as
using isometric maps to surfaces with known geodesics, one of the most useful
methods in finding analytical solution by using the Euler equation. A geodesic
can be represented by the solution of a second-order ordinary differential
equation. Traditionally, with a given point and its tangent direction being the
initial condition, the numerical solution of a geodesic can be obtained. But this
method cannot ensure the requirement that the obtained geodesic pass through
another fixed terminal point with this requirement being essential in practical
winding.
Proceedings of the 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA2010)
Universiti Tunku Abdul Rahman, Kuala Lumpur, Malaysia 705

2 Preliminary

2.1 Euler equation

The Euler equation is an equation whose solution extremizes a functional

α
L  y ( x )  = ∫ f ( x, y, y′ ) dx . (1)
β
It is given by the ordinary differential equation,
∂ d ∂
f ( x, y, y ′ ) − f ( x, y , y ′ ) = 0 . (2)
∂y dx ∂y′
When comparing with almost argument, by y is a continuous differential
function and satisfies certain boundary conditions (if the shortest path between
points a and b such that g (α ) = a and g ( β ) = b ) which a functional
extremizes.

2.2 The shortest path on parametrized surfaces

A general solution can be given for finding the shortest path on surfaces which
can be parametrized in the form x = x ( u , v ) , y = y ( u , v ) and z = z ( u , v ) . The
shortest path that is the minimum arc length is given by
α
L=∫ ( dx ) + ( dy ) + ( dz )
2 2 2
. (3)
β

Note that dx is given by

∂x ∂x
dx = du + dv .
∂u ∂v
Thus, dx 2 is given by
2 2
 ∂x  ∂x ∂x  ∂x 
dx 2 =   du 2 + 2 dudv +   dv 2 .
 ∂u  ∂u ∂v  ∂v 
Similarly, we have
2 2
 ∂y  ∂y ∂y  ∂y 
dy =   du 2 + 2
2
dudv +   dv 2
 ∂u  ∂u ∂v  ∂v 
and
2 2
 ∂z  ∂z ∂z  ∂z 
dz =   du 2 + 2
2
dudv +   dv 2 .
 ∂u  ∂u ∂v  ∂v 
Substituting these equations into (3), we get
α
L=∫ E + 2 Fv′ + Gv′2 du (4)
β
Proceedings of the 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA2010)
Universiti Tunku Abdul Rahman, Kuala Lumpur, Malaysia 706

2 2 2
 ∂x   ∂y   ∂z 
where E ≡   +  +  ,
 ∂u   ∂u   ∂u 
∂x ∂x ∂y ∂y ∂z ∂z
F≡ + + ,
∂u ∂v ∂u ∂v ∂u ∂v
2 2 2
 ∂x   ∂y   ∂z 
and G ≡   +  +  .
 ∂v   ∂v   ∂v 
Taking derivatives of integrand into (4), we find
−1/ 2  ∂E ∂F ∂G 2 
= ( E + 2 Fv′ + Gv′2 ) 
df 1
+2 v′ + v′ 
dv 2  ∂v ∂v ∂v 
and
= ( E + 2 Fv′ + Gv′2 ) ( 2 F + 2Gv′ ) .
df 1 −1/ 2

dv′ 2
The Euler equation (2) then becomes
∂E ∂F ∂G 2
+2 v′ + v′
∂v ∂v ∂v d  F + Gv′ 
−  =0. (5)
2 E + 2 Fv′ + Gv′2 du  E + 2 Fv′ + Gv′2 

3 The Shortest Path

In the plane, the Riemannian metric is given by ds 2 = dx 2 + dy 2 where ds is an

infinitesimal length. Therefore, the arc-length of curve in the plane between
two points, meaning the shortest path, is a straight line.
The Euler equation can also be solved to find the shortest path on the
surface of a unit sphere. It well known that the shortest path between two
points on a sphere is on a plane that contains the origin of the sphere. Thus,
pick any two points on the sphere and then solve for the plane which contains
the two points and the origin; the shortest path is the intersection of the plane
and the sphere, the great circle.
In addition, we find the shortest path on other surfaces that consists of
cylinder, cone, paraboloid, hyperboloid, and torus to the following.

3.1 The Shortest Path on a Cylinder

The Euler equation can also be solved to find the shortest path on the surface of
z-axis positively. The metric on a cylinder is ds = R 2 dθ 2 + dz 2 . Thus,
Proceedings of the 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA2010)
Universiti Tunku Abdul Rahman, Kuala Lumpur, Malaysia 707

2
b b  dθ 
L = ∫ ds = ∫ R dθ + dz = ∫
2 2 2 2
R   + 1dz .
a a
 dz 
The Euler equation becomes
d  ∂  ∂
2 2
2  dθ   dθ 
 R   + 1  − R2   +1 = 0
dz  ∂ ddzθ  dz   ∂θ  dz 
 
which can be written
d  2  dθ  
2
R   dθ  =0.
 R2   + 1
dz   dz   dz  

Integrating this gives
2
 dθ   dθ 
 +1 = c .
2 2
R   R 
 dz   dz 
Therefore,
c
θ= z + constant .
R R2 − c2
This equation means that the points which are on the shortest path between two
points on a cylinder. The geodesic is the intersection of cylinder and plane.
That is so because the principle normal to any of its points is parallel to the
normal to the surface at this point.
To verify the existence of other geodesics on the cylinder C , we shall
consider a parametrization
x ( u , v ) = ( cos u , sin u , v )
of the cylinder in a point p ∈ C , with x ( 0, 0 ) = p . In this parametrization,
a neighborhood of p in C is expressed by x ( u ( s ) , v ( s ) ) , where s is the arc
length of C . Therefore, excluding the cases already obtained,
u ( s ) := as , v ( s ) := bs , a 2 + b2 = 1 .
A geodesic of the cylinder is locally of the form ( cos as, sin as, bs ) , and thus it
is helix as shown in Fig. 1.
Proceedings of the 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA2010)
Universiti Tunku Abdul Rahman, Kuala Lumpur, Malaysia 708

( a, b )

Fig. 1. The shortest path on a cylinder.

3.2 The Shortest Path on a Cone

The Euler equation can also be solved to find the shortest path on the surface of
z-axis positively. The metric on a cylinder is ds = u 2 dv 2 + 2du 2 . Thus,
2
b b  dv 
L = ∫ ds = ∫ u dv + 2du = ∫
2 2 2
u   + 2du .
2
a a
 du 
The Euler equation becomes
d  ∂  ∂
2 2
2  dv   dv 
 u   +2 −  vu   + 2 = 0
du  ∂ du
dv
 du   ∂v  du 
 
which can be written
d  2  dv  
2
u    dv 
u2   + 2  = 0 .
du   du   du  

Therefore,
   c + c2 − u 2  
v =  c 2 − u 2 ln  2 
   u
 

  
(
u2 − c2 . )

This solution aforementioned that have the variable greatly. By the alternative
form of Euler equation becomes,
 dv   ∂ 
2 2
2  dv  2  dv 
u   + 2 −   dv u   + 2  = c
 du   du   ∂ du  du  

which can be written
2
=c.
2
 
dv
u2   + 2
 du 
Proceedings of the 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA2010)
Universiti Tunku Abdul Rahman, Kuala Lumpur, Malaysia 709

Therefore,
4 − 2c 2
v= ln u + constant .
c
Although this equation can be find solution easier than above. However, both
of solutions exist if and only if the value of u be non-zero, that is, this
equation depend on every point except apex of cone. This is not always so can
be seen by considering slices of cone, parallel to its base.
Since the area of a slice varies as the square of its distance from the cone’s
vertex, the area function obtained looks like a piece of the curve y = x , which
is certainly not concave. However, it is reasonable to assume that the cone is
frustum, since it is only just a convex body: its curved surface is made up of
straight lines.
Note that the points that are on the shortest path between two points on a
cone have a solution above that except the apex as shown in Fig. 2.

( a, b )

Fig. 2. The shortest path on a cone.

4 Application in the Clinical field

The traditional method of finding the shortest path between two points is routes
of one airline from the city to another. This is well-known that the most
obvious about the application in Geodesic problem. Furthermore, we find the
shortest path between two points on cylinder and cone. Modern technology can
be applied today as well.
The Clinical technique of effective operation is small surgical scar and rapid
because it allows recovery of the body relieve or prevent complication that
may arise with patients. Nevertheless, surgeon is necessary in planning the
surgery. If the above theory in this paper application can be applied, it
considered to be more beneficial to the operation.
Proceedings of the 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA2010)
Universiti Tunku Abdul Rahman, Kuala Lumpur, Malaysia 710

Fig. 3. The arm-shaped geometry similar to the cylinder.

Another important factor in the case of operation cannot surgery with human
individually. Therefore, the usage of technology is called “Laser knife” to help
alleviate the burden on surgeon more effectively. In Fig. 3, if we look at arm-
shaped geometry similar to the cylinder, we will be able to find the shortest
path to the surgery. Accordingly, the application of Geodesic problem is useful
of clinical field a lot. It is also an alternative that will facilitate the surgeon in
operation.

5 Conclusion

Using the application of Euler equation which is on the shortest path between
two points on a cylinder is locally of the form ( cos as, sin as, bs ) , and thus it is
helix. In the case of cone, this equation can be find solution depend on every
point except apex of cone. It means that the points that are on the shortest path
between two points on a cone have a solution above that except the apex.

6 Future work
The further process, we will take results to construct the algorithm with
program to simulate. After all the preparation is complete, we will make
contact for actual trial of surgery at the hospital in Thailand.
After that if we will take the both of cylinder and cone to stick together and
find the shortest path on this surface, it would be applied as shown in Fig. 4.
Proceedings of the 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA2010)
Universiti Tunku Abdul Rahman, Kuala Lumpur, Malaysia 711

Fig. 4. The lung-shaped geometry similar to cylinder-stick-cone together.

References
1. A.S. Gupta: Calculus of variations with Applications. Prentice-Hall. New Delhi. (1997)
2. M.P. do Carmo: Differential Geometry of Curves and Surfaces. Prentice-Hall. Englewood Cliffs. New
Jurseyl. (1976)
3. V.A. Toponogov: Differential Geometry of Curves and Surfaces. Birkhauser. Boston. Massachusetts.
(2006)